LeetCode_Two Sum_0x1

cellinlab

于 2018-12-01 20:40:57 发布

阅读量250

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 LeetCode 文章标签： LeetCode JAVA

本文链接：https://blog.youkuaiyun.com/funkstill/article/details/84678134

算法同时被 2 个专栏收录

25 篇文章

订阅专栏

LeetCode

2 篇文章

订阅专栏

本文深入探讨了经典的两数之和算法问题，给出了一种基于双重循环的解决方案。通过遍历整数数组寻找两个数，使它们的和等于特定目标值，此方法虽简单但效率有待提高。文章暗示了对Java数据结构的进一步学习可能带来更优的算法实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

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

submissions: