Fixed idea warnings.

javadev · javadev · commit 826ed71ec077 · 2021-11-30T04:41:14.000+02:00
diff --git a/src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java b/src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java
@@ -1,15 +1,14 @@
 package g0001_0100.s0010_regular_expression_matching;
 
 public class Solution {
-
-    Boolean[][] cache;
+    private Boolean[][] cache;
 
     public boolean isMatch(String s, String p) {
         cache = new Boolean[s.length() + 1][p.length() + 1];
         return isMatch(s, p, 0, 0);
     }
 
-    public boolean isMatch(String s, String p, int i, int j) {
+    private boolean isMatch(String s, String p, int i, int j) {
         if (j == p.length()) {
             return i == s.length();
         }
diff --git a/src/main/java/g0001_0100/s0012_integer_to_roman/Solution.java b/src/main/java/g0001_0100/s0012_integer_to_roman/Solution.java
@@ -17,7 +17,7 @@ public String intToRoman(int num) {
         return sb.toString();
     }
 
-    public int numerals(StringBuilder sb, int num, int one, char cTen, char cFive, char cOne) {
+    private int numerals(StringBuilder sb, int num, int one, char cTen, char cFive, char cOne) {
         int div = num / one;
         switch (div) {
             case 9:
diff --git a/src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java b/src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java
@@ -10,7 +10,7 @@ public List<String> generateParenthesis(int n) {
         return generate(sb, ans, n, n);
     }
 
-    public List<String> generate(StringBuilder sb, List<String> str, int open, int close) {
+    private List<String> generate(StringBuilder sb, List<String> str, int open, int close) {
         if (open == 0 && close == 0) {
             str.add(sb.toString());
             return str;
diff --git a/src/main/java/g0001_0100/s0031_next_permutation/Solution.java b/src/main/java/g0001_0100/s0031_next_permutation/Solution.java
@@ -21,13 +21,13 @@ public void nextPermutation(int[] nums) {
         reverse(nums, i + 1, nums.length - 1);
     }
 
-    public void swap(int[] nums, int i, int j) {
+    private void swap(int[] nums, int i, int j) {
         int temp = nums[i];
         nums[i] = nums[j];
         nums[j] = temp;
     }
 
-    public void reverse(int[] nums, int i, int j) {
+    private void reverse(int[] nums, int i, int j) {
         while (i < j) {
             swap(nums, i++, j--);
         }
diff --git a/src/main/java/g0001_0100/s0036_valid_sudoku/Solution.java b/src/main/java/g0001_0100/s0036_valid_sudoku/Solution.java
@@ -1,9 +1,9 @@
 package g0001_0100.s0036_valid_sudoku;
 
 public class Solution {
-    int j1;
-    int[] i1 = new int[9];
-    int[] b1 = new int[9];
+    private int j1;
+    private int[] i1 = new int[9];
+    private int[] b1 = new int[9];
 
     public boolean isValidSudoku(char[][] board) {
         for (int i = 0; i < 9; i++) {
@@ -17,7 +17,7 @@ public boolean isValidSudoku(char[][] board) {
         return true;
     }
 
-    boolean checkValid(char[][] board, int i, int j) {
+    private boolean checkValid(char[][] board, int i, int j) {
         if (j == 0) {
             j1 = 0;
         }
diff --git a/src/main/java/g0001_0100/s0037_sudoku_solver/Solution.java b/src/main/java/g0001_0100/s0037_sudoku_solver/Solution.java
@@ -4,10 +4,10 @@
 import java.util.List;
 
 public class Solution {
-    List<int[]> emptyCells = new ArrayList<>();
-    int[] rows = new int[9];
-    int[] cols = new int[9];
-    int[] boxes = new int[9];
+    private List<int[]> emptyCells = new ArrayList<>();
+    private int[] rows = new int[9];
+    private int[] cols = new int[9];
+    private int[] boxes = new int[9];
 
     public void solveSudoku(char[][] board) {
         for (int r = 0; r < 9; r++) {
@@ -26,7 +26,7 @@ public void solveSudoku(char[][] board) {
         backtracking(board, 0);
     }
 
-    boolean backtracking(char[][] board, int i) {
+    private boolean backtracking(char[][] board, int i) {
         // Check if we filled all empty cells?
         if (i == emptyCells.size()) {
             return true;
@@ -58,7 +58,7 @@ boolean backtracking(char[][] board, int i) {
         return false;
     }
 
-    boolean hasBit(int x, int k) {
+    private boolean hasBit(int x, int k) {
         return (x >> k & 1) == 1;
     }
 }
diff --git a/src/main/java/g0001_0100/s0052_n_queens_ii/Solution.java b/src/main/java/g0001_0100/s0052_n_queens_ii/Solution.java
@@ -9,7 +9,7 @@ public int totalNQueens(int n) {
         return totalNQueens(n, 0, row, col, diagonal, antiDiagonal);
     }
 
-    public static int totalNQueens(
+    private static int totalNQueens(
             int n,
             int r,
             boolean[] row,
diff --git a/src/main/java/g0001_0100/s0064_minimum_path_sum/Solution.java b/src/main/java/g0001_0100/s0064_minimum_path_sum/Solution.java
@@ -19,7 +19,7 @@ public int minPathSum(int[][] grid) {
         return recur(grid, dm, 0, 0);
     }
 
-    static int recur(int[][] grid, int[][] dm, int r, int c) {
+    private int recur(int[][] grid, int[][] dm, int r, int c) {
         if (dm[r][c] == 0 && r != grid.length - 1 && c != grid[0].length - 1) {
             dm[r][c] = grid[r][c] + Math.min(recur(grid, dm, r + 1, c), recur(grid, dm, r, c + 1));
         }
diff --git a/src/main/java/g0001_0100/s0078_subsets/Solution.java b/src/main/java/g0001_0100/s0078_subsets/Solution.java
@@ -11,7 +11,7 @@ public List<List<Integer>> subsets(int[] nums) {
         return res;
     }
 
-    void solve(int[] nums, List<Integer> temp, List<List<Integer>> res, int start) {
+    private void solve(int[] nums, List<Integer> temp, List<List<Integer>> res, int start) {
         res.add(new ArrayList<>(temp));
         for (int i = start; i < nums.length; i++) {
             temp.add(nums[i]);
diff --git a/src/main/java/g0001_0100/s0079_submissions/Solution.java b/src/main/java/g0001_0100/s0079_submissions/Solution.java
@@ -1,7 +1,8 @@
 package g0001_0100.s0079_submissions;
 
 public class Solution {
-    boolean backtrace(char[][] board, boolean[][] visited, String word, int index, int x, int y) {
+    private boolean backtrace(
+            char[][] board, boolean[][] visited, String word, int index, int x, int y) {
         if (index == word.length()) {
             return true;
         }
diff --git a/src/main/java/g0001_0100/s0081_search_in_rotated_sorted_array_ii/Solution.java b/src/main/java/g0001_0100/s0081_search_in_rotated_sorted_array_ii/Solution.java
@@ -5,7 +5,7 @@ public boolean search(int[] nums, int target) {
         return binary(nums, 0, nums.length - 1, target);
     }
 
-    public boolean binary(int[] a, int i, int j, int t) {
+    private boolean binary(int[] a, int i, int j, int t) {
         if (i > j) {
             return false;
         }
diff --git a/src/main/java/g0001_0100/s0081_search_in_rotated_sorted_array_ii/readme.md b/src/main/java/g0001_0100/s0081_search_in_rotated_sorted_array_ii/readme.md
@@ -29,4 +29,4 @@ You must decrease the overall operation steps as much as possible.
 *   `nums` is guaranteed to be rotated at some pivot.
 *   <code>-10<sup>4</sup> <= target <= 10<sup>4</sup></code>
 
-**Follow up:** This problem is similar to [Search in Rotated Sorted Array](/problems/search-in-rotated-sorted-array/description/), but `nums` may contain **duplicates**. Would this affect the runtime complexity? How and why?
+**Follow up:** This problem is similar to [Search in Rotated Sorted Array](https://github.com/javadev/LeetCode-in-Java/tree/main/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/), but `nums` may contain **duplicates**. Would this affect the runtime complexity? How and why?
diff --git a/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.java b/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.java
@@ -5,7 +5,7 @@ public int largestRectangleArea(int[] heights) {
         return largestArea(heights, 0, heights.length);
     }
 
-    int largestArea(int[] a, int start, int limit) {
+    private int largestArea(int[] a, int start, int limit) {
         if (a == null || a.length == 0) {
             return 0;
         }
@@ -37,7 +37,7 @@ int largestArea(int[] a, int start, int limit) {
         }
     }
 
-    int findMinInArray(int[] a, int start, int limit) {
+    private int findMinInArray(int[] a, int start, int limit) {
         int min = Integer.MAX_VALUE;
         int minIndex = -1;
         for (int index = start; index < limit; index++) {
@@ -49,7 +49,7 @@ int findMinInArray(int[] a, int start, int limit) {
         return minIndex;
     }
 
-    boolean checkIfSorted(int[] a, int start, int limit) {
+    private boolean checkIfSorted(int[] a, int start, int limit) {
         for (int i = start + 1; i < limit; i++) {
             if (a[i] < a[i - 1]) {
                 return false;
@@ -58,7 +58,7 @@ boolean checkIfSorted(int[] a, int start, int limit) {
         return true;
     }
 
-    int maxOfThreeNums(int a, int b, int c) {
+    private int maxOfThreeNums(int a, int b, int c) {
         return Math.max(Math.max(a, b), c);
     }
 }
diff --git a/src/main/java/g0001_0100/s0085_maximal_rectangle/Solution.java b/src/main/java/g0001_0100/s0085_maximal_rectangle/Solution.java
@@ -30,7 +30,7 @@ public int maximalRectangle(char[][] matrix) {
         return res;
     }
 
-    public int largestRectangleArea(int[] heights) {
+    private int largestRectangleArea(int[] heights) {
         /*
          * idea: scan and store if a[i-1]<=a[i] (increasing), then as long as a[i]<a[i-1], then we
          * can compute the largest rectangle area with base a[j], for j<=i-1, and a[j]>a[i], which
diff --git a/src/main/java/g0001_0100/s0095_unique_binary_search_trees_ii/Solution.java b/src/main/java/g0001_0100/s0095_unique_binary_search_trees_ii/Solution.java
@@ -43,7 +43,7 @@ public List<TreeNode> generateTrees(int n) {
         return result;
     }
 
-    void insert(TreeNode dest, TreeNode n, TreeNode from) {
+    private void insert(TreeNode dest, TreeNode n, TreeNode from) {
         if (dest.val == from.val) {
             TreeNode h = dest.right;
             dest.right = n;
@@ -53,7 +53,7 @@ void insert(TreeNode dest, TreeNode n, TreeNode from) {
         insert(dest.right, n, from);
     }
 
-    TreeNode copy(TreeNode n) {
+    private TreeNode copy(TreeNode n) {
         if (n == null) {
             return null;
         }
diff --git a/src/main/java/g0001_0100/s0098_validate_binary_search_tree/Solution.java b/src/main/java/g0001_0100/s0098_validate_binary_search_tree/Solution.java
@@ -24,7 +24,7 @@ public boolean isValidBST(TreeNode root) {
 
     // we will send a valid range and check whether the root lies in the range
     // and update the range for the subtrees
-    boolean solve(TreeNode root, long left, long right) {
+    private boolean solve(TreeNode root, long left, long right) {
         if (root == null) {
             return true;
         }
diff --git a/src/main/java/g0001_0100/s0099_recover_binary_search_tree/Solution.java b/src/main/java/g0001_0100/s0099_recover_binary_search_tree/Solution.java
@@ -18,9 +18,9 @@
  * }
  */
 public class Solution {
-    TreeNode prev = null;
-    TreeNode first = null;
-    TreeNode second = null;
+    private TreeNode prev = null;
+    private TreeNode first = null;
+    private TreeNode second = null;
 
     public void recoverTree(TreeNode root) {
         evalSwappedNodes(root);
diff --git a/src/main/java/g0001_0100/s0100_same_tree/Solution.java b/src/main/java/g0001_0100/s0100_same_tree/Solution.java
@@ -24,10 +24,9 @@ private boolean trav(TreeNode n, TreeNode m) {
                 return false;
             }
             return (trav(n.left, m.left) && trav(n.right, m.right));
-        } else if (n == null && m == null) {
-            return true;
+        } else {
+            return n == null && m == null;
         }
-        return false;
     }
 
     public boolean isSameTree(TreeNode p, TreeNode q) {
diff --git a/src/main/java/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.java b/src/main/java/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.java
@@ -51,7 +51,7 @@ public Node connect(Node root) {
         return root;
     }
 
-    public Node adjacentRightNode(Node root) {
+    private Node adjacentRightNode(Node root) {
         Node temp = root;
         while (temp != null) {
             if (temp.left == null && temp.right == null) {
diff --git a/src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.java b/src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.java
@@ -3,7 +3,7 @@
 import com_github_leetcode.TreeNode;
 
 public class Solution {
-    int maxSum = Integer.MIN_VALUE;
+    private int maxSum = Integer.MIN_VALUE;
 
     public int maxPathSum(TreeNode root) {
         findMaxPathSum(root);
diff --git a/src/main/java/g0101_0200/s0125_valid_palindrome/Solution.java b/src/main/java/g0101_0200/s0125_valid_palindrome/Solution.java
@@ -39,15 +39,15 @@ public boolean isPalindrome(String s) {
         return res;
     }
 
-    boolean isAlphaNumeric(char c) {
+    private boolean isAlphaNumeric(char c) {
         return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || (c >= '0' && c <= '9');
     }
 
-    boolean isUpper(char c) {
+    private boolean isUpper(char c) {
         return c >= 'A' && c <= 'Z';
     }
 
-    char upperToLower(char c) {
+    private char upperToLower(char c) {
         if (isUpper(c)) {
             c = (char) (c + 32);
         }
diff --git a/src/main/java/g0101_0200/s0126_word_ladder_ii/Solution.java b/src/main/java/g0101_0200/s0126_word_ladder_ii/Solution.java
@@ -21,7 +21,7 @@ public List<List<String>> findLadders(String beginWord, String endWord, List<Str
         return ans;
     }
 
-    public int bfs(
+    private int bfs(
             Map<String, Set<String>> graph,
             String beginWord,
             String endWord,
@@ -97,7 +97,7 @@ public int bfs(
         return length + 1;
     }
 
-    void dfs(
+    private void dfs(
             List<List<String>> ans,
             List<String> path,
             int targetLength,
diff --git a/src/main/java/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution.java b/src/main/java/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution.java
@@ -18,14 +18,14 @@
  * }
  */
 public class Solution {
-    int sum = 0;
+    private int sum = 0;
 
     public int sumNumbers(TreeNode root) {
         recurseSum(root, 0);
         return sum;
     }
 
-    public void recurseSum(TreeNode node, int curNum) {
+    private void recurseSum(TreeNode node, int curNum) {
         if (node.left == null && node.right == null) {
             sum += 10 * curNum + node.val;
         } else {
diff --git a/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java b/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java
@@ -47,7 +47,7 @@ public Node copyRandomList(Node head) {
         // third pass to restore the links and return the head of the cloned nodes' list.
         Node newHead = null;
         while (curr != null) {
-            Node clonedNode = null;
+            Node clonedNode;
             if (newHead == null) {
                 clonedNode = curr.next;
                 newHead = clonedNode;
diff --git a/src/main/java/g0101_0200/s0139_word_break/Solution.java b/src/main/java/g0101_0200/s0139_word_break/Solution.java
@@ -23,7 +23,7 @@ public boolean wordBreak(String s, List<String> wordDict) {
         return false;
     }
 
-    public boolean dfs(String s, int start, int end, int max, Set<String> set, boolean[] flag) {
+    private boolean dfs(String s, int start, int end, int max, Set<String> set, boolean[] flag) {
         if (!flag[end] && set.contains(s.substring(start, end))) {
             flag[end] = true;
             if (end == s.length()) {
diff --git a/src/main/java/g0101_0200/s0143_reorder_list/Solution.java b/src/main/java/g0101_0200/s0143_reorder_list/Solution.java
@@ -14,7 +14,7 @@
  * }
  */
 public class Solution {
-    ListNode forward;
+    private ListNode forward;
 
     public void reorderList(ListNode head) {
         forward = head;
diff --git a/src/main/java/g0101_0200/s0146_lru_cache/LruCache.java b/src/main/java/g0101_0200/s0146_lru_cache/LruCache.java
@@ -4,12 +4,12 @@
 import java.util.Map;
 
 public class LruCache {
-    int capacity;
-    Map<Integer, LruCacheNode> cacheMap = new HashMap<>();
+    private int capacity;
+    private Map<Integer, LruCacheNode> cacheMap = new HashMap<>();
     // insert here
-    LruCacheNode head;
+    private LruCacheNode head;
     // remove here
-    LruCacheNode tail;
+    private LruCacheNode tail;
 
     public LruCache(int cap) {
         capacity = cap;
diff --git a/src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java b/src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java
@@ -11,7 +11,7 @@ public String reverseWords(String s) {
             }
             int start = s.lastIndexOf(' ', i);
             sb.append(' ');
-            sb.append(s.substring(start + 1, i + 1));
+            sb.append(s, start + 1, i + 1);
             i = start - 1;
         }
         if (sb.length() > 0) {
diff --git a/src/main/java/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.java b/src/main/java/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.java
@@ -8,7 +8,7 @@ public int findMin(int[] nums) {
         return find(0, nums.length - 1, nums);
     }
 
-    int find(int left, int right, int[] nums) {
+    private int find(int left, int right, int[] nums) {
         if (left + 1 >= right) {
             return Math.min(nums[left], nums[right]);
         }
diff --git a/src/main/java/g0101_0200/s0155_min_stack/MinStack.java b/src/main/java/g0101_0200/s0155_min_stack/MinStack.java
diff --git a/src/main/java/g0101_0200/s0166_fraction_to_recurring_decimal/Solution.java b/src/main/java/g0101_0200/s0166_fraction_to_recurring_decimal/Solution.java
diff --git a/src/main/java/g0101_0200/s0189_rotate_array/Solution.java b/src/main/java/g0101_0200/s0189_rotate_array/Solution.java
diff --git a/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java b/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java
diff --git a/src/main/java/g0201_0300/s0264_ugly_number_ii/Solution.java b/src/main/java/g0201_0300/s0264_ugly_number_ii/Solution.java
diff --git a/src/main/java/g0201_0300/s0273_integer_to_english_words/Solution.java b/src/main/java/g0201_0300/s0273_integer_to_english_words/Solution.java
diff --git a/src/main/java/g0201_0300/s0284_peeking_iterator/PeekingIterator.java b/src/main/java/g0201_0300/s0284_peeking_iterator/PeekingIterator.java
diff --git a/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java b/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java
diff --git a/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/readme.md b/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/readme.md
diff --git a/src/main/java/g0201_0300/s0299_bulls_and_cows/Solution.java b/src/main/java/g0201_0300/s0299_bulls_and_cows/Solution.java
diff --git a/src/main/java/g2001_2100/s2080_range_frequency_queries/RangeFreqQuery.java b/src/main/java/g2001_2100/s2080_range_frequency_queries/RangeFreqQuery.java

Original file line number	Diff line number	Diff line change
`@@ -17,7 +17,7 @@ public String intToRoman(int num) {`
`17`	`17`	`return sb.toString();`
`18`	`18`	`}`
`19`	`19`
`20`		`- public int numerals(StringBuilder sb, int num, int one, char cTen, char cFive, char cOne) {`
	`20`	`+ private int numerals(StringBuilder sb, int num, int one, char cTen, char cFive, char cOne) {`
`21`	`21`	`int div = num / one;`
`22`	`22`	`switch (div) {`
`23`	`23`	`case 9:`
Original file line number	Diff line number	Diff line change
`@@ -10,7 +10,7 @@ public List<String> generateParenthesis(int n) {`
`10`	`10`	`return generate(sb, ans, n, n);`
`11`	`11`	`}`
`12`	`12`
`13`		`- public List<String> generate(StringBuilder sb, List<String> str, int open, int close) {`
	`13`	`+ private List<String> generate(StringBuilder sb, List<String> str, int open, int close) {`
`14`	`14`	`if (open == 0 && close == 0) {`
`15`	`15`	`str.add(sb.toString());`
`16`	`16`	`return str;`
Original file line number	Diff line number	Diff line change
`@@ -21,13 +21,13 @@ public void nextPermutation(int[] nums) {`
`21`	`21`	`reverse(nums, i + 1, nums.length - 1);`
`22`	`22`	`}`
`23`	`23`
`24`		`- public void swap(int[] nums, int i, int j) {`
	`24`	`+ private void swap(int[] nums, int i, int j) {`
`25`	`25`	`int temp = nums[i];`
`26`	`26`	`nums[i] = nums[j];`
`27`	`27`	`nums[j] = temp;`
`28`	`28`	`}`
`29`	`29`
`30`		`- public void reverse(int[] nums, int i, int j) {`
	`30`	`+ private void reverse(int[] nums, int i, int j) {`
`31`	`31`	`while (i < j) {`
`32`	`32`	`swap(nums, i++, j--);`
`33`	`33`	`}`
Original file line number	Diff line number	Diff line change
`@@ -9,7 +9,7 @@ public int totalNQueens(int n) {`
`9`	`9`	`return totalNQueens(n, 0, row, col, diagonal, antiDiagonal);`
`10`	`10`	`}`
`11`	`11`
`12`		`- public static int totalNQueens(`
	`12`	`+ private static int totalNQueens(`
`13`	`13`	`int n,`
`14`	`14`	`int r,`
`15`	`15`	`boolean[] row,`
Original file line number	Diff line number	Diff line change
`@@ -19,7 +19,7 @@ public int minPathSum(int[][] grid) {`
`19`	`19`	`return recur(grid, dm, 0, 0);`
`20`	`20`	`}`
`21`	`21`
`22`		`- static int recur(int[][] grid, int[][] dm, int r, int c) {`
	`22`	`+ private int recur(int[][] grid, int[][] dm, int r, int c) {`
`23`	`23`	`if (dm[r][c] == 0 && r != grid.length - 1 && c != grid[0].length - 1) {`
`24`	`24`	`dm[r][c] = grid[r][c] + Math.min(recur(grid, dm, r + 1, c), recur(grid, dm, r, c + 1));`
`25`	`25`	`}`
Original file line number	Diff line number	Diff line change
`@@ -11,7 +11,7 @@ public List<List<Integer>> subsets(int[] nums) {`
`11`	`11`	`return res;`
`12`	`12`	`}`
`13`	`13`
`14`		`- void solve(int[] nums, List<Integer> temp, List<List<Integer>> res, int start) {`
	`14`	`+ private void solve(int[] nums, List<Integer> temp, List<List<Integer>> res, int start) {`
`15`	`15`	`res.add(new ArrayList<>(temp));`
`16`	`16`	`for (int i = start; i < nums.length; i++) {`
`17`	`17`	`temp.add(nums[i]);`
Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,8 @@`
`1`	`1`	`package g0001_0100.s0079_submissions;`
`2`	`2`
`3`	`3`	`public class Solution {`
`4`		`- boolean backtrace(char[][] board, boolean[][] visited, String word, int index, int x, int y) {`
	`4`	`+ private boolean backtrace(`
	`5`	`+ char[][] board, boolean[][] visited, String word, int index, int x, int y) {`
`5`	`6`	`if (index == word.length()) {`
`6`	`7`	`return true;`
`7`	`8`	`}`