LeetCode Two Sum II - Input array is sorted
2016-03-27 04:04
423 查看
原题链接在这里:https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/
题目:
Given an array of integers that is already sorted in ascending order, 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
题解:
说指针从两头向中间递进. 类似Two Sum.
Time Complexity: O(n). Space: O(1).
AC Java:
题目:
Given an array of integers that is already sorted in ascending order, 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
题解:
说指针从两头向中间递进. 类似Two Sum.
Time Complexity: O(n). Space: O(1).
AC Java:
public class Solution { public int[] twoSum(int[] numbers, int target) { int [] res = new int[]{-1,-1}; if(numbers == null || numbers.length < 2){ return res; } int l = 0; int r = numbers.length-1; while(l<r){ if(numbers[l] + numbers[r] < target){ l++; }else if(numbers[l] + numbers[r] > target){ r--; }else{ res[0] = l+1; res[1] = r+1; break; } } return res; } }
相关文章推荐
- 神经网络对比
- LeetCode Two Sum III - Data structure design
- flume介绍以及环境的部署
- Factory Method
- (PHP+HTML+JavaScript+Css)一个简单爬虫的开发
- MindNode Pro serial number
- incompatible with sql_mode=only_full_group_by
- Scss sass
- A Deeper Look at the Scala Syntax (scala block)
- LeetCode Odd Even Linked List
- 使用Java的BlockingQueue实现生产者-消费者
- Unbuntu登陆界面用户丢失寻回记
- Python的安装及升级
- 第6章 脚本安装包
- 【阿里云ECS】Centos6.5安装图形界面
- 一些PHP性能优化
- NetBeans建立跳过测试构建的快捷方式
- 设计模式 之 单例模式 (C++ 懒汉经典实现 & DCL实现 & 饿汉经典实现)
- 文件上传的方式以及对应的配置
- 纯css导航条