码迷,mamicode.com
首页 > 其他好文 > 详细

【LeetCode】Next Permutation (2 solutions)

时间:2014-12-18 13:23:16      阅读:162      评论:0      收藏:0      [点我收藏+]

标签:style   blog   http   ar   io   color   os   sp   strong   

Next Permutation

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.

If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order).

The replacement must be in-place, do not allocate extra memory.

Here are some examples. Inputs are in the left-hand column and its corresponding outputs are in the right-hand column.
1,2,3 → 1,3,2
3,2,1 → 1,2,3
1,1,5 → 1,5,1

 

解法一:just a joke :)

class Solution {
public:
    void nextPermutation(vector<int> &num) {
        next_permutation(num.begin(), num.end());
    }
};

bubuko.com,布布扣

【LeetCode】Next Permutation (2 solutions)

标签:style   blog   http   ar   io   color   os   sp   strong   

原文地址:http://www.cnblogs.com/ganganloveu/p/4171467.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!