LeetCode-TwoSum

最新推荐文章于 2024-09-21 21:03:24 发布

Jsen_Wang

最新推荐文章于 2024-09-21 21:03:24 发布

阅读量299

点赞数

分类专栏： LeetCode 文章标签： leetcode twosum

本文链接：https://blog.csdn.net/wxs0124/article/details/77322958

版权

LeetCode 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

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].

S1：Time：O（n2） Space:O(1)

func twoSum(_ nums: [Int], _ target: Int) -> [Int] {
    for var i in 0..<nums.count {
        let first = nums[i];
        if first > target {
            return [];
        }
        let addMore = target - first;
        for var j in i+1..<nums.count {
            let second = nums[j];
            if second > addMore {
                break;
            }
            if second == addMore {
                return [i,j];
            }
        }
    }

    return [];
}

这里写图片描述

S2：Time：O（n） Space:O(n)

func twoSum(_ nums: [Int], _ target: Int) -> [Int] {
    var dic = [Int:Int]();
    for var i in 0..<nums.count {
        let item = nums[i];
        let addMore = target - item;
        let dicItem = dic[addMore];
        if  dicItem != nil {
            return [dicItem!,i];
        }
        dic[item] = i;

    }
    return [];
}