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

Commite9e41b1

Browse files
authored
Improved tasks 11, 31, 34, 35, 41, 45, 46, 53, 295
1 parent2c657aa commite9e41b1

File tree

10 files changed

+32
-34
lines changed

10 files changed

+32
-34
lines changed

‎LeetCodeNet/G0001_0100/S0011_container_with_most_water/Solution.cs

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -2,14 +2,13 @@ namespace LeetCodeNet.G0001_0100.S0011_container_with_most_water {
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
44
// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
5-
// #2023_12_26_Time_248_ms_(11.15%)_Space_62.1_MB_(5.59%)
5+
// #2024_01_11_Time_251_ms_(30.70%)_Space_61.5_MB_(26.65%)
66

77
publicclassSolution{
88
publicintMaxArea(int[]height){
99
intmaxArea=-1;
1010
intleft=0;
1111
intright=height.Length-1;
12-
1312
while(left<right){
1413
if(height[left]<height[right]){
1514
maxArea=Math.Max(maxArea,height[left]*(right-left));
@@ -19,7 +18,6 @@ public int MaxArea(int[] height) {
1918
right--;
2019
}
2120
}
22-
2321
returnmaxArea;
2422
}
2523
}

‎LeetCodeNet/G0001_0100/S0031_next_permutation/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespaceLeetCodeNet.G0001_0100.S0031_next_permutation{
22

33
// #Medium #Top_100_Liked_Questions #Array #Two_Pointers #Big_O_Time_O(n)_Space_O(1)
4-
// #2023_12_28_Time_202_ms_(5.19%)_Space_46.2_MB_(5.39%)
4+
// #2024_01_11_Time_98_ms_(94.17%)_Space_46_MB_(24.35%)
55

66
publicclassSolution{
77
publicvoidNextPermutation(int[]nums){

‎LeetCodeNet/G0001_0100/S0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0034_find_first_and_last_position_of_element_i
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
44
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1)
5-
// #2023_12_28_Time_171_ms_(5.87%)_Space_48.4_MB_(5.63%)
5+
// #2024_01_11_Time_120_ms_(81.66%)_Space_48.8_MB_(8.72%)
66

77
publicclassSolution{
88
publicint[]SearchRange(int[]nums,inttarget){

‎LeetCodeNet/G0001_0100/S0035_search_insert_position/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0035_search_insert_position {
22

33
// #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
44
// #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1)
5-
// #2023_12_28_Time_106_ms_(6.17%)_Space_42_MB_(5.47%)
5+
// #2024_01_11_Time_64_ms_(95.18%)_Space_41.4_MB_(28.65%)
66

77
publicclassSolution{
88
publicintSearchInsert(int[]nums,inttarget){

‎LeetCodeNet/G0001_0100/S0041_first_missing_positive/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespaceLeetCodeNet.G0001_0100.S0041_first_missing_positive{
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Udemy_Arrays
4-
// #Big_O_Time_O(n)_Space_O(n) #2023_12_28_Time_192_ms_(13.98%)_Space_57.8_MB_(13.98%)
4+
// #Big_O_Time_O(n)_Space_O(n) #2024_01_11_Time_178_ms_(36.64%)_Space_57.6_MB_(32.67%)
55

66
publicclassSolution{
77
publicintFirstMissingPositive(int[]nums){

‎LeetCodeNet/G0001_0100/S0045_jump_game_ii/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0045_jump_game_ii {
22

33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Greedy
44
// #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_4
5-
// #Big_O_Time_O(n)_Space_O(1) #2023_12_28_Time_144_ms_(15.35%)_Space_44_MB_(16.51%)
5+
// #Big_O_Time_O(n)_Space_O(1) #2024_01_11_Time_85_ms_(88.80%)_Space_44.1_MB_(33.81%)
66

77
publicclassSolution{
88
publicintJump(int[]nums){

‎LeetCodeNet/G0001_0100/S0046_permutations/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0046_permutations {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Backtracking
44
// #Algorithm_I_Day_11_Recursion_Backtracking #Level_2_Day_20_Brute_Force/Backtracking
55
// #Udemy_Backtracking/Recursion #Big_O_Time_O(n*n!)_Space_O(n+n!)
6-
// #2023_12_28_Time_148_ms_(5.56%)_Space_45.8_MB_(8.50%)
6+
// #2024_01_11_Time_96_ms_(96.56%)_Space_46.4_MB_(12.40%)
77

88
usingSystem.Collections.Generic;
99

‎LeetCodeNet/G0001_0100/S0053_maximum_subarray/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0053_maximum_subarray {
33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
44
// #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5
55
// #Udemy_Famous_Algorithm #Big_O_Time_O(n)_Space_O(1)
6-
// #2024_01_04_Time_276_ms_(20.05%)_Space_62.4_MB_(8.46%)
6+
// #2024_01_11_Time_270_ms_(38.35%)_Space_62.7_MB_(7.88%)
77

88
publicclassSolution{
99
publicintMaxSubArray(int[]nums){

‎LeetCodeNet/G0201_0300/S0295_find_median_from_data_stream/MedianFinder.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0201_0300.S0295_find_median_from_data_stream {
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Design
44
// #Heap_Priority_Queue #Data_Stream #Big_O_Time_O(n*log_n)_Space_O(n)
5-
// #2024_01_07_Time_642_ms_(21.62%)_Space_142.7_MB_(6.39%)
5+
// #2024_01_11_Time_658_ms_(24.88%)_Space_144_MB_(5.64%)
66

77
usingSystem;
88
usingSystem.Collections.Generic;

‎README.md

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

0 commit comments

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