Two Sum and Two Sum II
来源:互联网 发布:mysql having 用法 编辑:程序博客网 时间:2024/06/05 23:05
给定一个整形的数组,找出其中的两个数使其和为某个指定的值,并返回这两个数的下标,假设数组元素的值各不相同
Two Sum II (有序数组,有重复元素)
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
public class Solution { public int[] twoSum(int[] numbers, int target) { int[] res = {-1,-1}; int begin = 0; int end = numbers.length-1; while (begin < end) {if (numbers[begin] + numbers[end] == target) {res[0] = begin + 1;res[1] = end +1;break;}else if (numbers[begin] + numbers[end] > target) {end--;}else {begin++;}} return res; }}
0 0
- Two Sum and Two Sum II
- 1. Two Sum && 167. Two Sum II
- 【Leetcode】【python】Two Sum, Two Sum II
- [leetcode] Two Sum II
- Two Sum II
- #443 Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- LeetCode : Two Sum II
- Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- leetcode_167 Two Sum II
- 167. Two Sum II
- Android中Handler机制解析
- nginx.conf一般配置说明
- JTopo绘制网络拓扑图
- 1075. PAT Judge (25)-PAT甲级真题
- PL/SQL Developer客户端安装及配置
- Two Sum and Two Sum II
- 输入框美化(placeholder)
- 机器学习实战-决策树
- iOS --- 如何暂停和继续CALayer上的动画
- Real-Time Rendering-第一章 Introduction
- 第二周《C语言及程序设计》实践项目32 循环思想启蒙:输出小星星
- 线程安全随机队列
- 安装eclipse的JRebel6.4.3的插件
- hibernate在不联网时不能解析配置文件解决方案