问题描述:
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].
public class Solution { public int[] twoSum(int[] nums, int target) { int i,j,count=0; int[] sum=new int[2]; for(i=0;i<nums.length-1;i++){ for(j=i+1;j<nums.length;j++){ if(nums[i]+nums[j]==target){ sum[count]=i; count++; sum[count]=j; break; } } } return sum; } }