Time: 0 ms (100.00%), Space: 12 MB (93.30%) - LeetHub

Author: JanaSabuj

next-permutation/next-permutation.cpp

@@ -0,0 +1,30 @@
+class Solution {
+public:
+    void nextPermutation(vector<int>& nums) {
+       // 
+        int idx = -1;
+        int n = nums.size();
+        for(int i = n - 1; i > 0; i--){
+            if(nums[i - 1] < nums[i]){
+                idx = i - 1;
+                break;
+            }
+        }
+        
+        if(idx == -1){
+            
+            reverse(nums.begin(), nums.end());
+            return;
+        }
+            
+        for(int i = n - 1; i > idx; i--){
+            if(nums[i] > nums[idx]){
+                swap(nums[i], nums[idx]);
+                break;
+            }
+        }
+        
+        reverse(nums.begin() + idx + 1, nums.end());
+            
+    }
+};