format

Author: ThanhNIT

src/main/java/g0001_0100/s0049_group_anagrams/Solution.java

@@ -5,18 +5,17 @@
 // #Big_O_Time_O(n*k_log_k)_Space_O(n) #2024_11_11_Time_6_ms_(97.61%)_Space_47.7_MB_(69.56%)
 
 import java.util.ArrayList;
-import java.util.Arrays;
 import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
 
 public class Solution {
     public List<List<String>> groupAnagrams(String[] strs) {
-        Map<String, List<String>> anagrams= new HashMap<>();
-        for (String word: strs) {
+        Map<String, List<String>> anagrams = new HashMap<>();
+        for (String word : strs) {
             char[] freq = new char[26];
             for (char c : word.toCharArray()) {
-                freq[c - 'a'] ++;
+                freq[c - 'a']++;
             }
             String keyString = new String(freq);
             if (!anagrams.containsKey(keyString)) {

src/main/java/g0001_0100/s0051_n_queens/Solution.java

@@ -4,33 +4,36 @@
 // #2024_11_11_Time_1_ms_(99.77%)_Space_44.8_MB_(61.16%)
 
 import java.util.ArrayList;
-import java.util.Arrays;
 import java.util.List;
 
 public class Solution {
-    public static List < List < String >> solveNQueens(int n) {
+    public static List<List<String>> solveNQueens(int n) {
         char[][] board = new char[n][n];
-        for (int i = 0; i < n; i++)
-            for (int j = 0; j < n; j++)
-                board[i][j] = '.';
-        List < List < String >> res = new ArrayList < List < String >> ();
+        for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) board[i][j] = '.';
+        List<List<String>> res = new ArrayList<List<String>>();
         int leftRow[] = new int[n];
         int upperDiagonal[] = new int[2 * n - 1];
         int lowerDiagonal[] = new int[2 * n - 1];
         solve(0, board, res, leftRow, lowerDiagonal, upperDiagonal);
         return res;
     }
 
-
-
-    static void solve(int col, char[][] board, List < List < String >> res, int leftRow[], int lowerDiagonal[], int upperDiagonal[]) {
+    void solve(
+            int col,
+            char[][] board,
+            List<List<String>> res,
+            int leftRow[],
+            int lowerDiagonal[],
+            int upperDiagonal[]) {
         if (col == board.length) {
             res.add(construct(board));
             return;
         }
 
         for (int row = 0; row < board.length; row++) {
-            if (leftRow[row] == 0 && lowerDiagonal[row + col] == 0 && upperDiagonal[board.length - 1 + col - row] == 0) {
+            if (leftRow[row] == 0
+                    && lowerDiagonal[row + col] == 0
+                    && upperDiagonal[board.length - 1 + col - row] == 0) {
                 board[row][col] = 'Q';
                 leftRow[row] = 1;
                 lowerDiagonal[row + col] = 1;
@@ -44,27 +47,12 @@ static void solve(int col, char[][] board, List < List < String >> res, int left
         }
     }
 
-
-    static List < String > construct(char[][] board) {
-        List < String > res = new LinkedList < String > ();
+    List<String> construct(char[][] board) {
+        List<String> res = new LinkedList<String>();
         for (int i = 0; i < board.length; i++) {
             String s = new String(board[i]);
             res.add(s);
         }
         return res;
     }
-    public static void main(String args[]) {
-        int N = 4;
-        List < List < String >> queen = solveNQueens(N);
-        int i = 1;
-        for (List < String > it: queen) {
-            System.out.println("Arrangement " + i);
-            for (String s: it) {
-                System.out.println(s);
-            }
-            System.out.println();
-            i += 1;
-        }
-
-    }
 }

src/main/java/g0001_0100/s0055_jump_game/Solution.java

@@ -6,17 +6,15 @@
 
 public class Solution {
     public boolean canJump(int[] nums) {
-        if(nums.length == 1){
+        if (nums.length == 1) {
             return true;
         }
-
-        if(nums[0] == 0){
+        if (nums[0] == 0) {
             return false;
         }
-
-        int fin = nums.length-1; //3
-        for(int i=nums.length-2;i>=0;i--){
-            if((nums[i]+i) >= fin){
+        int fin = nums.length - 1; // 3
+        for (int i = nums.length - 2; i >= 0; i--) {
+            if ((nums[i] + i) >= fin) {
                 fin = i;
             }
         }

src/main/java/g0001_0100/s0079_word_search/Solution.java

@@ -6,6 +6,7 @@
 
 public class Solution {
     public boolean exists = false;
+
     public boolean exist(char[][] board, String word) {
         for (int i = 0; i < board.length; i++) {
             for (int j = 0; j < board[0].length; j++) {
@@ -14,7 +15,6 @@ public boolean exist(char[][] board, String word) {
                 }
             }
         }
-
         return exists;
     }
 
@@ -23,31 +23,26 @@ private void dfs(char[][] board, String word, int wordIndex, int i, int j) {
             exists = true;
             return;
         }
-
         char currentChar = board[i][j];
         char nextChar = word.charAt(wordIndex);
-
         if (i > 0 && board[i - 1][j] == nextChar) {
             // go up
             board[i][j] = '-';
             dfs(board, word, wordIndex + 1, i - 1, j);
             board[i][j] = currentChar;
         }
-
         if (j > 0 && board[i][j - 1] == nextChar) {
             // go left
             board[i][j] = '-';
             dfs(board, word, wordIndex + 1, i, j - 1);
             board[i][j] = currentChar;
         }
-
         if (i < board.length - 1 && board[i + 1][j] == nextChar) {
             // go down
             board[i][j] = '-';
             dfs(board, word, wordIndex + 1, i + 1, j);
             board[i][j] = currentChar;
         }
-
         if (j < board[0].length - 1 && board[i][j + 1] == nextChar) {
             // go right
             board[i][j] = '-';