-
Notifications
You must be signed in to change notification settings - Fork 30
Expand file tree
/
Copy pathContents.swift
More file actions
49 lines (39 loc) · 1.21 KB
/
Contents.swift
File metadata and controls
49 lines (39 loc) · 1.21 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
import UIKit
/*
Given an input string, reverse the string word by word.
Example:
Input: "the sky is blue",
Output: "blue is sky the".
Note:
A word is defined as a sequence of non-space characters.
Input string may contain leading or trailing spaces. However, your reversed string should not contain leading or trailing spaces.
You need to reduce multiple spaces between two words to a single space in the reversed string.
Follow up: For C programmers, try to solve it in-place in O(1) space.
*/
// O(n + m) - time complexity
// O(1) - space complexity
func swapWords(str: inout [Character]) {
var left = 0
var right = str.count - 1
swapInside(str: &str, left: left, right: right)
for i in 0 ..< str.count {
if str[i] == " " {
right = i - 1
swapInside(str: &str, left: left, right: right)
left = i + 1
}
}
swapInside(str: &str, left: left, right: str.count - 1)
}
func swapInside(str: inout [Character], left: Int, right: Int) {
var left = left
var right = right
while left <= right {
str.swapAt(left, right)
left += 1
right -= 1
}
}
var arr = Array("error or")
swapWords(str: &arr)
arr