1 - Two Sum

最新推荐文章于 2020-12-21 22:16:52 发布

绿水兰田

最新推荐文章于 2020-12-21 22:16:52 发布

阅读量89

点赞数

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

本文链接：https://blog.csdn.net/LvShuiLanTian/article/details/95072372

版权

leetcode 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

本文深入探讨了经典的两数之和算法问题，提供了一种高效的解决方案。通过使用排序和双指针技巧，文章详细解释了如何在一个整数数组中找到两个数，使它们的和等于特定的目标值，同时确保不重复使用同一个元素。代码示例清晰地展示了算法的实现过程。

摘要由CSDN通过智能技术生成

Problem

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

Code

public class Solution {
    public int[] twoSum(int[] nums, int target) {
        int origins[] = Arrays.copyOf(nums, nums.length);
        Arrays.sort(nums);
        int left = 0, right = nums.length - 1;
        while (nums[left] + nums[right] != target) {
            if (nums[left] + nums[right] < target) {
                left++;
            } else {
                right--;
            }
        }
        int ret[] = new int[]{-1, -1};
        for (int i = 0; i < origins.length; ++i) {
            if (origins[i] == nums[left] && ret[0] == -1) {
                ret[0] = i;
                continue;
            }
            if (origins[i] == nums[right]) {
                ret[1] = i;
            }
        }
        return ret;
    }
}