We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 92929b1 commit 96b184fCopy full SHA for 96b184f
maximum-subarray/Jeehay28.ts
@@ -0,0 +1,16 @@
1
+// Approach 1:
2
+// Time Complexity: O(n)
3
+// Space Complexity: O(1)
4
+
5
+function maxSubArray(nums: number[]): number {
6
+ let currentSum = nums[0];
7
+ let maxSum = nums[0];
8
9
+ for (let i = 1; i < nums.length; i++) {
10
+ currentSum = Math.max(nums[i], currentSum + nums[i]);
11
+ maxSum = Math.max(currentSum, maxSum);
12
+ }
13
14
+ return maxSum;
15
+}
16
0 commit comments