[C语言][LeetCode][153]Find Minimum in Rotated Sorted Array
2016-12-09 15:47
447 查看
题目
Find Minimum in Rotated Sorted ArraySuppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
Find the minimum element.
You may assume no duplicate exists in the array.
标签
Array、Binary Search难度
中等分析
题目意思是给定一个旋转了的数组,找到里面最小的数字,并返回。解题思路是遍历数组,分三种情况查找
1.index为0,只要当前的比nums[1]和nums[len-1]都要小,则返回当前的数字
2.index为len-1,只要当前的比nums[len-2]和nums[0]都要笑,则返回当前的数字
3.其他,只要当前的比上一个和下一个的数字要小,则返回当前的数字
C代码实现
int findMin(int* nums, int numsSize) { int i=0; for(i=0; i<numsSize; i++) { if(0 == i) { if( (nums[0]<nums[1]) && (nums[0]<nums[numsSize-1])) return nums[0]; } else if((numsSize-1) == i) { if( (nums[numsSize-1]<nums[0]) && (nums[numsSize-1]<nums[numsSize-2])) return nums[numsSize-1]; } else if( (nums[i]<nums[i-1]) && (nums[i]<nums[i+1])) return nums[i]; } return 1; }
相关文章推荐
- Java for LeetCode 153 Find Minimum in Rotated Sorted Array
- LeetCode153:Find Minimum in Rotated Sorted Array
- 153 Find Minimum in Rotated Sorted Array [Leetcode]
- leetcode 153 —— Find Minimum in Rotated Sorted Array
- LeetCode(153)Find Minimum in Rotated Sorted Array
- Leetcode[153]-Find Minimum in Rotated Sorted Array
- LeetCode(153) Find Minimum in Rotated Sorted Array
- 【LeetCode 153: Find Minimum in Rotated Sorted Array】
- 153_leetcode_Find Minimum in Rotated Sorted Array II
- leetcode 153 : Find Minimum in Rotated Sorted Array
- Leetcode#153 Find Minimum in Rotated Sorted Array
- [LeetCode]: 153: Find Minimum in Rotated Sorted Array
- leetcode 153: Find Minimum in Rotated Sorted Array
- leetcode: (153) Find Minimum in Rotated Sorted Array
- (LeetCode 153)Find Minimum in Rotated Sorted Array
- leetcode-153-Find Minimum in Rotated Sorted Array
- [LeetCode]153 Find Minimum in Rotated Sorted Array
- [leetcode 153] Find Minimum in Rotated Sorted Array
- leetcode-153 Find Minimum in Rotated Sorted Array
- LeetCode(153) Find Minimum in Rotated Sorted Array