1. Two Sum
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].
测试程序:
class Solution {
public int[] twoSum(int[] nums, int target) {int[] result = new int[2];
for (int i=0;i<nums.length;i++){
for (int j=i+1;j<nums.length;j++){
if((nums[i] + nums[j])==target){
result[0]=i;
result[1]=j;
return result;
}
}
}
throw new IllegalArgumentException("No two sum solution"); //非法参数异常,抛出给方法的调用者捕获该异常。}
}
注释:
IllegalArgumentException非法参数异常,可能twoSum方法中参数nums没有满足两个元素和为target的情况,所以要抛出IllegalArgumentException异常给方法的调用者并捕获该异常!
扫描二维码关注公众号,回复:
10435683 查看本文章