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

Commitb42ff1e

Browse files
authored
Added tasks 31-46
1 parentc621cfb commitb42ff1e

File tree

31 files changed

+978
-0
lines changed

31 files changed

+978
-0
lines changed
Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
namespaceLeetCodeNet.G0001_0100.S0031_next_permutation{
2+
3+
usingXunit;
4+
5+
publicclassSolutionTest{
6+
[Fact]
7+
publicvoidNextPermutation(){
8+
int[]array=newint[]{1,2,3};
9+
newSolution().NextPermutation(array);
10+
Assert.Equal(newint[]{1,3,2},array);
11+
}
12+
13+
[Fact]
14+
publicvoidNextPermutation2(){
15+
int[]array=newint[]{3,2,1};
16+
newSolution().NextPermutation(array);
17+
Assert.Equal(newint[]{1,2,3},array);
18+
}
19+
20+
[Fact]
21+
publicvoidNextPermutation3(){
22+
int[]array=newint[]{1,1,5};
23+
newSolution().NextPermutation(array);
24+
Assert.Equal(newint[]{1,5,1},array);
25+
}
26+
}
27+
}
Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
namespaceLeetCodeNet.G0001_0100.S0032_longest_valid_parentheses{
2+
3+
usingXunit;
4+
5+
publicclassSolutionTest{
6+
[Fact]
7+
publicvoidLongestValidParentheses(){
8+
Assert.Equal(2,newSolution().LongestValidParentheses("(()"));
9+
}
10+
11+
[Fact]
12+
publicvoidLongestValidParentheses2(){
13+
Assert.Equal(4,newSolution().LongestValidParentheses(")()())"));
14+
}
15+
16+
[Fact]
17+
publicvoidLongestValidParentheses3(){
18+
Assert.Equal(0,newSolution().LongestValidParentheses(""));
19+
}
20+
}
21+
}
Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
namespaceLeetCodeNet.G0001_0100.S0033_search_in_rotated_sorted_array{
2+
3+
usingXunit;
4+
5+
publicclassSolutionTest{
6+
[Fact]
7+
publicvoidSearch(){
8+
Assert.Equal(4,newSolution().Search(newint[]{4,5,6,7,0,1,2},0));
9+
}
10+
11+
[Fact]
12+
publicvoidSearch2(){
13+
Assert.Equal(-1,newSolution().Search(newint[]{4,5,6,7,0,1,2},3));
14+
}
15+
16+
[Fact]
17+
publicvoidSearch3(){
18+
Assert.Equal(-1,newSolution().Search(newint[]{1},0));
19+
}
20+
}
21+
}
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
namespaceLeetCodeNet.G0001_0100.S0034_find_first_and_last_position_of_element_in_sorted_array{
2+
3+
usingXunit;
4+
5+
publicclassSolutionTest{
6+
[Fact]
7+
publicvoidSearchRange(){
8+
int[]expected=newint[]{3,4};
9+
int[]actual=newSolution().SearchRange(newint[]{5,7,7,8,8,10},8);
10+
Assert.Equal(expected,actual);
11+
}
12+
13+
[Fact]
14+
publicvoidSearchRange2(){
15+
int[]expected=newint[]{-1,-1};
16+
int[]actual=newSolution().SearchRange(newint[]{5,7,7,8,8,10},6);
17+
Assert.Equal(expected,actual);
18+
}
19+
20+
[Fact]
21+
publicvoidSearchRange3(){
22+
int[]expected=newint[]{-1,-1};
23+
int[]actual=newSolution().SearchRange(newint[]{},0);
24+
Assert.Equal(expected,actual);
25+
}
26+
}
27+
}
Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
namespaceLeetCodeNet.G0001_0100.S0035_search_insert_position{
2+
3+
usingXunit;
4+
5+
publicclassSolutionTest{
6+
[Fact]
7+
publicvoidSearchInsert(){
8+
Assert.Equal(2,newSolution().SearchInsert(newint[]{1,3,5,6},5));
9+
}
10+
11+
[Fact]
12+
publicvoidSearchInsert2(){
13+
Assert.Equal(1,newSolution().SearchInsert(newint[]{1,3,5,6},2));
14+
}
15+
16+
[Fact]
17+
publicvoidSearchInsert3(){
18+
Assert.Equal(4,newSolution().SearchInsert(newint[]{1,3,5,6},7));
19+
}
20+
}
21+
}
Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
namespaceLeetCodeNet.G0001_0100.S0039_combination_sum{
2+
3+
usingXunit;
4+
usingSystem.Collections.Generic;
5+
usingSystem.Linq;
6+
7+
publicclassSolutionTest{
8+
[Fact]
9+
publicvoidCombinationSum(){
10+
varexpected=newList<List<int>>{newList<int>{7},newList<int>{3,2,2}};
11+
varactual=newSolution().CombinationSum(newint[]{2,3,6,7},7);
12+
Assert.True(CompareLists(expected,actual));
13+
}
14+
15+
[Fact]
16+
publicvoidCombinationSum2(){
17+
varexpected=newList<List<int>>{newList<int>{5,3},newList<int>{3,3,2},newList<int>{2,2,2,2}};
18+
varactual=newSolution().CombinationSum(newint[]{2,3,5},8);
19+
Assert.True(CompareLists(expected,actual));
20+
}
21+
22+
[Fact]
23+
publicvoidCombinationSum3(){
24+
varexpected=newList<List<int>>{};
25+
varactual=newSolution().CombinationSum(newint[]{2},1);
26+
Assert.True(CompareLists(expected,actual));
27+
}
28+
29+
privateboolCompareLists(List<List<int>>list1,IList<IList<int>>list2){
30+
if(list1.Count!=list2.Count)returnfalse;
31+
for(inti=0;i<list1.Count;i++){
32+
if(!list1[i].SequenceEqual(list2[i]))returnfalse;
33+
}
34+
returntrue;
35+
}
36+
}
37+
}
Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
namespaceLeetCodeNet.G0001_0100.S0041_first_missing_positive{
2+
3+
usingXunit;
4+
5+
publicclassSolutionTest{
6+
[Fact]
7+
publicvoidFirstMissingPositive(){
8+
Assert.Equal(3,newSolution().FirstMissingPositive(newint[]{1,2,0}));
9+
}
10+
11+
[Fact]
12+
publicvoidFirstMissingPositive2(){
13+
Assert.Equal(2,newSolution().FirstMissingPositive(newint[]{3,4,-1,1}));
14+
}
15+
16+
[Fact]
17+
publicvoidFirstMissingPositive3(){
18+
Assert.Equal(1,newSolution().FirstMissingPositive(newint[]{7,8,9,11,12}));
19+
}
20+
}
21+
}
Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
namespaceLeetCodeNet.G0001_0100.S0042_trapping_rain_water{
2+
3+
usingXunit;
4+
5+
publicclassSolutionTest{
6+
[Fact]
7+
publicvoidTrap(){
8+
Assert.Equal(6,newSolution().Trap(newint[]{0,1,0,2,1,0,1,3,2,1,2,1}));
9+
}
10+
11+
[Fact]
12+
publicvoidTrap2(){
13+
Assert.Equal(9,newSolution().Trap(newint[]{4,2,0,3,2,5}));
14+
}
15+
}
16+
}
Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
namespaceLeetCodeNet.G0001_0100.S0045_jump_game_ii{
2+
3+
usingXunit;
4+
5+
publicclassSolutionTest{
6+
[Fact]
7+
publicvoidJump(){
8+
Assert.Equal(2,newSolution().Jump(newint[]{2,3,1,1,4}));
9+
}
10+
11+
[Fact]
12+
publicvoidJump2(){
13+
Assert.Equal(2,newSolution().Jump(newint[]{2,3,0,1,4}));
14+
}
15+
}
16+
}
Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
namespaceLeetCodeNet.G0001_0100.S0046_permutations{
2+
3+
usingXunit;
4+
usingSystem.Collections.Generic;
5+
usingSystem.Linq;
6+
7+
publicclassSolutionTest{
8+
[Fact]
9+
publicvoidPermute(){
10+
varexpected=newList<List<int>>{newList<int>{1,2,3},newList<int>{1,3,2},
11+
newList<int>{2,1,3},newList<int>{2,3,1},newList<int>{3,1,2},newList<int>{3,2,1}};
12+
varactual=newSolution().Permute(newint[]{1,2,3});
13+
Assert.True(CompareLists(expected,actual));
14+
}
15+
16+
[Fact]
17+
publicvoidPermute2(){
18+
varexpected=newList<List<int>>{newList<int>{0,1},newList<int>{1,0}};
19+
varactual=newSolution().Permute(newint[]{0,1});
20+
Assert.True(CompareLists(expected,actual));
21+
}
22+
23+
[Fact]
24+
publicvoidPermute3(){
25+
varexpected=newList<List<int>>{newList<int>{1}};
26+
varactual=newSolution().Permute(newint[]{1});
27+
Assert.True(CompareLists(expected,actual));
28+
}
29+
30+
privateboolCompareLists(List<List<int>>list1,IList<IList<int>>list2){
31+
if(list1.Count!=list2.Count)returnfalse;
32+
for(inti=0;i<list1.Count;i++){
33+
if(!list1[i].SequenceEqual(list2[i]))returnfalse;
34+
}
35+
returntrue;
36+
}
37+
}
38+
}
Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
namespaceLeetCodeNet.G0001_0100.S0031_next_permutation{
2+
3+
// #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%)
5+
6+
publicclassSolution{
7+
publicvoidNextPermutation(int[]nums){
8+
if(nums==null||nums.Length<=1){
9+
return;
10+
}
11+
inti=nums.Length-2;
12+
while(i>=0&&nums[i]>=nums[i+1]){
13+
i--;
14+
}
15+
if(i>=0){
16+
intj=nums.Length-1;
17+
while(nums[j]<=nums[i]){
18+
j--;
19+
}
20+
Swap(nums,i,j);
21+
}
22+
Reverse(nums,i+1,nums.Length-1);
23+
}
24+
25+
privatevoidSwap(int[]nums,inti,intj){
26+
inttemp=nums[i];
27+
nums[i]=nums[j];
28+
nums[j]=temp;
29+
}
30+
31+
privatevoidReverse(int[]nums,inti,intj){
32+
while(i<j){
33+
Swap(nums,i++,j--);
34+
}
35+
}
36+
}
37+
}
Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
31\. Next Permutation
2+
3+
Medium
4+
5+
Implement**next permutation**, which rearranges numbers into the lexicographically next greater permutation of numbers.
6+
7+
If such an arrangement is not possible, it must rearrange it as the lowest possible order (i.e., sorted in ascending order).
8+
9+
The replacement must be**[in place](http://en.wikipedia.org/wiki/In-place_algorithm)** and use only constant extra memory.
10+
11+
**Example 1:**
12+
13+
**Input:** nums =[1,2,3]
14+
15+
**Output:**[1,3,2]
16+
17+
**Example 2:**
18+
19+
**Input:** nums =[3,2,1]
20+
21+
**Output:**[1,2,3]
22+
23+
**Example 3:**
24+
25+
**Input:** nums =[1,1,5]
26+
27+
**Output:**[1,5,1]
28+
29+
**Example 4:**
30+
31+
**Input:** nums =[1]
32+
33+
**Output:**[1]
34+
35+
**Constraints:**
36+
37+
*`1 <= nums.length <= 100`
38+
*`0 <= nums[i] <= 100`
Lines changed: 48 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,48 @@
1+
namespaceLeetCodeNet.G0001_0100.S0032_longest_valid_parentheses{
2+
3+
// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming #Stack #Big_O_Time_O(n)_Space_O(1)
4+
// #2023_12_28_Time_49_ms_(96.18%)_Space_38.5_MB_(13.54%)
5+
6+
publicclassSolution{
7+
publicintLongestValidParentheses(strings){
8+
intmax=0;
9+
intleft=0;
10+
intright=0;
11+
intn=s.Length;
12+
charch;
13+
for(inti=0;i<n;i++){
14+
ch=s[i];
15+
if(ch=='('){
16+
left++;
17+
}else{
18+
right++;
19+
}
20+
if(right>left){
21+
left=0;
22+
right=0;
23+
}
24+
if(left==right){
25+
max=Math.Max(max,2*right);
26+
}
27+
}
28+
left=0;
29+
right=0;
30+
for(inti=n-1;i>=0;i--){
31+
ch=s[i];
32+
if(ch=='('){
33+
left++;
34+
}else{
35+
right++;
36+
}
37+
if(left>right){
38+
left=0;
39+
right=0;
40+
}
41+
if(left==right){
42+
max=Math.Max(max,2*left);
43+
}
44+
}
45+
returnmax;
46+
}
47+
}
48+
}

0 commit comments

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