Polish all java code translations

jwl-7 · jwl-7 · commit 154a96bdf08a · 2024-06-08T08:57:02.000-04:00
diff --git a/src/code/java/array/string_building.java b/src/code/java/array/string_building.java
@@ -1,8 +1,9 @@
 public String fn(char[] strs) {
-    StringBuilder ans = new StringBuilder();
+    StringBuilder sb = new StringBuilder();
+
     for (char c: strs) {
-        ans.append(c);
+        sb.append(c);
     }
 
-    return ans.toString();
+    return sb.toString();
 }
diff --git a/src/code/java/backtracking/backtracking.java b/src/code/java/backtracking/backtracking.java
@@ -1,12 +1,12 @@
-public int backtrack(int curr, OTHER_ARGUMENTS...) {
+public int backtrack(STATE curr, OTHER_ARGUMENTS...) {
     if (BASE_CASE) {
         // TODO: modify answer
         return 0;
     }
 
     int ans = 0;
 
-    for (int i = 0; i < ITERATE_OVER_INPUT; i++) {
+    for (ITERATE_OVER_INPUT) {
         // TODO: modify current state
         ans += backtrack(curr, OTHER_ARGUMENTS...);
         // TODO: undo modification of current state
diff --git a/src/code/java/binary_search/binary_search.java b/src/code/java/binary_search/binary_search.java
@@ -1,13 +1,13 @@
-public void fn(int[] arr, int target) {
+public int fn(int[] arr, int target) {
     int left = 0;
     int right = arr.length - 1;
 
     while (left <= right) {
-        int mid = (left + right) / 2;
+        int mid = left + (right - left) / 2;
 
         if (arr[mid] == target) {
             // TODO: logic
-            return;
+            return mid;
         }
         if (arr[mid] > target) {
             right = mid - 1;
diff --git a/src/code/java/binary_search/duplicate_elements_left_insertion.java b/src/code/java/binary_search/duplicate_elements_left_insertion.java
@@ -3,7 +3,7 @@ public int fn(int[] arr, int target) {
     int right = arr.length;
 
     while (left < right) {
-        int mid = (left + right) / 2;
+        int mid = left + (right - left) / 2;
 
         if (arr[mid] >= target) {
             right = mid;
diff --git a/src/code/java/binary_search/duplicate_elements_right_insertion.java b/src/code/java/binary_search/duplicate_elements_right_insertion.java
@@ -3,7 +3,7 @@ public int fn(int[] arr, int target) {
     int right = arr.length;
 
     while (left < right) {
-        int mid = (left + right) / 2;
+        int mid = left + (right - left) / 2;
 
         if (arr[mid] > target) {
             right = mid;
diff --git a/src/code/java/binary_search/greedy_maximum.java b/src/code/java/binary_search/greedy_maximum.java
@@ -3,7 +3,7 @@ public int fn(int[] arr) {
     int right = MAXIMUM_POSSIBLE_ANSWER;
 
     while (left <= right) {
-        int mid = (left + right) / 2;
+        int mid = left + (right - left) / 2;
 
         if (check(mid)) {
             left = mid + 1;
@@ -14,3 +14,7 @@ public int fn(int[] arr) {
 
     return right;
 }
+
+public boolean check(int x) {
+    return BOOLEAN
+}
diff --git a/src/code/java/binary_search/greedy_minimum.java b/src/code/java/binary_search/greedy_minimum.java
@@ -3,7 +3,7 @@ public int fn(int[] arr) {
     int right = MAXIMUM_POSSIBLE_ANSWER;
 
     while (left <= right) {
-        int mid = (left + right) / 2;
+        int mid = left + (right - left) / 2;
 
         if (check(mid)) {
             right = mid - 1;
@@ -14,3 +14,7 @@ public int fn(int[] arr) {
 
     return left;
 }
+
+public boolean check(int x) {
+    return BOOLEAN
+}
diff --git a/src/code/java/binary_tree/bfs.java b/src/code/java/binary_tree/bfs.java
@@ -11,7 +11,7 @@ public int fn(TreeNode root) {
         int currentLength = que.size();
         // TODO: logic for current level
         for (int i = 0; i < currentLength; i++) {
-            TreeNode node = que.poll();
+            TreeNode node = que.remove();
             // TODO: logic
             if (node.left != null) {
                 que.add(node.left);
diff --git a/src/code/java/binary_tree/dfs_recursive.java b/src/code/java/binary_tree/dfs_recursive.java
@@ -1,6 +1,6 @@
 public int dfs(TreeNode root) {
     if (root == null) {
-        return;
+        return 0;
     }
 
     int ans = 0;
diff --git a/src/code/java/bit_manipulation/count_set_bits.java b/src/code/java/bit_manipulation/count_set_bits.java
@@ -1,8 +1,10 @@
 public int countSetBits(int num) {
     int count = 0;
+
     while (num > 0) {
         count += num & 1;
         num >>= 1;
     }
+
     return count;
 }
diff --git a/src/code/java/data_structures/array.java b/src/code/java/data_structures/array.java
@@ -1,17 +1,18 @@
 public class Array<T> {
     private int size;
-    private Object[] data;
+    private T[] data;
 
+    @SuppressWarnings("unchecked")
     public Array(int size) {
         this.size = size;
-        this.data = new Object[size];
+        this.data = (T[]) new Object[size];
     }
 
     public T get(int index) {
         if (index < 0 || index >= size) {
             throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + size);
         }
-        return (T) data[index];
+        return data[index];
     }
 
     public void set(int index, T value) {
@@ -21,19 +22,21 @@ public void set(int index, T value) {
         data[index] = value;
     }
 
-    public int length() {
+    public int size() {
         return size;
     }
 
     @Override
     public String toString() {
         StringBuilder sb = new StringBuilder("[");
+
         for (int i = 0; i < size; i++) {
             sb.append(data[i]);
             if (i < size - 1) {
                 sb.append(", ");
             }
         }
+
         sb.append("]");
         return sb.toString();
     }
diff --git a/src/code/java/data_structures/doubly_linked_list.java b/src/code/java/data_structures/doubly_linked_list.java
@@ -29,6 +29,7 @@ public void append(T data) {
         }
 
         ListNode<T> curr = head;
+
         while (curr.next != null) {
             curr = curr.next;
         }
@@ -52,6 +53,7 @@ public void delete(T data) {
         }
 
         ListNode<T> curr = head;
+
         while (curr != null) {
             if (curr.data.equals(data)) {
                 ListNode<T> prevNode = curr.prev;
@@ -88,10 +90,12 @@ public String toString() {
 
         StringBuilder sb = new StringBuilder();
         ListNode<T> curr = head;
+
         while (curr != null) {
             sb.append(curr.toString()).append(" <-> ");
             curr = curr.next;
         }
+
         sb.append("None");
         return sb.toString();
     }
diff --git a/src/code/java/data_structures/graph.java b/src/code/java/data_structures/graph.java
@@ -1,4 +1,8 @@
-import java.util.*;
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
 
 public class Graph {
     Map<String, List<String>> graph;
diff --git a/src/code/java/data_structures/hash_map.java b/src/code/java/data_structures/hash_map.java
@@ -1,6 +1,3 @@
-import java.util.HashMap;
-
-
 public class HashMap {
     private int size;
     private Object[] bucket;
diff --git a/src/code/java/data_structures/linked_list.java b/src/code/java/data_structures/linked_list.java
@@ -27,6 +27,7 @@ public void append(int data) {
         }
 
         ListNode current = head;
+
         while (current.next != null) {
             current = current.next;
         }
diff --git a/src/code/java/data_structures/trie.java b/src/code/java/data_structures/trie.java
@@ -1,6 +1,9 @@
+import java.util.ArrayList;
 import java.util.HashMap;
+import java.util.List;
 import java.util.Map;
 
+
 class TrieNode {
     Map<Character, TrieNode> children;
     boolean isWord;
@@ -79,7 +82,7 @@ public List<String> collectWords(TrieNode node, String prefix) {
 
     @Override
     public String toString() {
-        return "Trie:\n" + printTrie(root);
+        return "Trie:\n" + printTrie(root, 0, null);
     }
 
     private String printTrie(TrieNode node, int level, String prefix) {
@@ -95,6 +98,7 @@ private String printTrie(TrieNode node, int level, String prefix) {
         }
 
         int i = 0;
+
         for (Map.Entry<Character, TrieNode> entry : node.children.entrySet()) {
             boolean isLast = i == node.children.size() - 1;
             String marker = isLast ? "└─ " : "├─ ";
diff --git a/src/code/java/data_structures/union_find.java b/src/code/java/data_structures/union_find.java
@@ -3,6 +3,7 @@
 import java.util.List;
 import java.util.Map;
 
+
 public class UnionFind {
     private int[] root;
 
@@ -36,13 +37,16 @@ public String toString() {
 
         for (int i = 0; i < n; i++) {
             int root = find(i);
+
             if (!componentMap.containsKey(root)) {
                 componentMap.put(root, new ArrayList<>());
             }
+
             componentMap.get(root).add(i);
         }
 
         StringBuilder sb = new StringBuilder();
+
         for (List<Integer> component : componentMap.values()) {
             sb.append(" - ").append(component);
         }
diff --git a/src/code/java/data_structures/union_find_optimized.java b/src/code/java/data_structures/union_find_optimized.java
@@ -3,13 +3,15 @@
 import java.util.List;
 import java.util.Map;
 
+
 class UnionFind {
     int[] root;
     int[] rank;
 
     public UnionFind(int n) {
         this.root = new int[n];
         this.rank = new int[n];
+
         for (int i = 0; i < n; i++) {
             this.root[i] = i;
             this.rank[i] = 1;
@@ -46,18 +48,20 @@ public boolean connected(int a, int b) {
     @Override
     public String toString() {
         int n = root.length;
-        List<List<Integer>> components = new ArrayList<>();
         Map<Integer, List<Integer>> componentMap = new HashMap<>();
 
         for (int i = 0; i < n; i++) {
             int root = find(i);
+
             if (!componentMap.containsKey(root)) {
                 componentMap.put(root, new ArrayList<>());
             }
+
             componentMap.get(root).add(i);
         }
 
         StringBuilder sb = new StringBuilder();
+
         for (List<Integer> component : componentMap.values()) {
             sb.append(" - ").append(component);
         }
diff --git a/src/code/java/dynamic_programming/bottom_up.java b/src/code/java/dynamic_programming/bottom_up.java
@@ -1,3 +1,6 @@
+import java.util.Arrays;
+
+
 public int fn(int[] arr) {
     if (BASE_CASE) {
         return 0;
diff --git a/src/code/java/dynamic_programming/top_down.java b/src/code/java/dynamic_programming/top_down.java
@@ -1,3 +1,7 @@
+import java.util.HashMap;
+import java.util.Map;
+
+
 Map<STATE, Integer> memo = new HashMap<>();
 
 public int fn(int[] arr) {
diff --git a/src/code/java/graph/bellman_ford.java b/src/code/java/graph/bellman_ford.java
@@ -1,4 +1,8 @@
-public static int[] bellmanFord(int n, List<int[]> edges, int source) {
+import java.util.Arrays;
+import java.util.List;
+
+
+public int[] bellmanFord(int n, List<int[]> edges, int source) {
     int[] distances = new int[n];
     Arrays.fill(distances, Integer.MAX_VALUE);
     distances[source] = 0;
@@ -8,6 +12,7 @@ public static int[] bellmanFord(int n, List<int[]> edges, int source) {
             int u = edge[0];
             int v = edge[1];
             int w = edge[2];
+
             if (distances[u] != Integer.MAX_VALUE && distances[u] + w < distances[v]) {
                 distances[v] = distances[u] + w;
             }
@@ -18,6 +23,7 @@ public static int[] bellmanFord(int n, List<int[]> edges, int source) {
         int u = edge[0];
         int v = edge[1];
         int w = edge[2];
+
         if (distances[u] != Integer.MAX_VALUE && distances[u] + w < distances[v]) {
             return new int[]{};
         }
diff --git a/src/code/java/graph/bfs.java b/src/code/java/graph/bfs.java
@@ -1,25 +1,26 @@
-import java.util.LinkedList;
+import java.util.ArrayList;
 import java.util.HashSet;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Map;
 import java.util.Queue;
 import java.util.Set;
-import java.util.Map;
 
 
-public static int fn(Map<Integer, List<Integer>> graph) {
+public int fn(int[][] graph) {
     Queue<Integer> que = new LinkedList<>();
     Set<Integer> seen = new HashSet<>();
     que.offer(START_NODE);
     seen.add(START_NODE);
     int ans = 0;
 
     while (!que.isEmpty()) {
-        int node = que.poll();
+        int node = que.remove();
         // TODO: Logic
-        List<Integer> neighbors = graph.getOrDefault(node, new ArrayList<>());
-        for (int neighbor : neighbors) {
+        for (int neighbor: graph[node]) {
             if (!seen.contains(neighbor)) {
                 seen.add(neighbor);
-                que.offer(neighbor);
+                que.add(neighbor);
             }
         }
     }
diff --git a/src/code/java/graph/dijkstra.java b/src/code/java/graph/dijkstra.java
diff --git a/src/code/java/graph/kahn.java b/src/code/java/graph/kahn.java
diff --git a/src/code/java/graph/kruskal.java b/src/code/java/graph/kruskal.java
diff --git a/src/code/java/hash_map/sliding_window.java b/src/code/java/hash_map/sliding_window.java
diff --git a/src/code/java/heap/find_top_k_elements.java b/src/code/java/heap/find_top_k_elements.java
diff --git a/src/code/java/matrix/create_copy.java b/src/code/java/matrix/create_copy.java
diff --git a/src/code/java/matrix/diagonals.java b/src/code/java/matrix/diagonals.java
diff --git a/src/code/java/matrix/rotate_transpose.java b/src/code/java/matrix/rotate_transpose.java

Original file line number	Diff line number	Diff line change
`@@ -1,8 +1,9 @@`
`1`	`1`	`public String fn(char[] strs) {`
`2`		`- StringBuilder ans = new StringBuilder();`
	`2`	`+ StringBuilder sb = new StringBuilder();`
	`3`	`+`
`3`	`4`	`for (char c: strs) {`
`4`		`- ans.append(c);`
	`5`	`+ sb.append(c);`
`5`	`6`	`}`
`6`	`7`
`7`		`- return ans.toString();`
	`8`	`+ return sb.toString();`
`8`	`9`	`}`
Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`public int dfs(TreeNode root) {`
`2`	`2`	`if (root == null) {`
`3`		`- return;`
	`3`	`+ return 0;`
`4`	`4`	`}`
`5`	`5`
`6`	`6`	`int ans = 0;`
Original file line number	Diff line number	Diff line change
`@@ -1,8 +1,10 @@`
`1`	`1`	`public int countSetBits(int num) {`
`2`	`2`	`int count = 0;`
	`3`	`+`
`3`	`4`	`while (num > 0) {`
`4`	`5`	`count += num & 1;`
`5`	`6`	`num >>= 1;`
`6`	`7`	`}`
	`8`	`+`
`7`	`9`	`return count;`
`8`	`10`	`}`