fix minor diff in 2 approaches

hoanhan101 · Dec 14, 2019 · d45b977 · d45b977
1 parent 899ecdc
commit d45b977
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/gtci/avg_subarray_test.go b/gtci/avg_subarray_test.go
@@ -6,7 +6,7 @@ Example:
 - Input: []int{1, 3, 2, 6, -1, 4, 1, 8, 2}, k=5
   Output: []int{2.2, 2.8, 2.4, 3.6, 2.8}
 
-Approach: Sliding Window
+Approach:
 - View each contiguous subarray as a sliding window of k elements.
 - As we move to the next subarray, slide the window by one element to
   reuse the sum from previous array.

diff --git a/gtci/max_subarray_test.go b/gtci/max_subarray_test.go
@@ -7,10 +7,10 @@ Example:
 - Input: int{2, 1, 5, 1, 3, 2}, k=3
   Output: 9
   Explanation: Subarray with maximum sum is [5, 1, 3].
-Approach: Sliding Window
+Approach:
 - View each contiguous subarray as a sliding window of k elements.
 - As we move to the next subarray, slide the window by one element to
-  reuse the sum from previous array.
+  reuse the sum from previous array and update the maximum sum.
 
 Cost:
 - O(n) time, O(1) space.