leetcode题记——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].

思路:两层循环,i,j作为数值下标的指标进行循环,用数值a[2]分别存储满足要求的下标值,并输出数组结果。

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


已标记关键词 清除标记
相关推荐
©️2020 CSDN 皮肤主题: 大白 设计师:CSDN官方博客 返回首页