forked from soapyigu/LeetCode-Swift
-
Notifications
You must be signed in to change notification settings - Fork 1
/
MultiplyStrings.swift
43 lines (36 loc) · 1.33 KB
/
MultiplyStrings.swift
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
/**
* Question Link: https://leetcode.com/problems/multiply-strings/
* Primary idea: reverse two strings and multiply them use nested loop by every digit,
* then use sum && carry idea to get the final result
*
* Note: do not forget to remove leading 0 afterwards
*
* Time Complexity: O(nm), Space Complexity: O(n)
*
*/
class MultiplyStrings {
func multiply(_ num1: String, _ num2: String) -> String {
guard num1 != "0" && num2 != "0" else {
return "0"
}
let num1Chars = Array(num1.characters.reversed())
let num2Chars = Array(num2.characters.reversed())
var res = Array(repeating: 0, count: num1Chars.count + num2Chars.count)
var finalChars = [String](), carry = 0, sum = 0
for (i, char1) in num1Chars.enumerated() {
let n1 = Int(String(char1))
for (j, char2) in num2Chars.enumerated() {
res[i + j] += n1! * Int(String(char2))!
}
}
for num in res {
sum = (carry + num) % 10
carry = (carry + num) / 10
finalChars.insert(String(sum), at: 0)
}
while !finalChars.isEmpty && finalChars.first! == "0" {
finalChars.removeFirst()
}
return finalChars.reduce("") { $0 + $1 }
}
}