題目：
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].
思路:
找到可以符合兩數加總等於 target 的index 並回傳.
最簡單就是利用迴圈檢查所有組合可能,並將其逐一檢查.
若符合規則就將索引建立為一個 array 回傳.
1 2 3 4 5 6 7 8 9 10 11 12 13 |
class Solution {
public int[] twoSum(int[] nums, int target) {
for(int i = 0;i < nums.length ; i++){
for(int j=i+1 ; j<nums.length;j++){
if(nums[i] + nums[j] == target)
return new int[]{i,j};
}
}
return new int[]{0,0};
}
}
|
文章標籤
全站熱搜
留言列表
Revit 二次開發 (2)
{{ article.title }}