TwoSum（leetcode）

最新推荐文章于 2024-09-15 15:29:37 发布

XDU_贪睡的Brighten

最新推荐文章于 2024-09-15 15:29:37 发布

阅读量387

点赞数

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

本文链接：https://blog.csdn.net/Brighten_Yim/article/details/44545521

版权

leetcode 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

题目：/* Given an array of integers, find two numbers such that they add up to a specific target
* The function twoSum should return indices of the two numbers such that they add up to the target,
* where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
* You may assume that each input would have exactly one solution.
* Input: numbers={2, 7, 11, 15}, target=9
* Output: index1=1, index2=2
*/
代码：

public class TwoSum {

    public int[] twoSum(int[] numbers, int target) {
        int[] ret = new int[2];
        for (int i = 0; i < numbers.length; i++) {
                for (int j = i + 1; j < numbers.length; j++) {
                    if (numbers[i] + numbers[j] == target) {
                        ret[0] = i + 1;
                        ret[1] = j + 1;
                }
            }
        }
        return ret;
    }
}
//直接遍历 O(n^2)