Merge pull request #1399 from sora0319/main

[sora0319] Week 05 Solutions

Author: sora0319

best-time-to-buy-and-sell-stock/sora0319.java

@@ -0,0 +1,17 @@
+class Solution {
+    public int maxProfit(int[] prices) {
+        int minPrice = prices[0];
+        int maxProfit = 0;
+
+        for(int p : prices){
+            if(minPrice < p && maxProfit < p - minPrice){
+                maxProfit = p - minPrice;
+            }
+            if(minPrice > p){
+                minPrice = p;
+            }
+        }
+        return maxProfit;
+    }
+}
+

encode-and-decode-strings/sora0319.java

@@ -0,0 +1,33 @@
+public class Solution {
+    /*
+     * @param strs: a list of strings
+     * @return: encodes a list of strings to a single string.
+     */
+    public String encode(List<String> strs) {
+        StringBuilder sb = new StringBuilder();
+        for (String s : strs) {
+            sb.append(s.length()).append('#').append(s);
+        }
+        return sb.toString();
+    }
+
+    /*
+     * @param str: A single encoded string
+     * @return: decodes the single string to a list of strings
+     */
+    public List<String> decode(String str) {
+        List<String> result = new ArrayList<>();
+        int i = 0;
+        while (i < str.length()) {
+            int j = i;
+            while (str.charAt(j) != '#') {
+                j++;
+            }
+            int length = Integer.parseInt(str.substring(i, j));
+            j++;
+            result.add(str.substring(j, j + length));
+            i = j + length;
+        }
+        return result;
+    }
+}

group-anagrams/sora0319.java

@@ -0,0 +1,27 @@
+class Solution {
+    public List<List<String>> groupAnagrams(String[] strs) {
+        Map<String, List<String>> groups = new HashMap<>();
+
+        for(String word : strs){
+            int[] characters = new int[26];
+            for(char c : word.toCharArray()){
+                characters[c - 'a']++;
+            }
+
+            String countCode = Arrays.toString(characters);
+            if(!groups.containsKey(countCode)){
+                groups.put(countCode, new ArrayList<String>());
+            }
+            List<String> temp = groups.get(countCode);
+            temp.add(word);
+        }
+
+        List<List<String>> answer = new ArrayList<>();
+        for(List<String> g : groups.values()){
+            answer.add(g);
+        }
+
+        return answer;
+    }
+}
+

implement-trie-prefix-tree/sora0319.java

@@ -0,0 +1,40 @@
+class Trie {
+    Set<String> dict;
+
+    public Trie() {
+        dict = new TreeSet<>();
+    }
+
+    public void insert(String word) {
+        dict.add(word);
+    }
+
+    public boolean search(String word) {
+        if(dict.contains(word)) return true;
+        return false;
+    }
+
+    public boolean startsWith(String prefix) {
+        for(String saved : dict){
+            int count = 0;
+            if(prefix.compareTo(saved) > 0) continue;
+            if(prefix.length() > saved.length()) continue;
+
+            for(int i = 0; i < prefix.length(); i++){
+                if(prefix.charAt(i) != saved.charAt(i)) break;
+                count++;
+            }
+            if(count == prefix.length()) return true;
+        }
+        return false;
+    }
+}
+
+/**
+ * Your Trie object will be instantiated and called as such:
+ * Trie obj = new Trie();
+ * obj.insert(word);
+ * boolean param_2 = obj.search(word);
+ * boolean param_3 = obj.startsWith(prefix);
+ */
+

word-break/sora0319.java

@@ -0,0 +1,19 @@
+public class Solution {
+    public boolean wordBreak(String s, List<String> wordDict) {
+        boolean[] dp = new boolean[s.length() + 1];
+        dp[0] = true;
+
+        for (int n = 1; n <= s.length(); n++) {
+            for (String word : wordDict) {
+                if (n >= word.length() && s.substring(n - word.length(), n).equals(word)) {
+                    dp[n] = dp[n - word.length()];
+                }
+                if (dp[n]) {
+                    break;
+                }
+            }
+        }
+
+        return dp[s.length()];
+    }
+}