指定数组的下标，如果数组元素等于指定值

最新推荐文章于 2022-04-06 13:45:00 发布

原创最新推荐文章于 2022-04-06 13:45:00 发布 · 634 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 系列专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一种解决两数之和问题的经典算法。给定一个整数数组及目标值，算法通过双层循环遍历数组，寻找两个数相加等于目标值的组合，并返回这两个数的下标。示例中使用了[-3,4,3,90]作为输入数组，0为目标值。

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

package com.dengpf.TwoNumbers;

/**
 * Created by kobe73er on 16/12/17.
 */
public class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] indexs = new int[2];
        int i = 0;
        for (; i < nums.length; i++) {
            int j = i + 1;
            for (; j < nums.length;) {
                if ((nums[i] + nums[j]) == target) {
                    indexs[0] = i;
                    indexs[1] = j;
                    return indexs;
                }
                j++;
            }
        }
        return indexs;
    }

    public static void main(String args[]) {
        int[] nums = {-3,4,3,90};
        Solution solution = new Solution();
        int[] result = solution.twoSum(nums, 0);
        for (int i = 0; i < result.length; i++) {
            System.out.println(result[i]);
        }
    }
}