原题:
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,找到数组里两数之和等于target的两个元素的索引
思路:遍历。。。效率低 但能做出来
我的程序:
class Solution {
public static int[] twoSum(int[] nums, int target) {
for(int i=0;i<nums.length;i++)
for(int k=i+1;k<nums.length;k++){
if((nums[i]+nums[k])==target){
return (new int[]{i,k});
}
}
return null;
}
}
public static int[] twoSum(int[] nums, int target) {
for(int i=0;i<nums.length;i++)
for(int k=i+1;k<nums.length;k++){
if((nums[i]+nums[k])==target){
return (new int[]{i,k});
}
}
return null;
}
}