leetcode_1. Two Sum

最新推荐文章于 2024-09-07 16:05:05 发布

康雨城

最新推荐文章于 2024-09-07 16:05:05 发布

阅读量425

点赞数

分类专栏：百练OJ与leetcode解题代码分享文章标签： leetcode java

本文链接：https://blog.csdn.net/Kangyucheng/article/details/79464012

版权

百练OJ与leetcode解题代码分享专栏收录该内容

105 篇文章 14 订阅

订阅专栏

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

解题代码：

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;
                    a[1]=j;
                    break;
                }
            }
        }
        return a;
    }
}