"Shortest Subarray with Sum at Least K" hard task No 862 fixed size sliding window version

862-shortest-subarray-with-sum-at-least-k.go

@@ -5,54 +5,32 @@ func ShortestSubarray(nums []int, k int) int {
 		return -1
 	}
 
-	queue := [100000]int{}
+	wndSz := 1
-	queue2 := [100000]int{}
+	wndStart := 0
 
-	qIterator := &queue
+	wndEnd := 0
-	q2Iterator := &queue2
+	wndSum := 0
-
-	t := qIterator
-
-	qEndPtr := -1
-	qBeginPtr := -1
-
-	q2EndPtr := -1
-	q2BeginPtr := -1
 
+	wndPrevInitialSum := 0
 	lenNums := len(nums)
 
-	for i, n := range nums {
+	for wndSz = 1; wndSz <= lenNums; wndSz++ {
-		if i < lenNums {
-			qEndPtr++
-			qIterator[qEndPtr] = n
-		}
-		if n >= k {
-			return 1
-		}
-	}
 
-	wndSz := 0
+		wndSum = wndPrevInitialSum + nums[wndSz-1]
-	i := 0
+		wndPrevInitialSum = wndSum
+		if wndSum >= k {
+			return wndSz
+		}
 
-	for wndSz = 2; wndSz <= lenNums; wndSz++ {
+		for wndStart = 1; (wndStart + wndSz - 1) < lenNums; wndStart++ {
-		for i = wndSz - 1; i < lenNums; i++ {
+
-			qBeginPtr++
+			wndEnd = wndStart + wndSz - 1
-			q2EndPtr++
+			wndSum = wndSum - nums[wndStart-1] + nums[wndEnd]
-			q2Iterator[q2EndPtr] = qIterator[qBeginPtr] + nums[i]
+
-			if q2Iterator[q2EndPtr] >= k {
+			if wndSum >= k {
 				return wndSz
 			}
 		}
-
-		t = qIterator
-		qIterator = q2Iterator
-		q2Iterator = t
-
-		qBeginPtr = q2BeginPtr
-		qEndPtr = q2EndPtr
-
-		q2BeginPtr = -1
-		q2EndPtr = -1
 	}
 
 	return -1