feat: Add solution for LeetCode problem 53

WhiteHyun · WhiteHyun · commit 1abcc9066283 · 2024-07-20T06:35:43.000+09:00
diff --git a/maximum-subarray/WhiteHyun.swift b/maximum-subarray/WhiteHyun.swift
@@ -0,0 +1,22 @@
+//  
+//  53. Maximum Subarray
+//  https://leetcode.com/problems/maximum-subarray/description/
+//  Dale-Study
+//  
+//  Created by WhiteHyun on 2024/07/20.
+//  
+
+class Solution {
+  func maxSubArray(_ numbers: [Int]) -> Int {
+    var tracking = numbers[0]
+    var answer = numbers[0]
+    for value in numbers.dropFirst() {
+      tracking = max(tracking + value, value)
+      if tracking > answer {
+        answer = tracking
+      }
+    }
+
+    return answer
+  }
+}
