[Swift]LeetCode1 .两数之和 | Two Sum

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/9697856.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

---

给定一个整数数组和一个目标值，找出数组中和为目标值的两个数。你可以假设每个输入只对应一种答案，且同样的元素不能被重复利用。

示例:

给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]

---

一遍哈希表

我们可以一次完成。在进行迭代并将元素插入到表中的同时，我们还会回过头来检查表中是否已经存在当前元素所对应的目标元素。如果它存在，那我们已经找到了对应解，并立即将其返回。

Runtime: 32 ms

Memory Usage: 19.3 MB

class Solution {
    func twoSum(_ nums: [Int], _ target: Int) -> [Int] {
        var table:[Int:Int] = [Int:Int]()        
        for (firstIndex, num) in nums.enumerated() {
            var res: Int = target - num
            //可选链接
            if let secondIndex = table[res] 
            {
                return [secondIndex,firstIndex]
            } 
            else 
            {
                table[num] = firstIndex
            }
        }
        return [-1,-1]
    }
}

---

36ms 

class Solution {
    func twoSum(_ nums: [Int], _ target: Int) -> [Int] {
        var out: [Int] = []
       
        var dict:[Int: Int] = [:]     
        for (index,num) in nums.enumerated() {
            if let sum = dict[target - num] {
                out.append(index)
                out.append(sum)
            } 
            dict[num] = index
        }
        return out
    }
}

---

18496 kb

class Solution {
    func twoSum(_ nums: [Int], _ target: Int) -> [Int] {
        for i in 0...nums.count-1 {
            if i == nums.count-1 { break; }
            for j in i+1...nums.count-1 {
                let sum = nums[i] + nums[j]
                if sum == target {
                    return [i, j]
                }
            }            
        }
        return [Int]()
    }
}

---

18524 kb

class Solution {
    typealias ArrayIndex = (array: [Int], startIndex: Int)
    
    func twoSum(_ nums: [Int], _ target: Int) -> [Int] {
        var arrayTest = [ArrayIndex]()
        arrayTest.append(ArrayIndex(nums, 0))
        
        while arrayTest.count != 0 {
            let values = arrayTest.remove(at: 0)
            let splitValues = splitArray(nums: values)
            if let result = scanTwoArray(nums1: splitValues.nums1, nums2: splitValues.nums2, target: target) {
                return result
            } else {
                arrayTest.append(splitValues.nums1)
                arrayTest.append(splitValues.nums2)
            }
        }
        return [0,1]
    }
    
    func splitArray(nums: ArrayIndex) -> (nums1: ArrayIndex, nums2: ArrayIndex) {
        let ct = nums.array.count
        let half = ct / 2
        let leftSplit = nums.array[0 ..< half]
        let rightSplit = nums.array[half ..< ct]
        return ((Array(leftSplit), nums.startIndex), (Array(rightSplit), nums.startIndex + half))
    }
    
    func scanTwoArray(nums1: ArrayIndex, nums2: ArrayIndex, target: Int) -> [Int]? {
        for i in 0..<nums1.array.count {
            for j in 0..<nums2.array.count {
                if nums1.array[i] + nums2.array[j] == target {
                    return [i + nums1.startIndex, j + nums2.startIndex]
                }
            }
        }
        
        return nil
    }
}