fix checkstyle

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_128.java

@@ -116,7 +116,8 @@ public int longestConsecutive(int[] nums) {
             }
 
             int longestStreak = 0;
-            for (int num : set) {//we'll go through this set instead of nums, this makes a big difference in time complexity, esp. based on LeetCode test cases
+            for (int num : set) {
+                //we'll go through this set instead of nums, this makes a big difference in time complexity, esp. based on LeetCode test cases
                 if (!set.contains(num - 1)) {
                     int currentNum = num;
                     int currentStreak = 1;

src/main/java/com/fishercoder/solutions/_148.java

@@ -63,8 +63,9 @@ public static class Solution2 {
         ListNode nextSubList = new ListNode(0);
 
         public ListNode sortList(ListNode head) {
-            if (head == null || head.next == null)
+            if (head == null || head.next == null) {
                 return head;
+            }
             int n = getCount(head);
             ListNode start = head;
             ListNode dummyHead = new ListNode(0);

src/main/java/com/fishercoder/solutions/_1650.java

@@ -17,7 +17,8 @@ public Node(int val) {
 
     public static class Solution1 {
         public Node lowestCommonAncestor(Node p, Node q) {
-            Node a = p, b = q;
+            Node a = p;
+            Node b = q;
             while (a != b) {
                 a = a == null ? p : a.parent;
                 b = b == null ? q : b.parent;

src/main/java/com/fishercoder/solutions/_1721.java

@@ -69,6 +69,7 @@ public ListNode swapNodes(ListNode head, int k) {
             return dummy.next;
         }
     }
+
     public static class Solution3 {
         public ListNode swapNodes(ListNode head, int k) {
             // O(n) linear time
@@ -80,20 +81,21 @@ public ListNode swapNodes(ListNode head, int k) {
             int length = 0;
             int secondIndex;
 
-            ListNode temp1 = null, temp2 = null;
+            ListNode temp1 = null;
+            ListNode temp2 = null;
             ListNode temp3 = head;
-            while(temp3 != null){
+            while (temp3 != null) {
                 length++;
                 temp3 = temp3.next;
             }
 
             secondIndex = length - k + 1;
             temp3 = head;
-            for(int i = 1; i <= length; i++){
-                if(i == k){
+            for (int i = 1; i <= length; i++) {
+                if (i == k) {
                     temp1 = temp3;
                 }
-                if(i == secondIndex){
+                if (i == secondIndex) {
                     temp2 = temp3;
                 }
                 temp3 = temp3.next;

src/main/java/com/fishercoder/solutions/_1826.java

@@ -4,7 +4,8 @@ public class _1826 {
     public static class Solution1 {
         public int badSensor(int[] sensor1, int[] sensor2) {
             //check if sensor2 is faulty
-            int i = 0, j = 0;
+            int i = 0;
+            int j = 0;
             for (; i < sensor1.length && j < sensor2.length - 1; ) {
                 if (sensor1[i] != sensor2[j]) {
                     i++;

src/main/java/com/fishercoder/solutions/_2001.java

@@ -35,7 +35,7 @@ public static class Solution2 {
          */
         public long interchangeableRectangles(int[][] rectangles) {
             Map<Double, Integer> map = new HashMap<>();
-            long ans = 0l;
+            long ans = 0L;
             for (int[] rec : rectangles) {
                 double ratio = (double) rec[0] / rec[1];
                 ans += map.getOrDefault(ratio, 0);

src/main/java/com/fishercoder/solutions/_2028.java

@@ -3,7 +3,7 @@
 public class _2028 {
     public static class Solution1 {
         public int[] missingRolls(int[] rolls, int mean, int n) {
-            long sum = 0l;
+            long sum = 0L;
             for (int num : rolls) {
                 sum += num;
             }

src/main/java/com/fishercoder/solutions/_264.java

@@ -41,7 +41,7 @@ public static class Solution2 {
          */
         public int nthUglyNumber(int n) {
             TreeSet<Long> treeSet = new TreeSet<>();
-            treeSet.add(1l);
+            treeSet.add(1L);
             int count = 1;
             int polled = 0;
             int[] primes = new int[]{2, 3, 5};

src/main/java/com/fishercoder/solutions/_380.java

@@ -37,7 +37,8 @@ public boolean remove(int val) {
                     return false;
                 } else {
                     int removeIndex = map.get(val);
-                    if (removeIndex != list.size() - 1) {//if it's not the last element, then we need to swap it with the last element so that this operation is also O(1)
+                    if (removeIndex != list.size() - 1) {
+                        //if it's not the last element, then we need to swap it with the last element so that this operation is also O(1)
                         int lastElement = list.get(list.size() - 1);
                         list.set(removeIndex, lastElement);
                         map.put(lastElement, removeIndex);

src/main/java/com/fishercoder/solutions/_698.java

@@ -49,7 +49,7 @@ public static class Solution2 {
          */
         public boolean canPartitionKSubsets(int[] nums, int k) {
             Arrays.sort(nums);
-            long sum = 0l;
+            long sum = 0L;
             for (int num : nums) {
                 sum += num;
             }