longest consecutive sequence solved

Author: mintheon

longest-consecutive-sequence/mintheon.java

@@ -1,30 +1,28 @@
-import java.util.HashSet;
-import java.util.Set;
-
 class Solution {
   public int longestConsecutive(int[] nums) {
     Set<Integer> numSet = new HashSet<>();
+    int max = 0;
 
     for(int num : nums) {
       numSet.add(num);
     }
 
-    int longestSize = 0;
-
     for(int num : numSet) {
-      if(!numSet.contains(num - 1)) {
-        int current = num;
-        int count = 1;
+      if(numSet.contains(num - 1)) {
+        continue;
+      }
 
-        while(numSet.contains(current + 1)) {
-          count++;
-          current++;
-        }
+      int count = 1;
+      int curNum = num;
 
-        longestSize = Math.max(count, longestSize);
+      while(numSet.contains(curNum + 1)) {
+        count++;
+        curNum++;
       }
+
+      max = Math.max(max, count);
     }
 
-    return longestSize;
+    return max;
   }
 }

top-k-frequent-elements/mintheon.java

@@ -21,4 +21,4 @@ public int[] topKFrequent(int[] nums, int k) {
 
     return answer;
   }
-}
+}

two-sum/mintheon.java

@@ -17,4 +17,4 @@ public int[] twoSum(int[] nums, int target) {
 
     return new int[]{};
   }
-}
+}