Time: 132 ms (18.29%), Space: 5.9 MB (78.00%) - LeetHub

Author: JanaSabuj

permutation-sequence/permutation-sequence.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    string getPermutation(int n, int k) {
+        string str = "";
+        for (int i = 1; i <= n; ++i) {
+            str += to_string(i);
+        }
+
+        int cnt = 1;
+        if (k == 1)
+            return str;
+        while (next_permutation(str.begin(), str.end())) {
+            cnt++;
+            if (cnt == k)
+                return str;
+        }
+
+        return str;
+    }
+};