update

Author: ThanhNIT

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

@@ -4,16 +4,17 @@
 // #2024_11_11_Time_1_ms_(99.77%)_Space_44.8_MB_(61.16%)
 
 import java.util.ArrayList;
+import java.util.LinkedList;
 import java.util.List;
 
 public class Solution {
-    public static List<List<String>> solveNQueens(int n) {
+    public 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>>();
-        int leftRow[] = new int[n];
-        int upperDiagonal[] = new int[2 * n - 1];
-        int lowerDiagonal[] = new int[2 * n - 1];
+        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;
     }
@@ -22,9 +23,9 @@ void solve(
             int col,
             char[][] board,
             List<List<String>> res,
-            int leftRow[],
-            int lowerDiagonal[],
-            int upperDiagonal[]) {
+            int[] leftRow,
+            int[] lowerDiagonal,
+            int[] upperDiagonal) {
         if (col == board.length) {
             res.add(construct(board));
             return;
@@ -48,9 +49,9 @@ void solve(
     }
 
     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]);
+        List<String> res = new LinkedList<>();
+        for (char[] chars : board) {
+            String s = new String(chars);
             res.add(s);
         }
         return res;

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

@@ -12,7 +12,7 @@ public boolean canJump(int[] nums) {
         if (nums[0] == 0) {
             return false;
         }
-        int fin = nums.length - 1; // 3
+        int fin = nums.length - 1;
         for (int i = nums.length - 2; i >= 0; i--) {
             if ((nums[i] + i) >= fin) {
                 fin = i;