LeetCode - Permutation Sequence (Java)

We get the following sequence (ie, for n = 3): "123" "132" "213" "231" "312" "321" Given n and k, return the kth permutation sequence. Note: Given n will be between 1 and 9 inclusive. Thoughts Java Solution 1 public class Solution { public String getPermutation(int n, int k) {   // initialize all numbers ArrayList numberList = new ArrayList(); for (int i = 1; i <= n; i++) { numberList.add(i); }   // change k to be index k--;   // set factorial of n int mod = 1; for (int i = 1; i <= n; i++) { mod = mod * i; }   String result = "";   // find sequence for (int i = 0; i < n;

Read full article from LeetCode – Permutation Sequence (Java)