-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
46 lines (43 loc) · 1.15 KB
/
Copy pathmain.cpp
File metadata and controls
46 lines (43 loc) · 1.15 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
//
// main.cpp
// leetcode031
//
// Created by 萧天牧 on 17/2/28.
// Copyright © 2017年 萧天牧. All rights reserved.
//
#include <iostream>
#include <vector>
using namespace std;
void nextPermutation(vector<int>& nums) {
int leftPos ,rightPos;
for (leftPos = nums.size() - 2; leftPos >=0 ; leftPos--){
if (nums[leftPos] < nums[leftPos + 1])
break;
}
if (leftPos == -1){
reverse(nums.begin(), nums.end());
return;
}
int tarPos = leftPos + 1;
int minVal = 9999;
for (rightPos = leftPos + 1; rightPos < nums.size(); rightPos++){
if (nums[rightPos] > nums[leftPos] && (nums[rightPos] - nums[leftPos] <= minVal)){
minVal = nums[rightPos] - nums[leftPos];
tarPos = rightPos;
}
}
swap(nums[leftPos], nums[tarPos]);
reverse(nums.begin() + leftPos + 1, nums.end());
return;
}
void print_res(vector<int> nums){
for (int i = 0; i < nums.size(); i++)
cout <<nums[i]<<" ";
cout << endl;
}
int main(int argc, const char * argv[]) {
vector<int> nums = {1,3,2};
nextPermutation(nums);
print_res(nums);
return 0;
}