leetcode 34:
来源:互联网 发布:淘宝手动吊葫芦 编辑:程序博客网 时间:2024/05/17 01:42
题目:
Given a sorted array of integers, find the starting and ending position of a given target value.
Your algorithm's runtime complexity must be in the order of O(log n).
If the target is not found in the array, return [-1, -1]
.
For example,
Given [5, 7, 7, 8, 8, 10]
and target value 8,
return [3, 4]
.
思路:
这题比较简单,可以先用二分法找到target的位置,然后向两边展开,找到相等元素的两个边界即可。
时间复杂度:O(lgn)
class Solution {public:vector<int> searchRange(vector<int>& nums, int target) {int size = nums.size();vector<int> result(2,-1);if (size == 0) return result;int index = binary(nums, 0, size - 1, target);if (index == -1) return result;int low = index, high = index;while (low >=0 && nums[low] == target)low--;while (high < size && nums[high] == target)high++;result[0] = low+1;result[1] = high-1;return result;}int binary(vector<int>&array, int low, int high, int key){if (low > high)return -1;int mid = (low + high) / 2;if (array[mid] == key)return mid;else if (array[mid] < key)return binary(array, mid + 1, high, key);elsereturn binary(array, low, mid - 1, key);}};
0 0
- leetcode 34:
- LeetCode #34
- LeetCode(34)SearchInsertPosition
- [LeetCode]34 范围搜索
- LeetCode(34)-Palindrome Number
- leetcode之-题34
- Leetcode no. 34
- leetcode #34 in cpp
- leetCode练习(34)
- 34 leetcode - Combinations
- [Leetcode] 41, 75, 34
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- 杭电1004(简单题)
- 基于Theano的深度学习(Deep Learning)框架Keras学习随笔-05-模型
- 内联函数
- linux下打开、关闭tomcat,实时查看tomcat运行日志
- iOS应用沙盒机制浅析
- leetcode 34:
- HLS直播服务节点优化 tmpfs
- Linux下vim使用
- 黑盒测试(详细)(软件测试)
- 一结(11)
- Hadoop学习笔记(九)HDFS架构分析
- poj 3260混合背包
- 环形加油站问题
- OC学习NSString与NSMutableString字符串