Commit 1efa4f8

committed

feat: update solution to lc problem: No.0024

No.0024.Swap Nodes in Pairs

1 parent 1a8fc8b commit 1efa4f8Copy full SHA for 1efa4f8

File tree

+71

-13

lines changed

+71

-13

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -48,7 +48,7 @@`
`48`	`48`
`49`	`49`	`方法一:排序 + 双指针`
`50`	`50`
`51`		`-该题和 [0015.三数之和](../0015.3Sum/README.md) 相似,解法也相似。`
	`51`	`+该题和 [0015.三数之和](https://leetcode.cn/problems/3sum/) 相似,解法也相似。`
`52`	`52`
`53`	`53`	`时间复杂度为 $O(n^3),ドル空间复杂度为 $O(\log n),ドル其中 $n$ 是数组的长度。`
`54`	`54`

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -44,8 +44,16 @@`
`44`	`44`
`45`	`45`	`<!-- 这里可写通用的实现逻辑 -->`
`46`	`46`
	`47`	`+方法一:迭代`
	`48`	`+`
`47`	`49`	`设置虚拟头节点 dummy,pre 指针初始指向 dummy,遍历链表,每次交换 pre 后面的两个节点即可。`
`48`	`50`
	`51`	`+时间复杂度为 $O(n),ドル空间复杂度为 $O(1),ドル其中 $n$ 是链表的长度。`
	`52`	`+`
	`53`	`+方法二:递归`
	`54`	`+`
	`55`	`+时间复杂度为 $O(n),ドル空间复杂度为 $O(n),ドル其中 $n$ 是链表的长度。`
	`56`	`+`
`49`	`57`	`<!-- tabs:start -->`
`50`	`58`
`51`	`59`	`### Python3`
`@@ -166,6 +174,8 @@ public:`
`166`	`174`
`167`	`175`	`### Go`
`168`	`176`
	`177`	`+迭代:`
	`178`	`+`
`169`	`179`	```go
`170`	`180`	`/**`
`171`	`181`	`* Definition for singly-linked list.`
`@@ -189,6 +199,27 @@ func swapPairs(head ListNode) ListNode {`
`189`	`199`	`}`
`190`	`200`	```
`191`	`201`
	`202`	`+递归:`
	`203`	`+`
	`204`	+```go
	`205`	`+/**`
	`206`	`+ * Definition for singly-linked list.`
	`207`	`+ * type ListNode struct {`
	`208`	`+ * Val int`
	`209`	`+ * Next *ListNode`
	`210`	`+ * }`
	`211`	`+ */`
	`212`	`+func swapPairs(head ListNode) ListNode {`
	`213`	`+ if head == nil \|\| head.Next == nil {`
	`214`	`+ return head`
	`215`	`+ }`
	`216`	`+ res := swapPairs(head.Next.Next)`
	`217`	`+ p := head.Next`
	`218`	`+ p.Next, head.Next = head, res`
	`219`	`+ return p`
	`220`	`+}`
	`221`	+```
	`222`	`+`
`192`	`223`	`### Ruby`
`193`	`224`
`194`	`225`	```rb

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -38,6 +38,14 @@`
`38`	`38`
`39`	`39`	`## Solutions`
`40`	`40`
	`41`	`+Approach 1: Iteration`
	`42`	`+`
	`43`	`+Time complexity $O(n),ドル Space complexity $O(1)$.`
	`44`	`+`
	`45`	`+Approach 2: Recursion`
	`46`	`+`
	`47`	`+Time complexity $O(n),ドル Space complexity $O(n)$.`
	`48`	`+`
`41`	`49`	`<!-- tabs:start -->`
`42`	`50`
`43`	`51`	`### Python3`
`@@ -154,6 +162,8 @@ public:`
`154`	`162`
`155`	`163`	`### Go`
`156`	`164`
	`165`	`+Iteration:`
	`166`	`+`
`157`	`167`	```go
`158`	`168`	`/**`
`159`	`169`	`* Definition for singly-linked list.`
`@@ -177,6 +187,27 @@ func swapPairs(head ListNode) ListNode {`
`177`	`187`	`}`
`178`	`188`	```
`179`	`189`
	`190`	`+Recursion:`
	`191`	`+`
	`192`	+```go
	`193`	`+/**`
	`194`	`+ * Definition for singly-linked list.`
	`195`	`+ * type ListNode struct {`
	`196`	`+ * Val int`
	`197`	`+ * Next *ListNode`
	`198`	`+ * }`
	`199`	`+ */`
	`200`	`+func swapPairs(head ListNode) ListNode {`
	`201`	`+ if head == nil \|\| head.Next == nil {`
	`202`	`+ return head`
	`203`	`+ }`
	`204`	`+ res := swapPairs(head.Next.Next)`
	`205`	`+ p := head.Next`
	`206`	`+ p.Next, head.Next = head, res`
	`207`	`+ return p`
	`208`	`+}`
	`209`	+```
	`210`	`+`
`180`	`211`	`### Ruby`
`181`	`212`
`182`	`213`	```rb

Lines changed: 8 additions & 12 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,16 +5,12 @@`
`5`	`5`	`* Next *ListNode`
`6`	`6`	`* }`
`7`	`7`	`*/`
`8`		`- func swapPairs(head ListNode) ListNode {`
`9`		`- dummy := &ListNode{0, head}`
`10`		`- pre, cur := dummy, head`
`11`		`- for cur != nil && cur.Next != nil {`
`12`		`- t := cur.Next`
`13`		`- cur.Next = t.Next`
`14`		`- t.Next = cur`
`15`		`- pre.Next = t`
`16`		`- pre = cur`
`17`		`- cur = cur.Next`
`18`		`- }`
`19`		`- return dummy.Next`
	`8`	`+func swapPairs(head ListNode) ListNode {`
	`9`	`+ if head == nil \|\| head.Next == nil {`
	`10`	`+ return head`
	`11`	`+ }`
	`12`	`+ res := swapPairs(head.Next.Next)`
	`13`	`+ p := head.Next`
	`14`	`+ p.Next, head.Next = head, res`
	`15`	`+ return p`
`20`	`16`	`}`

Comments

(0)