๋ฌธ์
์ฝ๋
class Solution {
public:
void nextPermutation(vector<int>& nums) {
next_permutation(nums.begin(),nums.end());
}
};
'Algorithm ๐ง๐ปโ๐ป > Leetcode' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[Leetcode,c++] Roman to Integer (0) | 2021.11.15 |
---|---|
[Leetcode,c++] Find First and Last Position of Element in Sorted Array (0) | 2021.11.14 |
[Leetcode,c++] Group Anagrams (0) | 2021.11.14 |
[Leetcode,c++] Length of Last Word (0) | 2021.11.14 |
[Leetcode,c++] Container With Most Water (0) | 2021.11.14 |
[Leetcode,c++] Remove Duplicates from Sorted Array (0) | 2021.11.14 |
๋๊ธ