1. Two Sum

Myth丶恋晨 2022-07-15 00:55 242阅读 0赞

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: 

  1. Given nums = [2, 7, 11, 15], target = 9,
  3. Because nums[0] + nums[1] = 2 + 7 = 9,
  4. return [0, 1].

UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.

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

发表评论

表情：
评论列表 （有 0 条评论，242人围观）

还没有评论，来说两句吧...

相关阅读