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

Commit65dc280

Browse files
committed
add new files
1 parent80a0222 commit65dc280

6 files changed

+118
-0
lines changed

‎66. Plus One.go

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
package main
2+
3+
funcplusOne(digits []int) []int {
4+
5+
l:=len(digits)
6+
fori:=l-1;i>=0;i-- {
7+
ifdigits[i]<9 {
8+
digits[i]++
9+
returndigits
10+
}
11+
digits[i]=0
12+
}
13+
//如果有进位
14+
res:= []int{1}
15+
res=append(res,digits...)
16+
returnres
17+
}

‎70. Climbing Stairs.go

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
package main
2+
3+
//DP
4+
funcclimbStairs(nint)int {
5+
ifn<2 {
6+
return1
7+
}
8+
tmp:= []int{1,2}
9+
fori:=2;i<n;i++ {
10+
tmp=append(tmp,tmp[i-1]+tmp[i-2])
11+
}
12+
returntmp[n-1]
13+
}

‎77. Combinations.go

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
package main
2+
3+
funccombine(nint,kint) [][]int {
4+
varres [][]int
5+
helper(&res, []int{},1,n,k)
6+
returnres
7+
}
8+
9+
funchelper(res*[][]int,coms []int,startint,nint,kint) {
10+
ifk==0 {
11+
tmp:= []int{}
12+
tmp=append(tmp,coms...)
13+
*res=append(*res,tmp)
14+
return
15+
}
16+
fori:=start;i<=n;i++ {
17+
coms=append(coms,i)
18+
helper(res,coms,i+1,n,k-1)
19+
coms=coms[:len(coms)-1]
20+
}
21+
}
Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
package main
2+
3+
typeListNodestruct {
4+
Valint
5+
Next*ListNode
6+
}
7+
8+
funcdeleteDuplicates(head*ListNode)*ListNode {
9+
cur:=head
10+
forcur!=nil&&cur.Next!=nil {
11+
ifcur.Next.Val==cur.Val {
12+
cur.Next=cur.Next.Next
13+
}else {
14+
cur=cur.Next
15+
}
16+
}
17+
returnhead
18+
}

‎86. Partition List.go

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
package main
2+
3+
typeListNodestruct {
4+
Valint
5+
Next*ListNode
6+
}
7+
8+
//新建两个列表
9+
funcpartition(head*ListNode,xint)*ListNode {
10+
11+
beforehead:=&ListNode{}
12+
before:=beforehead
13+
afterhead:=&ListNode{}
14+
after:=afterhead
15+
forhead!=nil {
16+
ifhead.Val<x {
17+
before.Next=head
18+
before=before.Next
19+
}else {
20+
after.Next=head
21+
after=after.Next
22+
}
23+
head=head.Next
24+
}
25+
after.Next=nil
26+
before.Next=afterhead.Next
27+
returnbeforehead.Next
28+
}

‎88. Merge Sorted Array.go

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
package main
2+
3+
funcmerge(nums1 []int,mint,nums2 []int,nint) {
4+
form>0||n>0 {
5+
ifn==0 {
6+
break
7+
}
8+
ifm==0 {
9+
nums1[n-1]=nums2[n-1]
10+
n--
11+
continue
12+
}
13+
ifnums1[m-1]>nums2[n-1] {
14+
nums1[m+n-1]=nums1[m-1]
15+
m--
16+
}else {
17+
nums1[m+n-1]=nums2[n-1]
18+
n--
19+
}
20+
}
21+
}

0 commit comments

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