862 added

Author: aQua

Algorithms/0862.shortest-subarray-with-sum-at-least-k/README.md

@@ -0,0 +1,38 @@
+# [862. Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/)
+
+## 题目
+
+Return the length of the shortest, non-empty, contiguoussubarray of A with sum at least K.
+
+If there is no non-empty subarray with sum at least K, return -1.
+
+Example 1:
+
+```text
+Input: A = [1], K = 1
+Output: 1
+```
+
+Example 2:
+
+```text
+Input: A = [1,2], K = 4
+Output: -1
+```
+
+Example 3:
+
+```text
+Input: A = [2,-1,2], K = 3
+Output: 3
+```
+
+Note:
+
+1. 1 <= A.length <= 50000
+1. -10 ^ 5<= A[i] <= 10 ^ 5
+1. 1 <= K <= 10 ^ 9
+
+## 解题思路
+
+见程序注释

Algorithms/0862.shortest-subarray-with-sum-at-least-k/shortest-subarray-with-sum-at-least-k.go

@@ -0,0 +1,6 @@
+package problem0862
+
+func shortestSubarray(A []int, K int) int {
+
+	return 0
+}

Algorithms/0862.shortest-subarray-with-sum-at-least-k/shortest-subarray-with-sum-at-least-k_test.go

@@ -0,0 +1,53 @@
+package problem0862
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	A   []int
+	K   int
+	ans int
+}{
+
+	{
+		[]int{1},
+		1,
+		1,
+	},
+
+	{
+		[]int{1, 2},
+		4,
+		-1,
+	},
+
+	{
+		[]int{2, -1, 2},
+		3,
+		3,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_shortestSubarray(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		ast.Equal(tc.ans, shortestSubarray(tc.A, tc.K), "输入:%v", tc)
+	}
+}
+
+func Benchmark_shortestSubarray(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			shortestSubarray(tc.A, tc.K)
+		}
+	}
+}

leetcode.json

@@ -1,7 +1,7 @@
 {
 	"Username": "aQuaYi",
-	"Ranking": 846,
-	"Updated": "2018-08-06T23:01:39.949100975+08:00",
+	"Ranking": 843,
+	"Updated": "2018-08-07T19:19:57.66016619+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 180,
@@ -49,7 +49,7 @@
 			"ID": 2,
 			"Title": "Add Two Numbers",
 			"TitleSlug": "add-two-numbers",
-			"PassRate": "28%",
+			"PassRate": "29%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -2833,7 +2833,7 @@
 			"ID": 234,
 			"Title": "Palindrome Linked List",
 			"TitleSlug": "palindrome-linked-list",
-			"PassRate": "33%",
+			"PassRate": "34%",
 			"Difficulty": "Easy",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -3889,7 +3889,7 @@
 			"ID": 322,
 			"Title": "Coin Change",
 			"TitleSlug": "coin-change",
-			"PassRate": "26%",
+			"PassRate": "27%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -4117,7 +4117,7 @@
 			"ID": 341,
 			"Title": "Flatten Nested List Iterator",
 			"TitleSlug": "flatten-nested-list-iterator",
-			"PassRate": "43%",
+			"PassRate": "44%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -4645,7 +4645,7 @@
 			"ID": 385,
 			"Title": "Mini Parser",
 			"TitleSlug": "mini-parser",
-			"PassRate": "31%",
+			"PassRate": "30%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -5161,7 +5161,7 @@
 			"ID": 428,
 			"Title": "Serialize and Deserialize N-ary Tree",
 			"TitleSlug": "serialize-and-deserialize-n-ary-tree",
-			"PassRate": "31%",
+			"PassRate": "32%",
 			"Difficulty": "Hard",
 			"IsAccepted": false,
 			"IsPaid": true,
@@ -5197,7 +5197,7 @@
 			"ID": 431,
 			"Title": "Encode N-ary Tree to Binary Tree",
 			"TitleSlug": "encode-n-ary-tree-to-binary-tree",
-			"PassRate": "34%",
+			"PassRate": "35%",
 			"Difficulty": "Hard",
 			"IsAccepted": false,
 			"IsPaid": true,
@@ -6721,7 +6721,7 @@
 			"ID": 558,
 			"Title": "Quad Tree Intersection",
 			"TitleSlug": "quad-tree-intersection",
-			"PassRate": "28%",
+			"PassRate": "29%",
 			"Difficulty": "Easy",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -7105,7 +7105,7 @@
 			"ID": 590,
 			"Title": "N-ary Tree Postorder Traversal",
 			"TitleSlug": "n-ary-tree-postorder-traversal",
-			"PassRate": "53%",
+			"PassRate": "54%",
 			"Difficulty": "Easy",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -7717,7 +7717,7 @@
 			"ID": 641,
 			"Title": "Design Circular Deque",
 			"TitleSlug": "design-circular-deque",
-			"PassRate": "50%",
+			"PassRate": "49%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -8425,7 +8425,7 @@
 			"ID": 700,
 			"Title": "Search in a Binary Search Tree",
 			"TitleSlug": "search-in-a-binary-search-tree",
-			"PassRate": "48%",
+			"PassRate": "49%",
 			"Difficulty": "Easy",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -8437,7 +8437,7 @@
 			"ID": 701,
 			"Title": "Insert into a Binary Search Tree",
 			"TitleSlug": "insert-into-a-binary-search-tree",
-			"PassRate": "44%",
+			"PassRate": "45%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -8461,7 +8461,7 @@
 			"ID": 703,
 			"Title": "Kth Largest Element in a Stream",
 			"TitleSlug": "kth-largest-element-in-a-stream",
-			"PassRate": "26%",
+			"PassRate": "27%",
 			"Difficulty": "Easy",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -8485,7 +8485,7 @@
 			"ID": 705,
 			"Title": "Design HashSet",
 			"TitleSlug": "design-hashset",
-			"PassRate": "24%",
+			"PassRate": "25%",
 			"Difficulty": "Easy",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -9661,7 +9661,7 @@
 			"ID": 803,
 			"Title": "Bricks Falling When Hit",
 			"TitleSlug": "bricks-falling-when-hit",
-			"PassRate": "23%",
+			"PassRate": "22%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -9973,7 +9973,7 @@
 			"ID": 829,
 			"Title": "Consecutive Numbers Sum",
 			"TitleSlug": "consecutive-numbers-sum",
-			"PassRate": "26%",
+			"PassRate": "27%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -10153,7 +10153,7 @@
 			"ID": 844,
 			"Title": "Backspace String Compare",
 			"TitleSlug": "backspace-string-compare",
-			"PassRate": "45%",
+			"PassRate": "44%",
 			"Difficulty": "Easy",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -10297,7 +10297,7 @@
 			"ID": 856,
 			"Title": "Score of Parentheses",
 			"TitleSlug": "score-of-parentheses",
-			"PassRate": "53%",
+			"PassRate": "54%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -10309,7 +10309,7 @@
 			"ID": 857,
 			"Title": "Minimum Cost to Hire K Workers",
 			"TitleSlug": "minimum-cost-to-hire-k-workers",
-			"PassRate": "39%",
+			"PassRate": "38%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -10633,7 +10633,7 @@
 			"ID": 884,
 			"Title": "Decoded String at Index",
 			"TitleSlug": "decoded-string-at-index",
-			"PassRate": "20%",
+			"PassRate": "21%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -10657,7 +10657,7 @@
 			"ID": 886,
 			"Title": "Reachable Nodes In Subdivided Graph",
 			"TitleSlug": "reachable-nodes-in-subdivided-graph",
-			"PassRate": "31%",
+			"PassRate": "33%",
 			"Difficulty": "Hard",
 			"IsAccepted": false,
 			"IsPaid": false,