(defn two-sum [nums targer]
(let [length (count nums)]
(first (for [i (range 0 length)
j (range 0 length)
:when (and (not= i j) (= targer (+ (nums i) (nums j))))
]
[i j]
))))
(two-sum [2 11 7 15] 13)
(two-sum [3 3] 6)
clj 编写一个函数two-sum 求出两数之和给定一个整数数组 nums和一个整数目标值target请你在该数组中找出和为目标值 target 的那 两个 整数并返回它们的数组下标。
最新推荐文章于 2024-01-18 23:18:12 发布