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].
下面是我用的Java语言写的:
public class Solution { public int[] twoSum(int[] nums, int target) { int[] index=new int[2]; for(int i=0;i<nums.length;i++) { for(int j=0;j<nums.length;j++){ if(i==j||nums[i]+nums[j]!=target){ index[0]=-1; index[1]=-1; } else { index[0]=i; index[1]=j; return index; } } } return index; } }