1. Two Sum

最新推荐文章于 2024-10-18 10:39:20 发布

windjack_

最新推荐文章于 2024-10-18 10:39:20 发布

阅读量295

点赞数 1

分类专栏： Swift&leetCode 文章标签： leetcode swift array dictionary if-else

本文链接：https://blog.csdn.net/fengser/article/details/70156260

版权

Swift&leetCode 专栏收录该内容

0 篇文章 0 订阅

订阅专栏

将来的工作需要用到Swift，可是看语法什么的好无聊啊，最近又恰好发现leetCode支持Swift，以前又没刷过leetCode，于是就借着这个机会，边刷边学学Swift。

题目：
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]

题目本身没什么意思，要在时间复杂度o(n)内求解，主要就是利用map记录一下value-index。这里主要是学习一下Swift的语法，下面是leetCode上别人的solution。关键的语法点就是数组，字典的使用，变量的定义，if-else。

class Solution {
    func twoSum(_ nums: [Int], _ target: Int) -> [Int] {
        var selectedIndices = [Int:Int]()
        for (index, element) in nums.enumerated()
        {
            selectedIndices[element] = index
        }

        for (index, element) in nums.enumerated()
        {
            let compliment = target - element

            if let selectedIndex = selectedIndices[compliment]
            {
                if  selectedIndex != index
                {
                    return [index, selectedIndex]
                }
            }
        }
        return []
    }
}