Commit 7b09529

authored

Merge pull request youngyangyang04#2800 from zrzhit/master

增加Swift版本 1. 面试题02.07.链表相交 2.右旋字符串

2 parents a299ece + 2ddf04f commit 7b09529Copy full SHA for 7b09529

File tree

+61

-0

lines changed

+61

-0

lines changed

Lines changed: 22 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -350,7 +350,29 @@ function reverseStr(s, start, end) {`
`350`	`350`
`351`	`351`
`352`	`352`	`### Swift:`
	`353`	+```swift
	`354`	`+func rotateWords(_ s: String, _ k: Int) -> String {`
	`355`	`+ var chars = Array(s)`
	`356`	`+ // 先反转整体`
	`357`	`+ reverseWords(&chars, start: 0, end: s.count - 1)`
	`358`	`+ // 反转前半段`
	`359`	`+ reverseWords(&chars, start: 0, end: k - 1)`
	`360`	`+ // 反转后半段`
	`361`	`+ reverseWords(&chars, start: k, end: s.count - 1)`
	`362`	`+ return String(chars)`
	`363`	`+}`
`353`	`364`
	`365`	`+// 反转start...end 的字符数组`
	`366`	`+func reverseWords(_ chars: inout [Character], start: Int, end: Int) {`
	`367`	`+ var left = start`
	`368`	`+ var right = end`
	`369`	`+ while left < right, right < chars.count {`
	`370`	`+ (chars[left], chars[right]) = (chars[right], chars[left])`
	`371`	`+ left += 1`
	`372`	`+ right -= 1`
	`373`	`+ }`
	`374`	`+}`
	`375`	+```
`354`	`376`
`355`	`377`
`356`	`378`	`### PHP:`

Lines changed: 39 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -535,6 +535,45 @@ public ListNode GetIntersectionNode(ListNode headA, ListNode headB)`
`535`	`535`	`}`
`536`	`536`	```
`537`	`537`
	`538`	`+### Swift:`
	`539`	+```swift
	`540`	`+func getIntersectionNode(_ headA: ListNode?, _ headB: ListNode?) -> ListNode? {`
	`541`	`+ var lenA = 0`
	`542`	`+ var lenB = 0`
	`543`	`+ var nodeA = headA`
	`544`	`+ var nodeB = headB`
	`545`	`+ // 计算链表A和链表B的长度`
	`546`	`+ while nodeA != nil {`
	`547`	`+ lenA += 1`
	`548`	`+ nodeA = nodeA?.next`
	`549`	`+ }`
	`550`	`+ while nodeB != nil {`
	`551`	`+ lenB += 1`
	`552`	`+ nodeB = nodeB?.next`
	`553`	`+ }`
	`554`	`+ // 重置指针`
	`555`	`+ nodeA = headA`
	`556`	`+ nodeB = headB`
	`557`	`+ // 如果链表A更长,让它先走lenA-lenB步`
	`558`	`+ if lenA > lenB {`
	`559`	`+ for _ in 0..<(lenA - lenB) {`
	`560`	`+ nodeA = nodeA?.next`
	`561`	`+ }`
	`562`	`+ } else if lenB > lenA {`
	`563`	`+ // 如果链表B更长,让它先走lenB-lenA步`
	`564`	`+ for _ in 0..<(lenB - lenA) {`
	`565`	`+ nodeB = nodeB?.next`
	`566`	`+ }`
	`567`	`+ }`
	`568`	`+ // 同时遍历两个链表,寻找交点`
	`569`	`+ while nodeA !== nodeB {`
	`570`	`+ nodeA = nodeA?.next`
	`571`	`+ nodeB = nodeB?.next`
	`572`	`+ }`
	`573`	`+ return nodeA`
	`574`	`+}`
	`575`	+```
	`576`	`+`
`538`	`577`
`539`	`578`	`<p align="center">`
`540`	`579`	`<a href="https://programmercarl.com/other/kstar.html" target="_blank">`

Comments

(0)