Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit8bb3aaa

Browse files
committed
Updated tags for tasks 224-918
1 parent489dbd1 commit8bb3aaa

File tree

17 files changed

+130
-68
lines changed

17 files changed

+130
-68
lines changed

‎README.md

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

‎src/main/java/g0201_0300/s0224_basic_calculator/Solution.java

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

33
// #Hard #String #Math #Stack #Recursion #Top_Interview_150_Stack
4-
// #2022_07_04_Time_3_ms_(98.92%)_Space_44.6_MB_(43.19%)
4+
// #2025_03_09_Time_2_ms_(96.52%)_Space_45.07_MB_(23.63%)
55

66
publicclassSolution {
77
privateinti =0;

‎src/main/java/g0201_0300/s0228_summary_ranges/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
packageg0201_0300.s0228_summary_ranges;
22

3-
// #Easy #Array #Top_Interview_150_Intervals #2022_07_04_Time_0_ms_(100.00%)_Space_42.7_MB_(15.43%)
3+
// #Easy #Array #Top_Interview_150_Intervals #2025_03_09_Time_0_ms_(100.00%)_Space_41.53_MB_(90.54%)
44

55
importjava.util.ArrayList;
66
importjava.util.List;

‎src/main/java/g0201_0300/s0242_valid_anagram/Solution.java

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

33
// #Easy #String #Hash_Table #Sorting #Data_Structure_I_Day_6_String
44
// #Programming_Skills_I_Day_11_Containers_and_Libraries #Udemy_Strings #Top_Interview_150_Hashmap
5-
// #2022_07_05_Time_2_ms_(99.01%)_Space_42.4_MB_(91.86%)
5+
// #2025_03_09_Time_2_ms_(97.76%)_Space_43.41_MB_(66.14%)
66

77
publicclassSolution {
88
publicbooleanisAnagram(Strings,Stringt) {

‎src/main/java/g0201_0300/s0289_game_of_life/Solution.java

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

33
// #Medium #Array #Matrix #Simulation #Top_Interview_150_Matrix
4-
// #2022_07_06_Time_0_ms_(100.00%)_Space_42.9_MB_(10.73%)
4+
// #2025_03_09_Time_0_ms_(100.00%)_Space_41.90_MB_(24.53%)
55

66
publicclassSolution {
77
publicvoidgameOfLife(int[][]board) {

‎src/main/java/g0201_0300/s0290_word_pattern/Solution.java

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

33
// #Easy #String #Hash_Table #Data_Structure_II_Day_7_String #Top_Interview_150_Hashmap
4-
// #2022_07_06_Time_1_ms_(97.26%)_Space_40.4_MB_(85.78%)
4+
// #2025_03_09_Time_0_ms_(100.00%)_Space_41.27_MB_(92.07%)
55

66
importjava.util.HashMap;
77
importjava.util.Map;
Lines changed: 92 additions & 30 deletions
Original file line numberDiff line numberDiff line change
@@ -1,42 +1,104 @@
11
packageg0301_0400.s0373_find_k_pairs_with_smallest_sums;
22

33
// #Medium #Array #Heap_Priority_Queue #Top_Interview_150_Heap
4-
// #2022_07_12_Time_59_ms_(46.79%)_Space_120.7_MB_(83.25%)
4+
// #2025_03_09_Time_0_ms_(100.00%)_Space_57.66_MB_(90.88%)
55

6+
importjava.util.AbstractList;
67
importjava.util.ArrayList;
8+
importjava.util.Arrays;
79
importjava.util.List;
8-
importjava.util.PriorityQueue;
910

1011
publicclassSolution {
11-
privatestaticclassNode {
12-
longsum;
13-
List<Integer>al;
14-
intindex;
15-
16-
Node(intindex,intnum1,intnum2) {
17-
this.sum = (long)num1 + (long)num2;
18-
this.al =newArrayList<>();
19-
this.al.add(num1);
20-
this.al.add(num2);
21-
this.index =index;
22-
}
23-
}
24-
2512
publicList<List<Integer>>kSmallestPairs(int[]nums1,int[]nums2,intk) {
26-
PriorityQueue<Node>queue =newPriorityQueue<>((a,b) ->a.sum <b.sum ? -1 :1);
27-
List<List<Integer>>res =newArrayList<>();
28-
for (inti =0;i <nums1.length &&i <k;i++) {
29-
queue.add(newNode(0,nums1[i],nums2[0]));
30-
}
31-
for (inti =1;i <=k && !queue.isEmpty();i++) {
32-
Nodecur =queue.poll();
33-
res.add(cur.al);
34-
intnext =cur.index;
35-
intlastNum1 =cur.al.get(0);
36-
if (next +1 <nums2.length) {
37-
queue.add(newNode(next +1,lastNum1,nums2[next +1]));
13+
returnnewAbstractList<List<Integer>>() {
14+
privateList<List<Integer>>pairs;
15+
16+
@Override
17+
publicList<Integer>get(intindex) {
18+
init();
19+
returnpairs.get(index);
20+
}
21+
22+
@Override
23+
publicintsize() {
24+
init();
25+
returnpairs.size();
26+
}
27+
28+
privatevoidload() {
29+
intn =nums1.length;
30+
intm =nums2.length;
31+
intleft =nums1[0] +nums2[0];
32+
intright =nums1[n -1] +nums2[m -1];
33+
intmiddle;
34+
35+
while (left <=right) {
36+
middle = (left +right) /2;
37+
longcount =getCount(nums1,nums2,middle,k);
38+
if (count <k) {
39+
left =middle +1;
40+
}elseif (count >k) {
41+
right =middle -1;
42+
}else {
43+
left =middle;
44+
break;
45+
}
46+
}
47+
getPairs(nums1,nums2,left,k);
48+
}
49+
50+
privatelonggetCount(int[]nums1,int[]nums2,intgoal,intk) {
51+
intprevRight =nums2.length -1;
52+
intcount =0;
53+
54+
for (inti =0;i <nums1.length &&nums1[i] +nums2[0] <=goal;i++) {
55+
intleft =0;
56+
intright =prevRight;
57+
intposition = -1;
58+
while (left <=right) {
59+
intmiddle = (right +left) /2;
60+
intsum =nums1[i] +nums2[middle];
61+
if (sum <=goal) {
62+
position =middle;
63+
left =middle +1;
64+
}else {
65+
right =middle -1;
66+
}
67+
}
68+
if (position >=0) {
69+
count +=position +1;
70+
prevRight =position;
71+
}
72+
if (count >k) {
73+
returncount;
74+
}
75+
}
76+
returncount;
77+
}
78+
79+
privatevoidgetPairs(int[]nums1,int[]nums2,intsum,intk) {
80+
pairs =newArrayList<>();
81+
for (intitem :nums1) {
82+
for (intj =0;j <nums2.length &&item +nums2[j] <sum;j++) {
83+
pairs.add(Arrays.asList(item,nums2[j]));
84+
}
85+
}
86+
for (intvalue :nums1) {
87+
for (intj =0;
88+
j <nums2.length &&value +nums2[j] <=sum &&pairs.size() <k;
89+
j++) {
90+
if (value +nums2[j] ==sum) {
91+
pairs.add(Arrays.asList(value,nums2[j]));
92+
}
93+
}
94+
}
95+
}
96+
97+
publicvoidinit() {
98+
if (null ==pairs) {
99+
load();
100+
}
38101
}
39-
}
40-
returnres;
102+
};
41103
}
42104
}

‎src/main/java/g0301_0400/s0383_ransom_note/Solution.java

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

33
// #Easy #String #Hash_Table #Counting #Data_Structure_I_Day_6_String #Top_Interview_150_Hashmap
4-
// #2022_07_13_Time_1_ms_(99.97%)_Space_46_MB_(62.86%)
4+
// #2025_03_09_Time_1_ms_(99.10%)_Space_44.62_MB_(86.13%)
55

66
publicclassSolution {
77
publicbooleancanConstruct(StringransomNote,Stringmagazine) {

‎src/main/java/g0301_0400/s0392_is_subsequence/Solution.java

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

33
// #Easy #String #Dynamic_Programming #Two_Pointers #Dynamic_Programming_I_Day_19
44
// #Level_1_Day_2_String #Udemy_Two_Pointers #Top_Interview_150_Two_Pointers
5-
// #2022_07_13_Time_1_ms_(93.01%)_Space_42.2_MB_(32.57%)
5+
// #2025_03_09_Time_1_ms_(93.13%)_Space_41.65_MB_(37.86%)
66

77
publicclassSolution {
88
publicbooleanisSubsequence(Strings,Stringt) {

‎src/main/java/g0401_0500/s0427_construct_quad_tree/Solution.java

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

33
// #Medium #Array #Tree #Matrix #Divide_and_Conquer #Top_Interview_150_Divide_and_Conquer
4-
// #2022_07_16_Time_0_ms_(100.00%)_Space_42.6_MB_(89.45%)
4+
// #2025_03_09_Time_0_ms_(100.00%)_Space_44.55_MB_(62.63%)
55

66
/*
77
// Definition for a QuadTree node.

‎src/main/java/g0401_0500/s0433_minimum_genetic_mutation/Solution.java

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

33
// #Medium #String #Hash_Table #Breadth_First_Search #Graph_Theory_I_Day_12_Breadth_First_Search
4-
// #Top_Interview_150_Graph_BFS #2022_07_16_Time_1_ms_(90.95%)_Space_41.9_MB_(56.72%)
4+
// #Top_Interview_150_Graph_BFS #2025_03_09_Time_0_ms_(100.00%)_Space_41.65_MB_(47.68%)
55

66
importjava.util.ArrayList;
77
importjava.util.HashSet;

‎src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.java

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

33
// #Medium #Array #Sorting #Greedy #Top_Interview_150_Intervals
4-
// #2022_07_18_Time_84_ms_(71.26%)_Space_100.7_MB_(21.68%)
4+
// #2025_03_09_Time_52_ms_(89.91%)_Space_68.86_MB_(77.92%)
55

66
importjava.util.Arrays;
77

‎src/main/java/g0501_0600/s0502_ipo/Solution.java

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

33
// #Hard #Array #Sorting #Greedy #Heap_Priority_Queue #Top_Interview_150_Heap
4-
// #2022_07_24_Time_51_ms_(89.62%)_Space_101.7_MB_(47.03%)
4+
// #2025_03_09_Time_64_ms_(97.22%)_Space_59.96_MB_(87.77%)
55

66
importjava.util.Comparator;
77
importjava.util.PriorityQueue;

‎src/main/java/g0501_0600/s0530_minimum_absolute_difference_in_bst/Solution.java

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

33
// #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
4-
// #Top_Interview_150_Binary_Search_Tree #2022_07_28_Time_1_ms_(92.05%)_Space_45_MB_(70.03%)
4+
// #Top_Interview_150_Binary_Search_Tree #2025_03_09_Time_0_ms_(100.00%)_Space_44.75_MB_(31.94%)
55

66
importcom_github_leetcode.TreeNode;
77

‎src/main/java/g0601_0700/s0637_average_of_levels_in_binary_tree/Solution.java

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

33
// #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
4-
// #Top_Interview_150_Binary_Tree_BFS #2022_03_21_Time_2_ms_(89.32%)_Space_44.7_MB_(77.73%)
4+
// #Top_Interview_150_Binary_Tree_BFS #2025_03_09_Time_2_ms_(94.34%)_Space_45.93_MB_(25.94%)
55

66
importcom_github_leetcode.TreeNode;
77
importjava.util.ArrayList;

‎src/main/java/g0901_1000/s0909_snakes_and_ladders/Solution.java

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

33
// #Medium #Array #Breadth_First_Search #Matrix #Top_Interview_150_Graph_BFS
4-
// #2022_03_28_Time_7_ms_(79.52%)_Space_47.7_MB_(58.43%)
4+
// #2025_03_09_Time_4_ms_(95.81%)_Space_43.82_MB_(99.52%)
55

66
importjava.util.LinkedList;
77
importjava.util.Queue;

‎src/main/java/g0901_1000/s0918_maximum_sum_circular_subarray/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 #Divide_and_Conquer #Queue #Monotonic_Queue
44
// #Dynamic_Programming_I_Day_5 #Top_Interview_150_Kadane's_Algorithm
5-
// #2022_03_29_Time_3_ms_(92.86%)_Space_64.3_MB_(40.27%)
5+
// #2025_03_09_Time_2_ms_(99.34%)_Space_49.52_MB_(29.39%)
66

77
publicclassSolution {
88
privateintkadane(int[]nums,intsign) {

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp