leetcode--001. Two Sum
来源:互联网 发布:知是故人来 编辑:程序博客网 时间:2024/06/05 15:11
Two sum
题意
给一个整数数组和数 target,返回数组中某两个数相加之和为 target 的下标。
题解
思路见代码。
时间复杂度:
class Solution {public: struct node{ int val, pos; node(int v, int p):val(v), pos(p){} }; vector<int> twoSum(vector<int>& nums, int target) { vector<node> res; vector<int> ans; int n = nums.size(); for(int i = 0; i < n; ++i){ res.push_back(node(nums[i], i)); } sort(res.begin(), res.end(), [](const node& n1, const node& n2){ return n1.val < n2.val; }); int l = 0, r = n - 1; while(l < r){ if(res[l].val + res[r].val == target) break; else if(res[l].val + res[r].val > target) r--; else l++; } ans.push_back(res[l].pos); ans.push_back(res[r].pos); return ans; }};
0 0
- LeetCode 001. Two Sum
- 【LeetCode】001.Two Sum
- leetcode--001. Two Sum
- 【LeetCode】 001. Two Sum
- 【LeetCode】001. Two Sum
- [Leetcode.python] 001. Two Sum
- Leetcode Algorithm 001. Two Sum
- 【Leetcode】Two Sum (Sum)
- [LeetCode 解题报告]001.Two Sum
- LeetCode: Two Sum
- LeetCode: Two Sum
- [Leetcode] Two Sum
- LeetCode : Two Sum
- Leetcode: Two Sum
- leetcode 46: Two Sum
- [LeetCode] Two Sum
- LeetCode 1 - Two Sum
- Leetcode : Two Sum
- 多线程安全计数器
- REACT学习笔记
- E: Some index files failed to download. They have been ignored, or old ones used instead.
- 杭电oj~~2005
- Problem A: 求倒数和【简单循环】
- leetcode--001. Two Sum
- WCF 找不到类型 WcfService
- 利用静态数码管实现从9到0 再从0到9
- iOS数据解析之JSON解析
- hihoCoder挑战赛20 (区间最值)
- 修改Widnows 10 显示自定义缩放级别为500%还原
- scala安装
- 我的大学图书馆
- c++实验5-数组选择