关闭

1.two sum

151人阅读 评论(0) 收藏 举报

1. Two Sum

  • Total Accepted: 282086
  • Total Submissions: 1088812
  • Difficulty: Easy

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

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


我的提交:

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


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:55851次
    • 积分:1424
    • 等级:
    • 排名:千里之外
    • 原创:78篇
    • 转载:77篇
    • 译文:0篇
    • 评论:5条