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.
Example:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
package com.dengpf.TwoNumbers; /** * Created by kobe73er on 16/12/17. */ public class Solution { public int[] twoSum(int[] nums, int target) { int[] indexs = new int[2]; int i = 0; for (; i < nums.length; i++) { int j = i + 1; for (; j < nums.length;) { if ((nums[i] + nums[j]) == target) { indexs[0] = i; indexs[1] = j; return indexs; } j++; } } return indexs; } public static void main(String args[]) { int[] nums = {-3,4,3,90}; Solution solution = new Solution(); int[] result = solution.twoSum(nums, 0); for (int i = 0; i < result.length; i++) { System.out.println(result[i]); } } }