permutation sequence (find kth permutation sequence)
* 要知道每个position的数是k/(n-1)!
* 用过的element要去掉,所以要新建一个list里面有一列数
*开始要k--来match list里面的element
public String getPermutation(int n, int k) {
if (n<=0 || k<=0) return null;
k--;
int fact = 1;
for (int i=2;i<n;i++) {
fact *= i;
}
int round = n-1;
List<Integer> elem = new ArrayList<Integer>();
for (int i=1;i<=n;i++) {
elem.add(i);
}
StringBuilder sb = new StringBuilder();
while (round>=0) {
int index = k/fact;
k=k%fact;
sb.append(elem.get(index));
elem.remove(index);
if (round!=0) fact/=round;
round--;
}
return sb.toString();
}
前一半在开头加0(这样只differ一位)
后一半倒序并在开头加1 (这样中间两个只differ开头的那一位,而后面的也只differ一位)
public List<Integer> grayCode(int n) {
ArrayList<Integer> res = new ArrayList<Integer>();
if (n<0) return res;
if (n==0) {
res.add(0);
return res;
}
res.add(0);
res.add(1);
for (int i=2;i<=n;i++) {
int size = res.size();
for (int j=size-1;j>=0;j--) {
res.add(res.get(j)+(1<<(i-1)));
}
}
return res;
}