feat: 문제풀이 추가

JEONGHWANMIN · JEONGHWANMIN · commit a5b768d7cd88 · 2024-10-13T02:22:15.000+09:00
diff --git a/maximum-subarray/hwanmini.js b/maximum-subarray/hwanmini.js
@@ -0,0 +1,19 @@
+// 시간복잡도: O(n)
+// 공간복잡도: O(1)
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxSubArray = function (nums) {
+    let maxNum = -Infinity;
+    let prevSum = -Infinity;
+
+    for (let i = 0 ; i < nums.length; i++) {
+        prevSum = Math.max(prevSum + nums[i], nums[i])
+        maxNum = Math.max(prevSum, maxNum)
+    }
+
+
+    return maxNum
+};
