recca chao 的 gitHub page

寫一些技術文件,筆記,雜七雜八

View on GitHub

Description

This problem was asked by Google.

Given a list of numbers and a number k, return whether any two numbers from the list add up to k.

For example, given [10, 15, 3, 7] and k of 17, return true since 10 + 7 is 17.

Bonus: Can you do this in one pass?

Kotlin Solution

參考 leet code 連接

https://leetcode.com/problems/two-sum/

假設題目如下

class Solution {
    fun twoSum(nums: IntArray, target: Int): IntArray {
       // 填空
    }
}

參考解法