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

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]);
        }
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值