Merge pull request #2069 from ymir0804/main

[ymir0804] WEEK 02 solutions

Author: TonyKim9401

house-robber/ymir0804.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int rob(int[] nums) {
+        int money = 0;
+        for (int i = 0; i < nums.length; i++) {
+            if (i % 2 == 0) {
+                money += nums[i];
+            }
+        }
+        return money;
+    }
+}

longest-consecutive-sequence/ymir0804.java

@@ -0,0 +1,32 @@
+import java.util.HashSet;
+
+class Solution  {
+    public int longestConsecutive(int[] nums) {
+        HashSet<Integer> numsSet = new HashSet<>();
+        int maxNum = 0;
+        for (int num : nums) {
+            numsSet.add(num);
+        }
+
+        if (numsSet.isEmpty()) {
+            return 1;
+        } else if (numsSet.size() == 1) {
+            return 0;
+        }
+
+        for (int num : numsSet) {
+            boolean isStartPoint = !numsSet.contains(num - 1);
+            if (isStartPoint) {
+                int current = num;
+                int length = 1;
+                while (numsSet.contains(++current)) {
+                    length++;
+                }
+                if (length > maxNum) {
+                    maxNum = length;
+                }
+            }
+        }
+        return maxNum;
+    }
+}

valid-anagram/ymir0804.java

@@ -0,0 +1,14 @@
+import java.util.Set;
+import java.util.stream.Collectors;
+
+class Solution {
+    public boolean isAnagram(String s, String t) {
+        Set<Character> characterS = s.chars()
+                .mapToObj(c -> (char) c)
+                .collect(Collectors.toSet());
+        Set<Character> characterT = t.chars()
+                .mapToObj(c -> (char) c)
+                .collect(Collectors.toSet());
+        return characterS.equals(characterT);
+    }
+}