LeetCode 1 两数之和

leetcode-cn.com/problems/tw…

class Solution {
    fun twoSum(nums: IntArray, target: Int): IntArray {
        for (i in 0 until nums.size) {
            var cur = nums[i]
            for (j in i + 1 until nums.size) {
                var other = nums[j]
                if (cur + other == target) {
                    return intArrayOf(i, j)
                }
            }
        }
        return intArrayOf()
    }
}