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].
java编码:
1 class Solution { 2 public int[] twoSum(int[] nums, int target) { 3 4 for(int i = 0;i < nums.length ; i++){ 5 for(int j = i+1;j<nums.length ;j++){ 6 7 target = nums[i]+nums[j]; 8 if(target==9){ 9 return i ,j; 10 } 11 12 } 13 14 } 15 16 17 } 18 }