홍성우_Maximum Subarray

TeamB/홍성우_Best Time to Buy and Sell Stock.ts

@@ -0,0 +1,11 @@
+function maxProfit(prices: number[]): number {
+  let minPrice = prices[0];
+  let maxPrice = 0;
+
+  for (let i = 1; i < prices.length; i++) {
+    maxPrice = Math.max(maxPrice, prices[i] - minPrice);
+    minPrice = Math.min(prices[i], minPrice);
+  }
+
+  return maxPrice;
+}

TeamB/홍성우_Climbing Stairs.ts

@@ -0,0 +1,10 @@
+function climbStairs(n: number): number {
+  if (n <= 1) return 1;
+
+  const dp: number[] = [1, 1];
+  for (let i = 2; i <= n; i++) {
+    dp[i] = dp[i - 1] + dp[i - 2];
+  }
+
+  return dp[n];
+}

TeamB/홍성우_Maximum Subarray.ts

@@ -0,0 +1,11 @@
+function maxSubArray(nums: number[]): number {
+  let currentSum = nums[0];
+  let maxSum = nums[0];
+
+  for (let i = 1; i < nums.length; i++) {
+    currentSum = Math.max(nums[i], currentSum + nums[i]);
+    maxSum = Math.max(maxSum, currentSum);
+  }
+
+  return maxSum;
+}