Java LeetCode 1.Two Sum

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


Solution:
 1 public class Solution {
 2     public int[] twoSum(int[] nums, int target) {
 3         int i,j;
 4         int[] res = new int[]{0,1};
 5         for(i=0;i<nums.length;i++){
 6             for(j=i+1;j<nums.length;j++){
 7                 if(nums[i]+nums[j]==target){
 8                     res[0] = i;
 9                     res[1] = j;
10                     return res;
11                 }
12             }
13         }
14         return res;
15     }
16 }

 

posted @ 2017-05-03 20:49  Arrack丶  阅读(135)  评论(0编辑  收藏  举报