mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-06 17:44:10 +08:00
fix/445: add other solution
This commit is contained in:
@ -69,8 +69,8 @@ func getLength(l *ListNode) int {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func addTwoNumbers1(l1 *ListNode, l2 *ListNode) *ListNode {
|
func addTwoNumbers1(l1 *ListNode, l2 *ListNode) *ListNode {
|
||||||
reservedL1 := reversedList(l1)
|
reservedL1 := reverseList(l1)
|
||||||
reservedL2 := reversedList(l2)
|
reservedL2 := reverseList(l2)
|
||||||
|
|
||||||
dummyHead := &ListNode{}
|
dummyHead := &ListNode{}
|
||||||
head := dummyHead
|
head := dummyHead
|
||||||
@ -89,10 +89,10 @@ func addTwoNumbers1(l1 *ListNode, l2 *ListNode) *ListNode {
|
|||||||
head.Next = &ListNode{Val: val % 10}
|
head.Next = &ListNode{Val: val % 10}
|
||||||
head = head.Next
|
head = head.Next
|
||||||
}
|
}
|
||||||
return reversedList(dummyHead.Next)
|
return reverseList(dummyHead.Next)
|
||||||
}
|
}
|
||||||
|
|
||||||
func reversedList(head *ListNode) *ListNode {
|
func reverseList(head *ListNode) *ListNode {
|
||||||
var prev *ListNode
|
var prev *ListNode
|
||||||
for head != nil {
|
for head != nil {
|
||||||
tmp := head.Next
|
tmp := head.Next
|
||||||
|
Reference in New Issue
Block a user