Skip to content

Commit 6607e10

Browse files
author
hero
committed
添加单向链表操作
1 parent f404b50 commit 6607e10

File tree

2 files changed

+66
-0
lines changed

2 files changed

+66
-0
lines changed

leet_code/add-two-numbers_test.go

Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
package leet_code
2+
3+
import (
4+
"testing"
5+
)
6+
7+
func TestAddTwoNumbers(t *testing.T) {
8+
t.Log(addTwoNumbers(&ListNode{
9+
Val: 2,
10+
Next: &ListNode{
11+
Val: 4,
12+
Next: &ListNode{
13+
Val: 3,
14+
Next: nil,
15+
},
16+
},
17+
}, &ListNode{
18+
Val: 5,
19+
Next: &ListNode{
20+
Val: 6,
21+
Next: &ListNode{
22+
Val: 4,
23+
Next: nil,
24+
},
25+
},
26+
}))
27+
}
28+
29+
type ListNode struct {
30+
Val int
31+
Next *ListNode
32+
}
33+
34+
//两数相加
35+
func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
36+
var data = new(ListNode)
37+
return data
38+
}

leet_code/two-sum_test.go

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
package leet_code
2+
3+
import (
4+
"testing"
5+
)
6+
7+
func TestTwoSum(t *testing.T) {
8+
t.Log(twoSum([]int{2, 7, 11, 15}, 6))
9+
}
10+
11+
//两数相和
12+
func twoSum(nums []int, target int) []int {
13+
var data []int
14+
var endFor = false
15+
for index, val := range nums {
16+
for i := index + 1; i < len(nums); i++ {
17+
if val+nums[i] == target {
18+
data = append(data, index, i)
19+
endFor = true
20+
break
21+
}
22+
}
23+
if endFor {
24+
break
25+
}
26+
}
27+
return data
28+
}

0 commit comments

Comments
 (0)