恢复旋转排序数组
给定一个旋转排序数组,在原地恢复其排序。
说明
什么是旋转数组?
- 比如,原始数组为[1,2,3,4], 则其旋转数组可以是[1,2,3,4], [2,3,4,1], [3,4,1,2], [4,1,2,3]
样例
[4, 5, 1, 2, 3]
-> [1, 2, 3, 4, 5]
1 class Solution { 2 public: 3 /* 4 * @param nums: An integer array 5 * @return: nothing 6 */ 7 void recoverRotatedSortedArray(vector<int> &nums) { 8 // write your code here 9 int min_nums = *min_element(nums.begin(), nums.end()); //获取容器中最小值, 10 while (nums[0] > min_nums) { 11 int temp = nums[0]; 12 nums.erase(nums.begin()); 13 nums.push_back(temp); 14 } 15 } 16 };