题目链接

https://leetcode.cn/problems/two-sum/description/

代码

class Solution {
    func twoSum(nums: Array<Int64>, target: Int64): Array<Int64> {
        var arr:Array<Int64>=[0,0]
        for(indexa in 0..nums.size){
            for(indexb in indexa+1..nums.size){
                if(nums[indexa] + nums[indexb] == target){
                    arr[0] = indexa
                    arr[1] = indexb
                }
            }
        }
        return arr
    }
}

复杂度

时间O(n^2),空间O(1)

结果

https://leetcode.cn/problems/two-sum/submissions/574389382