Skip to content

Commit 014dc9c

Browse files
authored
Updated exec time 191-200.
1 parent 3169ec9 commit 014dc9c

File tree

11 files changed

+27
-27
lines changed

11 files changed

+27
-27
lines changed

README.md

Lines changed: 17 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -269,7 +269,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
269269

270270
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
271271
|-|-|-|-|-|-
272-
| 0199 |[Binary Tree Right Side View](src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 92.96
272+
| 0199 |[Binary Tree Right Side View](src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 94.57
273273
| 0113 |[Path Sum II](src/main/java/g0101_0200/s0113_path_sum_ii/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree, Backtracking | 1 | 100.00
274274
| 0450 |[Delete Node in a BST](src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java)| Medium | Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00
275275

@@ -403,7 +403,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
403403
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
404404
|-|-|-|-|-|-
405405
| 0231 |[Power of Two](src/main/java/g0201_0300/s0231_power_of_two/Solution.java)| Easy | Math, Bit_Manipulation, Recursion | 1 | 95.76
406-
| 0191 |[Number of 1 Bits](src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation | 0 | 100.00
406+
| 0191 |[Number of 1 Bits](src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation | 1 | 84.87
407407

408408
#### Day 14 Bit Manipulation
409409

@@ -456,7 +456,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
456456

457457
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
458458
|-|-|-|-|-|-
459-
| 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 4 | 73.02
459+
| 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 97.76
460460
| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 1 | 94.56
461461

462462
#### Day 7 Breadth First Search Depth First Search
@@ -959,7 +959,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
959959

960960
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
961961
|-|-|-|-|-|-
962-
| 0191 |[Number of 1 Bits](src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation | 0 | 100.00
962+
| 0191 |[Number of 1 Bits](src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation | 1 | 84.87
963963
| 1281 |[Subtract the Product and Sum of Digits of an Integer](src/main/java/g1201_1300/s1281_subtract_the_product_and_sum_of_digits_of_an_integer/Solution.java)| Easy | Math | 0 | 100.00
964964

965965
#### Day 3 Conditional Statements
@@ -1192,7 +1192,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
11921192
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11931193
|-|-|-|-|-|-
11941194
| 0733 |[Flood Fill](src/main/java/g0701_0800/s0733_flood_fill/Solution.java)| Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 1 | 85.36
1195-
| 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 4 | 73.02
1195+
| 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 97.76
11961196

11971197
#### Day 2 Matrix Related Problems
11981198

@@ -1306,7 +1306,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
13061306
|-|-|-|-|-|-
13071307
| 1873 |[Calculate Special Bonus](src/main/java/g1801_1900/s1873_calculate_special_bonus/script.sql)| Easy | Database | 543 | 71.60
13081308
| 0627 |[Swap Salary](src/main/java/g0601_0700/s0627_swap_salary/script.sql)| Easy | Database | 191 | 96.89
1309-
| 0196 |[Delete Duplicate Emails](src/main/java/g0101_0200/s0196_delete_duplicate_emails/script.sql)| Easy | Database | 541 | 81.09
1309+
| 0196 |[Delete Duplicate Emails](src/main/java/g0101_0200/s0196_delete_duplicate_emails/script.sql)| Easy | Database | 903 | 48.10
13101310

13111311
#### Day 3 String Processing Functions
13121312

@@ -1337,7 +1337,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
13371337

13381338
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13391339
|-|-|-|-|-|-
1340-
| 0197 |[Rising Temperature](src/main/java/g0101_0200/s0197_rising_temperature/script.sql)| Easy | Database | 401 | 79.45
1340+
| 0197 |[Rising Temperature](src/main/java/g0101_0200/s0197_rising_temperature/script.sql)| Easy | Database | 342 | 93.76
13411341
| 0607 |[Sales Person](src/main/java/g0601_0700/s0607_sales_person/script.sql)| Easy | LeetCode_Curated_SQL_70, Database | 1046 | 86.04
13421342

13431343
#### Day 7 Function
@@ -1437,7 +1437,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
14371437
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
14381438
|-|-|-|-|-|-
14391439
| 0733 |[Flood Fill](src/main/java/g0701_0800/s0733_flood_fill/Solution.java)| Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 1 | 85.36
1440-
| 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 4 | 73.02
1440+
| 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 97.76
14411441

14421442
#### Day 10 Dynamic Programming
14431443

@@ -3126,16 +3126,16 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
31263126
| 0203 |[Remove Linked List Elements](src/main/java/g0201_0300/s0203_remove_linked_list_elements/Solution.java)| Easy | Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List | 1 | 90.35
31273127
| 0202 |[Happy Number](src/main/java/g0201_0300/s0202_happy_number/Solution.java)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers, Algorithm_II_Day_21_Others, Programming_Skills_I_Day_4_Loop | 1 | 93.34
31283128
| 0201 |[Bitwise AND of Numbers Range](src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.java)| Medium | Bit_Manipulation, Algorithm_II_Day_19_Bit_Manipulation | 10 | 40.99
3129-
| 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS | 4 | 73.02
3130-
| 0199 |[Binary Tree Right Side View](src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_16_Tree | 1 | 92.96
3129+
| 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS | 3 | 97.76
3130+
| 0199 |[Binary Tree Right Side View](src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_16_Tree | 1 | 94.57
31313131
| 0198 |[House Robber](src/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3 | 0 | 100.00
3132-
| 0197 |[Rising Temperature](src/main/java/g0101_0200/s0197_rising_temperature/script.sql)| Easy | Database, SQL_I_Day_6_Union | 401 | 79.45
3133-
| 0196 |[Delete Duplicate Emails](src/main/java/g0101_0200/s0196_delete_duplicate_emails/script.sql)| Easy | Database, SQL_I_Day_2_Select_and_Order | 541 | 81.09
3134-
| 0195 |[Tenth Line](src/main/java/g0101_0200/s0195_tenth_line/script.sh)| Easy | Shell | 4 | 93.33
3135-
| 0194 |[Transpose File](src/main/java/g0101_0200/s0194_transpose_file/script.sh)| Medium | Shell | 0 | 100.00
3136-
| 0193 |[Valid Phone Numbers](src/main/java/g0101_0200/s0193_valid_phone_numbers/script.sh)| Easy | Shell | 129 | 42.86
3137-
| 0192 |[Word Frequency](src/main/java/g0101_0200/s0192_word_frequency/script.sh)| Medium | Shell | 152 | 38.56
3138-
| 0191 |[Number of 1 Bits](src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Algorithm_I_Day_13_Bit_Manipulation, Programming_Skills_I_Day_2_Operator | 0 | 100.00
3132+
| 0197 |[Rising Temperature](src/main/java/g0101_0200/s0197_rising_temperature/script.sql)| Easy | Database, SQL_I_Day_6_Union | 342 | 93.76
3133+
| 0196 |[Delete Duplicate Emails](src/main/java/g0101_0200/s0196_delete_duplicate_emails/script.sql)| Easy | Database, SQL_I_Day_2_Select_and_Order | 903 | 48.10
3134+
| 0195 |[Tenth Line](src/main/java/g0101_0200/s0195_tenth_line/script.sh)| Easy | Shell | 26 | 99.36
3135+
| 0194 |[Transpose File](src/main/java/g0101_0200/s0194_transpose_file/script.sh)| Medium | Shell | 630 | 28.43
3136+
| 0193 |[Valid Phone Numbers](src/main/java/g0101_0200/s0193_valid_phone_numbers/script.sh)| Easy | Shell | 112 | 75.54
3137+
| 0192 |[Word Frequency](src/main/java/g0101_0200/s0192_word_frequency/script.sh)| Medium | Shell | 143 | 54.55
3138+
| 0191 |[Number of 1 Bits](src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Algorithm_I_Day_13_Bit_Manipulation, Programming_Skills_I_Day_2_Operator | 1 | 84.87
31393139
| 0190 |[Reverse Bits](src/main/java/g0101_0200/s0190_reverse_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer, Algorithm_I_Day_14_Bit_Manipulation | 1 | 98.66
31403140
| 0189 |[Rotate Array](src/main/java/g0101_0200/s0189_rotate_array/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Algorithm_I_Day_2_Two_Pointers | 0 | 100.00
31413141
| 0188 |[Best Time to Buy and Sell Stock IV](src/main/java/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.java)| Hard | Array, Dynamic_Programming | 1 | 100.00

src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java

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

33
// #Easy #Top_Interview_Questions #Bit_Manipulation #Algorithm_I_Day_13_Bit_Manipulation
4-
// #Programming_Skills_I_Day_2_Operator #2022_03_04_Time_0_ms_(100.00%)_Space_39_MB_(58.07%)
4+
// #Programming_Skills_I_Day_2_Operator #2022_06_28_Time_1_ms_(84.87%)_Space_41.8_MB_(10.40%)
55

66
public class Solution {
77
public int hammingWeight(int n) {
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
# Read from the file words.txt and output the word frequency list to stdout.
2-
# #Medium #Shell #2022_03_04_Time_152_ms_(38.56%)_Space_3.8_MB_(85.55%)
2+
# #Medium #Shell #2022_06_28_Time_143_ms_(54.55%)_Space_3.7_MB_(85.88%)
33
sed -e 's/ /\n/g' words.txt | sed -e '/^$/d' | sort | uniq -c | sort -r | awk '{print $2" "$1}'
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
# Read from the file file.txt and output all valid phone numbers to stdout.
2-
# #Easy #Shell #2022_03_04_Time_129_ms_(42.86%)_Space_3.2_MB_(53.31%)
2+
# #Easy #Shell #2022_06_28_Time_112_ms_(75.54%)_Space_3.1_MB_(53.89%)
33
egrep '^[0-9]{3}-[0-9]{3}-[0-9]{4}$|^\([0-9]{3}\)\s[0-9]{3}-[0-9]{4}$' file.txt

src/main/java/g0101_0200/s0194_transpose_file/script.sh

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# Read from the file file.txt and print its transposed content to stdout.
2-
# #Medium #Shell #2022_03_04_Time_0_ms_(100.00%)_Space_3.9_MB_(32.21%)
2+
# #Medium #Shell #2022_06_28_Time_630_ms_(28.43%)_Space_3.9_MB_(71.08%)
33
wordcount=$(head -1 file.txt | wc -w)
44
col_n=1
55
while [[ $col_n -le $wordcount ]]; do
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
# Read from the file file.txt and output the tenth line to stdout.
2-
# #Easy #Shell #2022_03_04_Time_4_ms_(93.33%)_Space_3.6_MB_(31.23%)
2+
# #Easy #Shell #2022_06_28_Time_26_ms_(99.36%)_Space_3.6_MB_(79.41%)
33
sed -n 10p file.txt
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
11
# Write your MySQL query statement below
2-
# #Easy #Database #SQL_I_Day_2_Select_and_Order #2022_03_04_Time_541_ms_(81.09%)_Space_0B_(100.00%)
2+
# #Easy #Database #SQL_I_Day_2_Select_and_Order #2022_06_28_Time_903_ms_(48.10%)_Space_0B_(100.00%)
33
DELETE FROM Person
44
WHERE Id NOT IN (SELECT id FROM (SELECT Email, MIN(Id) AS 'id' FROM Person GROUP BY Email) t)

src/main/java/g0101_0200/s0197_rising_temperature/script.sql

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# Write your MySQL query statement below
2-
# #Easy #Database #SQL_I_Day_6_Union #2022_03_04_Time_401_ms_(79.45%)_Space_0B_(100.00%)
2+
# #Easy #Database #SQL_I_Day_6_Union #2022_06_28_Time_342_ms_(93.76%)_Space_0B_(100.00%)
33
SELECT SecondDate.id as Id
44
FROM Weather SecondDate JOIN Weather FirstDate
55
ON ADDDATE(FirstDate.recordDate,1) = SecondDate.recordDate

src/main/java/g0101_0200/s0198_house_robber/Solution.java

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
44
// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
5-
// #2022_03_04_Time_0_ms_(100.00%)_Space_42_MB_(11.54%)
5+
// #2022_06_28_Time_0_ms_(100.00%)_Space_39.9_MB_(85.30%)
66

77
public class Solution {
88
public int rob(int[] nums) {

src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java

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

33
// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
4-
// #Data_Structure_II_Day_16_Tree #2022_03_04_Time_1_ms_(92.96%)_Space_43.2_MB_(6.01%)
4+
// #Data_Structure_II_Day_16_Tree #2022_06_28_Time_1_ms_(94.57%)_Space_42.9_MB_(41.09%)
55

66
import com_github_leetcode.TreeNode;
77
import java.util.ArrayList;

src/main/java/g0101_0200/s0200_number_of_islands/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
// #Breadth_First_Search #Matrix #Union_Find
55
// #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search
66
// #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS
7-
// #2022_03_04_Time_4_ms_(73.02%)_Space_57.7_MB_(19.10%)
7+
// #2022_06_28_Time_3_ms_(97.76%)_Space_57.5_MB_(41.23%)
88

99
public class Solution {
1010
public int numIslands(char[][] grid) {

0 commit comments

Comments
 (0)