[E:62/533, M:57/974, H:6/387] add No: 485 Max Consecutive Ones

Author: gladmo

questions/serial/简单/485/README.md

@@ -0,0 +1,16 @@
+## [最大连续1的个数](https://leetcode-cn.com/problems/max-consecutive-ones/)
+
+给定一个二进制数组， 计算其中最大连续1的个数。
+
+**示例 1:**
+
+`
+**输入:** [1,1,0,1,1,1]
+**输出:** 3
+**解释:** 开头的两位和最后的三位都是连续1，所以最大连续1的个数是 3.
+`
+
+**注意：**
+
+*   输入的数组只包含 `0` 和`1`。
+*   输入数组的长度是正整数，且不超过 10,000。

questions/serial/简单/485/golang/main.go

@@ -0,0 +1,77 @@
+package main
+
+import (
+	"context"
+	"fmt"
+	"reflect"
+	"time"
+
+	"github.com/gladmo/leetcode/leet"
+	"github.com/gladmo/leetcode/questions/serial/简单/485/golang/solution"
+)
+
+func main() {
+
+	tests := []struct {
+		name  string
+		input []int
+		want  int
+	}{
+		{
+			name:  "test-[1,0,1,1,0,1]",
+			input: []int{1, 0, 1, 1, 0, 1},
+			want:  2,
+		},
+		{
+			name:  "test-[1,0,0,1,1,0,1]",
+			input: []int{1, 0, 0, 1, 1, 0, 1},
+			want:  2,
+		},
+		{
+			name:  "test-[1]",
+			input: []int{1},
+			want:  1,
+		},
+		{
+			name:  "test-[0]",
+			input: []int{0},
+			want:  0,
+		},
+		{
+			name:  "test-[]",
+			input: []int{},
+			want:  0,
+		},
+		{
+			name:  "test-[1,1,1,1]",
+			input: []int{1, 1, 1, 1},
+			want:  4,
+		},
+	}
+
+	testLog := leet.NewTestLog(len(tests))
+	defer testLog.Render()
+
+	timeoutDuration := time.Second * 2
+
+	for idx, test := range tests {
+		// 超时检测
+		got := test.want
+		timeout := leet.Timeout(timeoutDuration, func(ctx context.Context, cancel context.CancelFunc) {
+			got = solution.Export(test.input)
+			cancel()
+		})
+
+		if timeout {
+			testLog.Fail(idx+1, test.name, "timeout")
+			continue
+		}
+
+		if !reflect.DeepEqual(test.want, got) {
+			testLog.Fail(idx+1, test.name, fmt.Sprintf("want: %v, got %v.", test.want, got))
+			continue
+		}
+
+		testLog.Pass(idx+1, test.name)
+	}
+}

questions/serial/简单/485/golang/solution/max-consecutive-ones.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+func Export(nums []int) int {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", nums)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return findMaxConsecutiveOnes(nums)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func findMaxConsecutiveOnes(nums []int) int {
+
+}

questions/serial/简单/485/golang/solution/max-consecutive-ones.go.clean

@@ -0,0 +1,30 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+func Export(nums []int) int {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", nums)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return findMaxConsecutiveOnes(nums)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func findMaxConsecutiveOnes(nums []int) int {
+
+}

questions/store.json

@@ -0,0 +1,16 @@
+## [最大连续1的个数](https://leetcode-cn.com/problems/max-consecutive-ones/)
+
+给定一个二进制数组， 计算其中最大连续1的个数。
+
+**示例 1:**
+
+`
+**输入:** [1,1,0,1,1,1]
+**输出:** 3
+**解释:** 开头的两位和最后的三位都是连续1，所以最大连续1的个数是 3.
+`
+
+**注意：**
+
+*   输入的数组只包含 `0` 和`1`。
+*   输入数组的长度是正整数，且不超过 10,000。

questions/tags/数组/简单/max-consecutive-ones/README.md

@@ -0,0 +1,77 @@
+package main
+
+import (
+	"context"
+	"fmt"
+	"reflect"
+	"time"
+
+	"github.com/gladmo/leetcode/leet"
+	"github.com/gladmo/leetcode/questions/serial/简单/485/golang/solution"
+)
+
+func main() {
+
+	tests := []struct {
+		name  string
+		input []int
+		want  int
+	}{
+		{
+			name:  "test-[1,0,1,1,0,1]",
+			input: []int{1, 0, 1, 1, 0, 1},
+			want:  2,
+		},
+		{
+			name:  "test-[1,0,0,1,1,0,1]",
+			input: []int{1, 0, 0, 1, 1, 0, 1},
+			want:  2,
+		},
+		{
+			name:  "test-[1]",
+			input: []int{1},
+			want:  1,
+		},
+		{
+			name:  "test-[0]",
+			input: []int{0},
+			want:  0,
+		},
+		{
+			name:  "test-[]",
+			input: []int{},
+			want:  0,
+		},
+		{
+			name:  "test-[1,1,1,1]",
+			input: []int{1, 1, 1, 1},
+			want:  4,
+		},
+	}
+
+	testLog := leet.NewTestLog(len(tests))
+	defer testLog.Render()
+
+	timeoutDuration := time.Second * 2
+
+	for idx, test := range tests {
+		// 超时检测
+		got := test.want
+		timeout := leet.Timeout(timeoutDuration, func(ctx context.Context, cancel context.CancelFunc) {
+			got = solution.Export(test.input)
+			cancel()
+		})
+
+		if timeout {
+			testLog.Fail(idx+1, test.name, "timeout")
+			continue
+		}
+
+		if !reflect.DeepEqual(test.want, got) {
+			testLog.Fail(idx+1, test.name, fmt.Sprintf("want: %v, got %v.", test.want, got))
+			continue
+		}
+
+		testLog.Pass(idx+1, test.name)
+	}
+}

questions/tags/数组/简单/max-consecutive-ones/golang/main.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+func Export(nums []int) int {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", nums)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return findMaxConsecutiveOnes(nums)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func findMaxConsecutiveOnes(nums []int) int {
+
+}

questions/tags/数组/简单/max-consecutive-ones/golang/solution/max-consecutive-ones.go

@@ -0,0 +1,30 @@
+package solution
+
+import (
+	"fmt"
+	"os"
+	"runtime/debug"
+)
+
+func Export(nums []int) int {
+	defer func() {
+		if r := recover(); r != nil {
+			fmt.Println("Params: ", nums)
+			fmt.Println("Panic:", r)
+			fmt.Println()
+			debug.PrintStack()
+			os.Exit(0)
+		}
+	}()
+
+	return findMaxConsecutiveOnes(nums)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+func findMaxConsecutiveOnes(nums []int) int {
+
+}