refactor for format

Author: fishercoder1534

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

@@ -6,19 +6,19 @@
 public class _50 {
 
     public double myPow(double x, int n) {
-        if(n == 0)
+        if (n == 0)
             return 1;
-        if( n == Integer.MIN_VALUE) {
+        if (n == Integer.MIN_VALUE) {
             ++n;
             n = -n;
-            x = 1/x;
-            return x * x * myPow( x*x, n/2 );
+            x = 1 / x;
+            return x * x * myPow(x * x, n / 2);
         }
-        if(n<0){
+        if (n < 0) {
             n = -n;
-            x = 1/x;
+            x = 1 / x;
         }
-        return (n%2 == 0) ? myPow(x*x, n/2) : x*myPow(x*x, n/2);
+        return (n % 2 == 0) ? myPow(x * x, n / 2) : x * myPow(x * x, n / 2);
     }
 
 }

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

@@ -33,7 +33,7 @@ public int[] findMode(TreeNode root) {
         if (root == null) return result;
         List<Integer> list = bfs(root, map);
         result = new int[list.size()];
-        for (int i = 0; i < list.size(); i++){
+        for (int i = 0; i < list.size(); i++) {
             result[i] = list.get(i);
         }
         return result;
@@ -42,9 +42,9 @@ public int[] findMode(TreeNode root) {
     private List<Integer> bfs(TreeNode root, Map<Integer, Integer> map) {
         Queue<TreeNode> queue = new LinkedList<>();
         queue.offer(root);
-        while (!queue.isEmpty()){
+        while (!queue.isEmpty()) {
             int size = queue.size();
-            for (int i = 0; i < size; i++){
+            for (int i = 0; i < size; i++) {
                 TreeNode treeNode = queue.poll();
                 if (treeNode.left != null) queue.offer(treeNode.left);
                 if (treeNode.right != null) queue.offer(treeNode.right);
@@ -54,12 +54,12 @@ private List<Integer> bfs(TreeNode root, Map<Integer, Integer> map) {
 
         int highestFrequency = 0;
         List<Integer> list = new ArrayList<>();
-        for (Map.Entry<Integer, Integer> entry : map.entrySet()){
-            if (entry.getValue() > highestFrequency){
+        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+            if (entry.getValue() > highestFrequency) {
                 highestFrequency = entry.getValue();
                 list.clear();
                 list.add(entry.getKey());
-            } else if (entry.getValue() == highestFrequency){
+            } else if (entry.getValue() == highestFrequency) {
                 list.add(entry.getKey());
             }
         }

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

@@ -24,12 +24,14 @@ public int[] nextGreaterElements(int[] nums) {
         if (nums == null || nums.length == 0) return nums;
         int len = nums.length;
         Stack<Integer> stack = new Stack<>();
-        for (int i = len-1; i >= 0; i--) {
-            stack.push(i);//push all indexes into the stack reversely
+        for (int i = len - 1; i >= 0; i--) {
+            stack.push(i);
+            //push all indexes into the stack reversely
         }
         int[] result = new int[len];
-        for (int i = len-1; i >= 0; i--) {
-            result[i] = -1;//initialize it to be -1 in case we cannot find its next greater element in the array
+        for (int i = len - 1; i >= 0; i--) {
+            result[i] = -1;
+            //initialize it to be -1 in case we cannot find its next greater element in the array
             while (!stack.isEmpty() && (nums[stack.peek()] <= nums[i])) {
                 stack.pop();
             }
@@ -45,12 +47,12 @@ public int[] nextGreaterElements(int[] nums) {
     public int[] nextGreaterElements_editorial_solution(int[] nums) {
         int[] result = new int[nums.length];
         Stack<Integer> stack = new Stack<>();
-        for (int i = nums.length*2-1; i>=0 ;i--) {
-            while (!stack.isEmpty() && nums[stack.peek()] <= nums[i%nums.length]) {
+        for (int i = nums.length * 2 - 1; i >= 0; i--) {
+            while (!stack.isEmpty() && nums[stack.peek()] <= nums[i % nums.length]) {
                 stack.pop();
             }
-            result[i%nums.length] = stack.isEmpty() ? -1 : nums[stack.peek()];
-            stack.push(i%nums.length);
+            result[i % nums.length] = stack.isEmpty() ? -1 : nums[stack.peek()];
+            stack.push(i % nums.length);
         }
         return result;
     }

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

@@ -60,8 +60,8 @@ public int shortestDistance(int[][] maze, int[] start, int[] destination) {
         queue.offer(new Point(start[0], start[1], 0));
         int m = maze.length, n = maze[0].length;
         int[][] length = new int[m][n];
-        for (int i = 0; i < m*n; i++) {
-            length[i/n][i%n] = Integer.MAX_VALUE;//initialize the length array
+        for (int i = 0; i < m * n; i++) {
+            length[i / n][i % n] = Integer.MAX_VALUE;//initialize the length array
         }
 
         while (!queue.isEmpty()) {

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

@@ -21,20 +21,20 @@ public class _506 {
 
     public String[] findRelativeRanks(int[] nums) {
         int[] tmp = new int[nums.length];
-        for (int i = 0; i < nums.length; i++){
+        for (int i = 0; i < nums.length; i++) {
             tmp[i] = nums[i];
         }
         Arrays.sort(tmp);
         Map<Integer, String> rankMap = new HashMap();
         int len = nums.length;
-        for (int i = len-1; i >= 0; i--){
-            if (i == len-1) rankMap.put(tmp[i], "Gold Medal");
-            else if (i == len-2) rankMap.put(tmp[i], "Silver Medal");
-            else if (i == len-3) rankMap.put(tmp[i], "Bronze Medal");
-            else rankMap.put(tmp[i], String.valueOf(len-i));
+        for (int i = len - 1; i >= 0; i--) {
+            if (i == len - 1) rankMap.put(tmp[i], "Gold Medal");
+            else if (i == len - 2) rankMap.put(tmp[i], "Silver Medal");
+            else if (i == len - 3) rankMap.put(tmp[i], "Bronze Medal");
+            else rankMap.put(tmp[i], String.valueOf(len - i));
         }
         String[] result = new String[len];
-        for (int i = 0; i < len; i++){
+        for (int i = 0; i < len; i++) {
             result[i] = rankMap.get(nums[i]);
         }
         return result;

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

@@ -21,7 +21,7 @@ public boolean checkPerfectNumber(int num) {
         for (int i = 2; i <= Math.sqrt(num); i++) {
             if (num % i == 0) {
                 sum += i;
-                if (i != num/i) sum += num/i;
+                if (i != num / i) sum += num / i;
             }
         }
         sum++;

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

@@ -39,11 +39,11 @@ public int findBottomLeftValue(TreeNode root) {
         Queue<TreeNode> queue = new LinkedList<>();
         queue.offer(root);
         TreeNode leftMost = root;
-        while (!queue.isEmpty()){
+        while (!queue.isEmpty()) {
             int size = queue.size();
-            for (int i = 0; i < size; i++){
+            for (int i = 0; i < size; i++) {
                 TreeNode curr = queue.poll();
-                if (i == 0){
+                if (i == 0) {
                     leftMost = curr;
                 }
                 if (curr.left != null) queue.offer(curr.left);

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

@@ -42,20 +42,20 @@ public class _514 {
     public int findRotateSteps(String ring, String key) {
         int n = ring.length();
         int m = key.length();
-        int[][] dp = new int[m+1][n];
-        for (int i = m-1; i >= 0; i--) {
+        int[][] dp = new int[m + 1][n];
+        for (int i = m - 1; i >= 0; i--) {
             for (int j = 0; j < n; j++) {
                 dp[i][j] = Integer.MAX_VALUE;
                 for (int k = 0; k < n; k++) {
                     if (ring.charAt(k) == key.charAt(i)) {
                         int diff = Math.abs(j - k);
                         int step = Math.min(diff, n - diff);
-                        dp[i][j] = Math.min(dp[i][j], step + dp[i+1][k]);
+                        dp[i][j] = Math.min(dp[i][j], step + dp[i + 1][k]);
                     }
                 }
             }
         }
-        return dp[0][0]+m;
+        return dp[0][0] + m;
     }
 
 }

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

@@ -44,25 +44,25 @@ public List<Integer> largestValues(TreeNode root) {
     }
 
     public List<Integer> largestValuesDFS(TreeNode root) {
-        List<Integer> res =  new ArrayList<>();
-        if(root == null) {
-            return  res;
+        List<Integer> res = new ArrayList<>();
+        if (root == null) {
+            return res;
         }
         dfs(root, res, 0);
         return res;
 
     }
 
     public void dfs(TreeNode root, List<Integer> res, int level) {
-        if(root == null) {
+        if (root == null) {
             return;
         }
-        if(level == res.size()) {
+        if (level == res.size()) {
             res.add(root.val);
         }
         res.set(level, Math.max(res.get(level), root.val));
-        dfs(root.left, res, level +1);
-        dfs(root.right, res, level +1);
+        dfs(root.left, res, level + 1);
+        dfs(root.right, res, level + 1);
     }
 
 }

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

@@ -59,7 +59,7 @@ private String abbreviate(String word, int k) {
         StringBuilder stringBuilder = new StringBuilder();
         stringBuilder.append(word.substring(0, k));
         stringBuilder.append(word.length() - 1 - k);
-        stringBuilder.append(word.substring(word.length()-1));
+        stringBuilder.append(word.substring(word.length() - 1));
         return stringBuilder.toString();
     }