zoukankan      html  css  js  c++  java
  • leetcode--Two Sum

    Given an array of integers, find two numbers such that they add up to a specific target number.

    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 Solution {
        public int[] twoSum(int[] numbers, int target) {
            int[] result = new int[2];
    		int length = numbers.length;
    		Map<Integer, Integer> difference = new HashMap<Integer, Integer>();
    		for(int i = 0; i < length; ++i)
    			difference.put(target - numbers[i], i);
    		for(int i = 0; i < length; ++i){
    			if(difference.containsKey(numbers[i]) && i != difference.get(numbers[i])){
    				result[0] = Math.min(i, difference.get(numbers[i])) + 1;
    				result[1] = Math.max(i, difference.get(numbers[i])) + 1;
    				break;
    			}
    		}
    		return result;    
        }
    }
    

      

  • 相关阅读:
    线程
    自定义异常
    throw 子句
    throw 语句
    异常处理
    异常处理
    匿名类
    接口的使用,内部类
    接口,接口的定义
    如何理解无偏估计?无偏估计有什么用?什么是无偏估计?
  • 原文地址:https://www.cnblogs.com/averillzheng/p/3769075.html
Copyright © 2011-2022 走看看