Skip to content

Commit 103c79b

Browse files
ThanhNITThanhNIT
authored
Updated tags for tasks 112-162
1 parent 8b40e8a commit 103c79b

File tree

16 files changed

+45
-53
lines changed

16 files changed

+45
-53
lines changed

‎README.md‎

Lines changed: 20 additions & 20 deletions
Large diffs are not rendered by default.

‎src/main/java/g0101_0200/s0112_path_sum/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0101_0200.s0112_path_sum;
22

33
// #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Data_Structure_I_Day_12_Tree
4-
// #Top_Interview_150_Binary_Tree_General #2022_06_23_Time_0_ms_(100.00%)_Space_43.8_MB_(36.11%)
4+
// #Top_Interview_150_Binary_Tree_General #2025_03_06_Time_0_ms_(100.00%)_Space_43.07_MB_(76.46%)
55

66
import com_github_leetcode.TreeNode;
77

‎src/main/java/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Linked_List
44
// #Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search
5-
// #Top_Interview_150_Binary_Tree_General #2022_06_23_Time_0_ms_(100.00%)_Space_44.7_MB_(65.49%)
5+
// #Top_Interview_150_Binary_Tree_General #2025_03_06_Time_0_ms_(100.00%)_Space_44.12_MB_(80.39%)
66

77
import com_github_leetcode.left_right.Node;
88

‎src/main/java/g0101_0200/s0120_triangle/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Array #Dynamic_Programming #Algorithm_I_Day_12_Dynamic_Programming
44
// #Dynamic_Programming_I_Day_13 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP
5-
// #2022_06_23_Time_2_ms_(94.63%)_Space_44.2_MB_(36.02%)
5+
// #2025_03_06_Time_1_ms_(99.79%)_Space_44.45_MB_(35.64%)
66

77
import java.util.Arrays;
88
import java.util.List;

‎src/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_Interview_Questions #Array #Dynamic_Programming #Greedy #Dynamic_Programming_I_Day_7
44
// #Udemy_Arrays #Top_Interview_150_Array/String
5-
// #2022_06_23_Time_1_ms_(96.82%)_Space_44.7_MB_(25.11%)
5+
// #2025_03_06_Time_1_ms_(76.91%)_Space_45.72_MB_(69.34%)
66

77
public class Solution {
88
public int maxProfit(int[] prices) {

‎src/main/java/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0101_0200.s0123_best_time_to_buy_and_sell_stock_iii;
22

33
// #Hard #Array #Dynamic_Programming #Top_Interview_150_Multidimensional_DP
4-
// #2022_06_23_Time_4_ms_(87.18%)_Space_78.4_MB_(61.70%)
4+
// #2025_03_06_Time_4_ms_(74.67%)_Space_61.08_MB_(72.04%)
55

66
public class Solution {
77
public int maxProfit(int[] prices) {

‎src/main/java/g0101_0200/s0125_valid_palindrome/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0101_0200.s0125_valid_palindrome;
22

33
// #Easy #Top_Interview_Questions #String #Two_Pointers #Udemy_Two_Pointers
4-
// #Top_Interview_150_Two_Pointers #2022_06_23_Time_3_ms_(98.64%)_Space_43.2_MB_(81.23%)
4+
// #Top_Interview_150_Two_Pointers #2025_03_06_Time_2_ms_(99.11%)_Space_43.15_MB_(70.82%)
55

66
public class Solution {
77
public boolean isPalindrome(String s) {

‎src/main/java/g0101_0200/s0127_word_ladder/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Hard #Top_Interview_Questions #String #Hash_Table #Breadth_First_Search
44
// #Graph_Theory_I_Day_12_Breadth_First_Search #Top_Interview_150_Graph_BFS
5-
// #2022_06_23_Time_37_ms_(94.58%)_Space_54.1_MB_(66.08%)
5+
// #2025_03_06_Time_22_ms_(96.00%)_Space_45.97_MB_(83.68%)
66

77
import java.util.HashSet;
88
import java.util.List;

‎src/main/java/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0101_0200.s0129_sum_root_to_leaf_numbers;
22

33
// #Medium #Depth_First_Search #Tree #Binary_Tree #Top_Interview_150_Binary_Tree_General
4-
// #2022_06_23_Time_0_ms_(100.00%)_Space_41.8_MB_(46.81%)
4+
// #2025_03_06_Time_0_ms_(100.00%)_Space_41.47_MB_(30.87%)
55

66
import com_github_leetcode.TreeNode;
77

‎src/main/java/g0101_0200/s0134_gas_station/Solution.java‎

Lines changed: 11 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -1,30 +1,22 @@
11
package g0101_0200.s0134_gas_station;
22

33
// #Medium #Top_Interview_Questions #Array #Greedy #Top_Interview_150_Array/String
4-
// #2022_06_24_Time_2_ms_(94.26%)_Space_62.5_MB_(87.11%)
4+
// #2025_03_06_Time_2_ms_(97.52%)_Space_57.00_MB_(5.82%)
55

66
public class Solution {
77
public int canCompleteCircuit(int[] gas, int[] cost) {
8-
int sumGas = 0;
9-
int sumCost = 0;
10-
int curGas = 0;
11-
int result = -1;
8+
int index = 0;
9+
int total = 0;
10+
int current = 0;
1211
for (int i = 0; i < gas.length; i++) {
13-
curGas += gas[i] - cost[i];
14-
// re-calculate the starting point
15-
if (curGas < 0) {
16-
result = -1;
17-
curGas = 0;
18-
} else if (result == -1) {
19-
// set initial starting point
20-
result = i;
12+
int balance = gas[i] - cost[i];
13+
total += balance;
14+
current += balance;
15+
if (current < 0) {
16+
index = i + 1;
17+
current = 0;
2118
}
22-
sumGas += gas[i];
23-
sumCost += cost[i];
2419
}
25-
if (sumGas < sumCost) {
26-
return -1;
27-
}
28-
return result;
20+
return total >= 0 ? index : -1;
2921
}
3022
}

0 commit comments

Comments
 (0)