commit solution 485

Author: lxlxw

index-tags.md

@@ -21,6 +21,7 @@
 |  [268](https://leetcode-cn.com/problems/missing-number)  |  [缺失数字](/solution/200-299/0268.missing-number/)  |  `位运算`,`数组`,`数学`  |  <font color=green>简单</font>  |✅ |
 |  [283](https://leetcode-cn.com/problems/move-zeroes)  |  [移动零](/solution/200-299/0283.move-zeroes/)  |  `数组`,`双指针`  |  <font color=green>简单</font>  |✅ |
 |  [414](https://leetcode-cn.com/problems/third-maximum-number)  |  [第三大的数](/solution/400-499/0414.third-maximum-number/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
+|  [485](https://leetcode-cn.com/problems/max-consecutive-ones)  |  [最大连续1的个数](/solution/400-499/0485.max-consecutive-ones/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
 
 #### **字符串**
 
@@ -29,6 +30,7 @@
 |  [13](https://leetcode-cn.com/problems/roman-to-integer)  |  [罗马数字转整数](/solution/1-99/0013.roman-to-integer/)  |  `数学`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [20](https://leetcode-cn.com/problems/valid-parentheses)  |  [有效的括号](/solution/1-99/0020.valid-parentheses/)  |  `栈`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [28](https://leetcode-cn.com/problems/implement-strstr)  |  [实现 strstr()](/solution/1-99/0028.implement-strstr%28%29/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
+|  [58](https://leetcode-cn.com/problems/length-of-last-word)  |  [最后一个单词的长度](/solution/1-99/0058.length-of-last-word/)  |  `字符串`  |  <font color=green>简单</font>  |✅ |
 |  [125](https://leetcode-cn.com/problems/valid-palindrome)  |  [验证回文串](/solution/100-199/0125.valid-palindrome/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [344](https://leetcode-cn.com/problems/reverse-string)  |  [反转字符串](/solution/300-399/0344.reverse-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |
 |  [345](https://leetcode-cn.com/problems/reverse-vowels-of-a-string)  |  [反转字符串中的元音字母](/solution/300-399/0345.reverse-vowels-of-a-string/)  |  `双指针`,`字符串`  |  <font color=green>简单</font>  |✅ |

index-type.md

@@ -20,7 +20,7 @@
 |  [35](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/1-99/0035.search-insert-position/)  |  `数组`,`二分查找`  |  <font color=green>简单</font>  |✅ |
 |  [38](https://leetcode-cn.com/problems/count-and-say)  |  [外观数列](/solution/1-99/0038.count-and-say/)  |  `字符串`  |  <font color=green>简单</font>  |
 |  [53](https://leetcode-cn.com/problems/maximum-subarray)  |  [最大子序和](/solution/1-99/0053.maximum-subarray/)  |  `数组`,`分治算法`,`动态规划`  |  <font color=green>简单</font>  |
-|  [58](https://leetcode-cn.com/problems/length-of-last-word)  |  [最后一个单词的长度](/solution/1-99/0058.length-of-last-word/)  |  `字符串`  |  <font color=green>简单</font>  |
+|  [58](https://leetcode-cn.com/problems/length-of-last-word)  |  [最后一个单词的长度](/solution/1-99/0058.length-of-last-word/)  |  `字符串`  |  <font color=green>简单</font>  |✅ |
 |  [66](https://leetcode-cn.com/problems/plus-one)  |  [加一](/solution/1-99/0066.plus-one/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
 |  [67](https://leetcode-cn.com/problems/add-binary)  |  [二进制求和](/solution/1-99/0067.add-binary/)  |  `数学`,`字符串`  |  <font color=green>简单</font>  |
 |  [69](https://leetcode-cn.com/problems/sqrtx)  |  [x 的平方根](/solution/1-99/0069.sqrt%28x%29/)  |  `数学`,`二分查找`  |  <font color=green>简单</font>  |
@@ -136,7 +136,7 @@
 |  [475](https://leetcode-cn.com/problems/heaters)  |  [供暖器](/solution/400-499/0475.heaters/)  |  `二分查找`  |  <font color=green>简单</font>  |
 |  [476](https://leetcode-cn.com/problems/number-complement)  |  [数字的补数](/solution/400-499/0476.number-complement/)  |  `位运算`  |  <font color=green>简单</font>  |
 |  [482](https://leetcode-cn.com/problems/license-key-formatting)  |  [密钥格式化](/solution/400-499/0482.license-key-formatting/)  |    |  <font color=green>简单</font>  |
-|  [485](https://leetcode-cn.com/problems/max-consecutive-ones)  |  [最大连续1的个数](/solution/400-499/0485.max-consecutive-ones/)  |  `数组`  |  <font color=green>简单</font>  |
+|  [485](https://leetcode-cn.com/problems/max-consecutive-ones)  |  [最大连续1的个数](/solution/400-499/0485.max-consecutive-ones/)  |  `数组`  |  <font color=green>简单</font>  |✅ |
 |  [492](https://leetcode-cn.com/problems/construct-the-rectangle)  |  [构造矩形](/solution/400-499/0492.construct-the-rectangle/)  |    |  <font color=green>简单</font>  |
 |  [496](https://leetcode-cn.com/problems/next-greater-element-i)  |  [下一个更大元素 i](/solution/400-499/0496.next-greater-element-i/)  |  `栈`  |  <font color=green>简单</font>  |
 |  [500](https://leetcode-cn.com/problems/keyboard-row)  |  [键盘行](/solution/500-599/0500.keyboard-row/)  |  `哈希表`  |  <font color=green>简单</font>  |

solution/1-99/_sidebar.md

@@ -63,7 +63,7 @@
     - [55. 跳跃游戏](solution/1-99/0055.jump-game/)
     - [56. 合并区间](solution/1-99/0056.merge-intervals/)
     - [57. 插入区间](solution/1-99/0057.insert-interval/)
-    - [58. 最后一个单词的长度](solution/1-99/0058.length-of-last-word/)
+    - [58. 最后一个单词的长度 ✅](solution/1-99/0058.length-of-last-word/)
     - [59. 螺旋矩阵 ii](solution/1-99/0059.spiral-matrix-ii/)
     - [60. 第k个排列](solution/1-99/0060.permutation-sequence/)
     - [61. 旋转链表](solution/1-99/0061.rotate-list/)

solution/400-499/0485.max-consecutive-ones/README.md

@@ -0,0 +1,47 @@
+# [485. 最大连续1的个数](https://leetcode-cn.com/problems/max-consecutive-ones/description/)
+
+### 题目描述
+
+<p>给定一个二进制数组， 计算其中最大连续1的个数。</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre>
+<strong>输入:</strong> [1,1,0,1,1,1]
+<strong>输出:</strong> 3
+<strong>解释:</strong> 开头的两位和最后的三位都是连续1，所以最大连续1的个数是 3.
+</pre>
+
+<p><strong>注意：</strong></p>
+
+<ul>
+	<li>输入的数组只包含&nbsp;<code>0</code> 和<code>1</code>。</li>
+	<li>输入数组的长度是正整数，且不超过 10,000。</li>
+</ul>
+
+
+
+### 解题思路
+
+![](http://lc-photo.xwlin.com/485.gif)
+
+### 具体解法
+
+#### **Golang**
+```go
+func findMaxConsecutiveOnes(nums []int) int {
+	p, q := 0, 0
+	for i := range nums {
+		if nums[i] == 1 {
+			p++
+			if q < p {
+				q = p
+			}
+		} else {
+			p = 0
+		}
+	}
+	return q
+}
+```
+

solution/400-499/0485.max-consecutive-ones/solution.go

@@ -0,0 +1,25 @@
+package leetcode
+
+/*
+ * @lc app=leetcode.cn id=485 lang=golang
+ *
+ * [485] 最大连续1的个数
+ */
+
+// @lc code=start
+func findMaxConsecutiveOnes(nums []int) int {
+	p, q := 0, 0
+	for i := range nums {
+		if nums[i] == 1 {
+			p++
+			if q < p {
+				q = p
+			}
+		} else {
+			p = 0
+		}
+	}
+	return q
+}
+
+// @lc code=end

solution/400-499/0485.max-consecutive-ones/solution_test.go

@@ -0,0 +1,16 @@
+package leetcode
+
+import (
+	"testing"
+)
+
+func TestFindMaxConsecutiveOnes(t *testing.T) {
+	var ret int
+	var nums []int
+
+	nums = []int{1, 1, 0, 1, 1, 1}
+	ret = 3
+	if ret != findMaxConsecutiveOnes(nums) {
+		t.Fatalf("case fails %v\n", ret)
+	}
+}

solution/400-499/_sidebar.md

@@ -91,7 +91,7 @@
     - [482. 密钥格式化](solution/400-499/0482.license-key-formatting/)
     - [483. 最小好进制](solution/400-499/0483.smallest-good-base/)
     - [484. 寻找排列](solution/400-499/0484.find-permutation/)
-    - [485. 最大连续1的个数](solution/400-499/0485.max-consecutive-ones/)
+    - [485. 最大连续1的个数 ✅](solution/400-499/0485.max-consecutive-ones/)
     - [486. 预测赢家](solution/400-499/0486.predict-the-winner/)
     - [487. 最大连续1的个数 ii](solution/400-499/0487.max-consecutive-ones-ii/)
     - [488. 祖玛游戏](solution/400-499/0488.zuma-game/)