Updated tag for tasks 347-1143

ThanhNIT · ThanhNIT · commit a26644493332 · 2024-11-17T12:01:47.000+07:00
diff --git a/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java b/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Array #Hash_Table #Sorting #Heap_Priority_Queue #Counting
 // #Divide_and_Conquer #Quickselect #Bucket_Sort #Data_Structure_II_Day_20_Heap_Priority_Queue
-// #Big_O_Time_O(n*log(n))_Space_O(k) #2022_07_11_Time_9_ms_(97.93%)_Space_48.5_MB_(83.34%)
+// #Big_O_Time_O(n*log(n))_Space_O(k) #2024_11_17_Time_9_ms_(97.30%)_Space_45.4_MB_(92.52%)
 
 import java.util.Arrays;
 import java.util.PriorityQueue;
diff --git a/src/main/java/g0301_0400/s0394_decode_string/Solution.java b/src/main/java/g0301_0400/s0394_decode_string/Solution.java
@@ -1,7 +1,7 @@
 package g0301_0400.s0394_decode_string;
 
 // #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings
-// #Big_O_Time_O(n)_Space_O(n) #2022_07_15_Time_1_ms_(87.68%)_Space_41.2_MB_(83.30%)
+// #Big_O_Time_O(n)_Space_O(n) #2024_11_17_Time_0_ms_(100.00%)_Space_41.5_MB_(58.38%)
 
 public class Solution {
     private int i = 0;
diff --git a/src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java b/src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java
@@ -1,25 +1,41 @@
 package g0401_0500.s0416_partition_equal_subset_sum;
 
 // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Level_2_Day_13_Dynamic_Programming
-// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2022_12_29_Time_27_ms_(94.53%)_Space_41.8_MB_(95.29%)
+// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2024_11_17_Time_6_ms_(99.66%)_Space_42.4_MB_(82.95%)
 
 public class Solution {
     public boolean canPartition(int[] nums) {
-        int sums = 0;
-        for (int num : nums) {
-            sums += num;
+        int sum = 0;
+        for (int val : nums) {
+            sum += val;
         }
-        if (sums % 2 == 1) {
+        if (sum % 2 != 0) {
             return false;
         }
-        sums /= 2;
-        boolean[] dp = new boolean[sums + 1];
-        dp[0] = true;
-        for (int num : nums) {
-            for (int sum = sums; sum >= num; sum--) {
-                dp[sum] = dp[sum] || dp[sum - num];
+        sum /= 2;
+        boolean[] set = new boolean[sum + 1];
+        int[] arr = new int[sum + 2];
+        int top = 0;
+        for (int val : nums) {
+            if (val > sum) {
+                return false;
+            }
+            if (val == sum) {
+                return true;
+            }
+            for (int i = top; i > -1; i--) {
+                int tempSum = val + arr[i];
+                if (tempSum > sum || set[tempSum]) {
+                    continue;
+                } else {
+                    if (tempSum == sum) {
+                        return true;
+                    }
+                    set[tempSum] = true;
+                    arr[++top] = tempSum;
+                }
             }
         }
-        return dp[sums];
+        return false;
     }
 }
diff --git a/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java b/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java
@@ -1,7 +1,7 @@
 package g0401_0500.s0437_path_sum_iii;
 
 // #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
-// #2022_07_16_Time_18_ms_(45.66%)_Space_42_MB_(88.96%)
+// #2024_11_17_Time_2_ms_(100.00%)_Space_44.7_MB_(11.66%)
 
 import com_github_leetcode.TreeNode;
 
@@ -21,28 +21,27 @@
  * }
  */
 public class Solution {
-    private int count = 0;
-
     public int pathSum(TreeNode root, int targetSum) {
-        if (root == null) {
-            return 0;
-        }
-        helper(root, targetSum, 0);
-        pathSum(root.left, targetSum);
-        pathSum(root.right, targetSum);
-        return count;
+        Map<Long, Integer> h = new HashMap<>();
+        return dfs(root, targetSum, h, 0L);
     }
 
-    public void helper(TreeNode node, int targetSum, long currSum) {
-        currSum += node.val;
-        if (targetSum == currSum) {
-            count++;
+    int dfs(TreeNode root, int t, HashMap<Long, Integer> h, Long cs) {
+        int s = 0;
+        if (root == null) {
+            return 0;
         }
-        if (node.left != null) {
-            helper(node.left, targetSum, currSum);
+        Long k = cs + root.val;
+        if (k == t) {
+            s += 1;
         }
-        if (node.right != null) {
-            helper(node.right, targetSum, currSum);
+        if (h.getOrDefault(k - t, 0) > 0) {
+            s += h.get(k - t);
         }
+        h.put(k, h.getOrDefault(k, 0) + 1);
+        s += dfs(root.left, t, h, k);
+        s += dfs(root.right, t, h, k);
+        h.put(k, h.getOrDefault(k, 0) - 1);
+        return s;
     }
 }
diff --git a/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java b/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java
@@ -3,7 +3,7 @@
 // #Medium #Top_100_Liked_Questions #String #Hash_Table #Sliding_Window
 // #Algorithm_II_Day_5_Sliding_Window #Programming_Skills_II_Day_12
 // #Level_1_Day_12_Sliding_Window/Two_Pointer #Big_O_Time_O(n+m)_Space_O(1)
-// #2022_07_16_Time_6_ms_(99.03%)_Space_47.9_MB_(50.50%)
+// #2024_11_17_Time_3_ms_(99.83%)_Space_44.7_MB_(74.83%)
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src/main/java/g0401_0500/s0494_target_sum/Solution.java b/src/main/java/g0401_0500/s0494_target_sum/Solution.java
@@ -1,37 +1,45 @@
 package g0401_0500.s0494_target_sum;
 
 // #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s))
-// #2022_07_21_Time_9_ms_(79.99%)_Space_45.2_MB_(32.79%)
+// #2024_11_17_Time_4_ms_(92.28%)_Space_42.7_MB_(57.04%)
 
 public class Solution {
-    public int findTargetSumWays(int[] nums, int s) {
-        int sum = 0;
-        s = Math.abs(s);
-        for (int num : nums) {
-            sum += num;
+    public int findTargetSumWays(int[] nums, int target) {
+        int totalSum = 0;
+        int n = nums.length;
+        for (int i = 0; i < n; i++) {
+            totalSum += nums[i];
         }
-        // Invalid s, just return 0
-        if (s > sum || (sum + s) % 2 != 0) {
+        int sum = totalSum - target;
+        if (sum < 0 || sum % 2 == 1) {
             return 0;
         }
-        int[][] dp = new int[(sum + s) / 2 + 1][nums.length + 1];
-        dp[0][0] = 1;
-        // empty knapsack must be processed specially
-        for (int i = 0; i < nums.length; i++) {
-            if (nums[i] == 0) {
-                dp[0][i + 1] = dp[0][i] * 2;
-            } else {
-                dp[0][i + 1] = dp[0][i];
-            }
+        return solve(nums, sum / 2);
+    }
+
+    private int solve(int nums[], int target) {
+        int prev[] = new int[target + 1];
+        if (nums[0] == 0) {
+            prev[0] = 2;
+        } else {
+            prev[0] = 1;
+        }
+        if (nums[0] != 0 && nums[0] <= target) {
+            prev[nums[0]] = 1;
         }
-        for (int i = 1; i < dp.length; i++) {
-            for (int j = 0; j < nums.length; j++) {
-                dp[i][j + 1] += dp[i][j];
-                if (nums[j] <= i) {
-                    dp[i][j + 1] += dp[i - nums[j]][j];
+        int n = nums.length;
+        for (int i = 1; i < n; i++) {
+            int curr[] = new int[target + 1];
+            for (int j = 0; j <= target; j++) {
+                int taken = 0;
+                if (j >= nums[i]) {
+                    taken = prev[j - nums[i]];
                 }
+                int nonTaken = prev[j];
+                curr[j] = taken + nonTaken;
             }
+            prev = curr;
         }
-        return dp[(sum + s) / 2][nums.length];
+        return prev[target];
     }
 }
diff --git a/src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java b/src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java
@@ -2,7 +2,7 @@
 
 // #Easy #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree
 // #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
-// #2022_08_02_Time_1_ms_(65.86%)_Space_43.5_MB_(33.52%)
+// #2024_11_17_Time_0_ms_(100.00%)_Space_44.5_MB_(74.23%)
 
 import com_github_leetcode.TreeNode;
 
diff --git a/src/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java b/src/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java
@@ -1,7 +1,7 @@
 package g0501_0600.s0560_subarray_sum_equals_k;
 
 // #Medium #Top_100_Liked_Questions #Array #Hash_Table #Prefix_Sum #Data_Structure_II_Day_5_Array
-// #Big_O_Time_O(n)_Space_O(n) #2022_08_03_Time_21_ms_(98.97%)_Space_46.8_MB_(88.27%)
+// #Big_O_Time_O(n)_Space_O(n) #2024_11_17_Time_22_ms_(95.17%)_Space_47.2_MB_(6.13%)
 
 import java.util.HashMap;
 import java.util.Map;
diff --git a/src/main/java/g0601_0700/s0647_palindromic_substrings/Solution.java b/src/main/java/g0601_0700/s0647_palindromic_substrings/Solution.java
@@ -1,7 +1,7 @@
 package g0601_0700.s0647_palindromic_substrings;
 
 // #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n)
-// #2022_03_21_Time_2_ms_(98.77%)_Space_41.7_MB_(75.10%)
+// #2024_11_17_Time_2_ms_(99.31%)_Space_41.4_MB_(77.04%)
 
 public class Solution {
     private void expand(char[] a, int l, int r, int[] res) {
diff --git a/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java b/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java
@@ -1,7 +1,7 @@
 package g0701_0800.s0739_daily_temperatures;
 
 // #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6
-// #Big_O_Time_O(n)_Space_O(n) #2022_03_25_Time_10_ms_(94.99%)_Space_118.3_MB_(70.21%)
+// #Big_O_Time_O(n)_Space_O(n) #2024_11_17_Time_8_ms_(96.83%)_Space_60.6_MB_(55.93%)
 
 @SuppressWarnings("java:S135")
 public class Solution {
diff --git a/src/main/java/g0701_0800/s0763_partition_labels/Solution.java b/src/main/java/g0701_0800/s0763_partition_labels/Solution.java
@@ -1,7 +1,7 @@
 package g0701_0800.s0763_partition_labels;
 
 // #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String
-// #Big_O_Time_O(n)_Space_O(1) #2022_03_26_Time_1_ms_(100.00%)_Space_40.3_MB_(98.19%)
+// #Big_O_Time_O(n)_Space_O(1) #2024_11_17_Time_2_ms_(100.00%)_Space_41.9_MB_(73.06%)
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java b/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java
@@ -3,7 +3,7 @@
 // #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
 // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19
 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m)
-// #2023_06_01_Time_33_ms_(46.23%)_Space_48.2_MB_(90.63%)
+// #2024_11_17_Time_19_ms_(89.05%)_Space_50.9_MB_(33.70%)
 
 public class Solution {
     public int longestCommonSubsequence(String text1, String text2) {
