LeetCode 34 Search for a Range
来源:互联网 发布:linux c 串口中断 编辑:程序博客网 时间:2024/06/16 09:04
题意:
给出有序序列,查找target在序列中出现的下标区间。
思路:
熟练使用C++的upper_bound和lower_bound……
代码:
class Solution {public: vector<int> searchRange(vector<int> &nums, int target) { int l = lower_bound(nums.begin(), nums.end(), target) - nums.begin(); if (l == nums.size() || nums[l] != target) { return vector<int> {-1, -1}; } int r = upper_bound(nums.begin(), nums.end(), target) - nums.begin(); return vector<int> {l, r - 1}; }};
0 0
- LeetCode(34)Search for a Range
- [LeetCode] Search for a Range [34]
- LeetCode 34 Search for a Range
- [leetcode 34] Search for a Range
- Leetcode NO.34 Search for a Range
- [LeetCode 34]Search for a Range
- leetcode-34 Search for a Range
- Leetcode 34 Search for a Range
- Search for a Range - LeetCode 34
- leetcode 34 -- Search for a Range
- leetcode 34: Search for a Range
- Leetcode#34 Search for a Range
- LeetCode(34) Search for a Range
- LeetCode 34: Search for a Range
- [Leetcode 34, Medium] Search for a Range
- [leetcode-34]Search for a Range(C)
- Leetcode#34||Search for a Range
- LeetCode(34)Search for a Range
- Android Studio 集成git上传项目至GitHub
- 普及练习场之排序Ex
- java 下载文件
- 【常见面试算法题】之二分搜索
- 实现控件拖动
- LeetCode 34 Search for a Range
- hadoop常用算法在spark中实现
- GCC Compile and Link options
- 【video】主流流媒体服务器介绍
- 获取ip地址
- jdk1.8中ConcurrentHashMap的实现原理
- 反射(基础知识)
- html5绝对元素的对齐与偏移的方法
- Android开发:getContentResolver的使用