167. Two Sum II
来源:互联网 发布:搞笑诺贝尔奖 知乎 编辑:程序博客网 时间:2024/06/07 06:31
题目来源【Leetcode】
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 and you may not use the same element twice.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
这道题前后相加比较,如果大了则h-1,小了则l+1,直到相等
class Solution {public: vector<int> twoSum(vector<int>& numbers, int target) { int l = 0; int h = numbers.size()-1; while(l <= h){ if(numbers[l] + numbers[h] < target) l++; else if(numbers[l] + numbers[h] > target) h--; else break; } vector<int>pair; pair.push_back(l+1); pair.push_back(h+1); return pair; }};
阅读全文
0 0
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- 167. Two Sum II
- PageHelper
- 生产者消费者的五种实现方式
- xshell&linux快捷键和常用命令
- Java线程
- 简单记录一下shiro的验证流程
- 167. Two Sum II
- 问答入门----- web 性能
- 9.React中文之表单
- 一个 popupwindow的小工具
- video.js
- SpringMVC+Maven+FreeMarker+MyBatis 使用
- Redis集群
- Struts2_拦截器(Action拦截和全局拦截)
- 解决使用slidingmenu控件导致底部虚拟键覆盖问题