add: 주식 사고팔기

Author: Yongseok-Choi-dev

best-time-to-buy-and-sell-stock/YoungSeok-Choi.java

@@ -0,0 +1,24 @@
+// NOTE: tc --> O(n)
+class Solution {
+    public int maxProfit(int[] prices) {
+
+        int curMax = 0;
+        int gMax = 0;
+
+        if(prices.length == 0) return 0;
+        
+        int sell = prices[0];
+        for(int i = 1; i < prices.length; i++) {
+            curMax = Math.max(0, prices[i] - sell);
+
+            // NOTE: 새롭게 시작하는게 더 좋은경우
+            if(curMax == 0) {
+                sell = prices[i];
+            }
+
+            gMax = Math.max(curMax, gMax); 
+        }
+
+        return gMax;        
+    }
+}

group-anagrams/YoungSeok-Choi.java

@@ -0,0 +1,34 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+// NOTE: tc -> O(n)
+class Solution {
+    public List<List<String>> groupAnagrams(String[] strs) {
+
+        List<List<String>> result = new ArrayList<>();
+        Map<String, List<String>> sMap = new HashMap<>();
+
+        for(int i = 0; i < strs.length; i++) {
+            char[] cArr = strs[i].toCharArray();
+            Arrays.sort(cArr);
+            String sorted = new String(cArr);
+
+            if(sMap.containsKey(sorted)) {
+                sMap.get(sorted).add(strs[i]);
+            } else {
+                List<String> temp = new ArrayList<>();
+                temp.add(strs[i]);
+                sMap.put(sorted, temp);
+            }
+        }
+
+        for(List<String> arr : sMap.values()) {
+            result.add(arr);
+        }
+
+        return result;
+    }
+}