题目:
思路:
1.先得到数组nums的长度:nums.length
2.放入两个循环,第一个内层j,第二个外层i
3.target-num[i]==num[j]
4.返回i,j
解答:
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[j]==target-nums[i]){
return new int[] {i,j};
}
}
}
throw new IllegalArgumentException("No two sum solution");
}
注意:
1.定义数组:datatype[] {int1,int2,...},例子:int[] {1,2,3};
2.for循环
3.这个位置要写这句话,不然报错: missing return statement