1. Two Sum

最新推荐文章于 2024-11-14 21:21:03 发布

浴前带刀侍卫

最新推荐文章于 2024-11-14 21:21:03 发布

阅读量270

点赞数

分类专栏： leetcode笔记本文章标签：算法

本文链接：https://blog.csdn.net/yaoxingshuai/article/details/51182984

版权

leetcode笔记本专栏收录该内容

1 篇文章 0 订阅

订阅专栏

1. Two Sum

Total Accepted: 219100 Total Submissions: 958452 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].




思路：依次遍历所有的可能性，当满足要求时返回结果public class Solution {
    public int[] twoSum(int[] nums, int target) {
        int res[]=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){
                    res[0]=i;   res[1]=j;
                    return res;
                }
            }
        }
        return null;
    }
}