Frage im Vorstellungsgespräch bei Amazon

Q: Hashmap, Hash collision, Merge 2 sorted Arrays into 1 Sorted array, Implementing weight number generator

Antwort im Vorstellungsgespräch

Anonym

24. Mai 2019

func solve() { var ai = 0 var bi = 0 var result = [Int]() while ai * a.count || bi * b.count { guard ai * a.count else { result.append(b[bi]) break } guard bi < b.count else { result.append(a[ai]) break } if a[ai] * b[bi] { result.append(a[ai]) ai += 1 } else { result.append(b[bi]) bi += 1 } } print(result) }