首页 > 其他 > 详细

leetcode mock interview-two sum II

时间:2016-10-07 23:36:55      阅读:472      评论:0      收藏:0      [点我收藏+]
package com.company;


import java.util.LinkedList;
import java.util.List;

public class Main {

    public int[] twoSum(int[] numbers, int target) {
        int i = 0, j = numbers.length - 1;
        int []ret = new int[2];
        while (i < j) {
            if (numbers[i] + numbers[j] < target) {
                i++;
            }
            else if (numbers[i] + numbers[j] > target) {
                j--;
            }
            else {
                ret[0] = i+1;
                ret[1] = j+1;
                break;
            }
        }
        return ret;
    }



    public static void main(String[] args) {
        // write your code here
        System.out.println("Hello");

        int []numbers = {2, 7, 11, 15};
        int target = 9;
        Main mn = new Main();
        int[] ret = mn.twoSum(numbers, target);
        System.out.printf("ret: %d, %d\n", ret[0], ret[1]);

    }
}

 

leetcode mock interview-two sum II

原文:http://www.cnblogs.com/charlesblc/p/5936948.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!