LeetCode1. 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].

思路

两个for循环，顺序扫描一遍寻找其和相等的两个index，返回数组

代码

public class Solution {
    public int[] twoSum(int[] nums, int target) {
    	int length = nums.length;
    	int[] result = new int[2] ;
    	for(int i = 0 ; i < (length - 1 ) ; ++ i ){
    		for(int j = (i + 1) ; j < length ; ++ j){
    			if(target == (nums[i] + nums[j])){
    				result[0] = i ;
    				result[1] = j ;
    				return result;
    			}
    		}
    	}
        return result;
    }
}