格雷码Java

n为元格雷码是由n-1为格雷码实现的：

public String[] GrayCode(int n) {  
  
	// produce 2^n grade codes  
	String[] graycode = new String[(int) Math.pow(2, n)];  
  
	if (n == 1) {  
		graycode[0] = "0";  
		graycode[1] = "1";  
		return graycode;  
	}  
  
	String[] last = GrayCode(n - 1);  
  
	for (int i = 0; i < last.length; i++) {  
		graycode[i] = "0" + last[i];  
		graycode[graycode.length - 1 - i] = "1" + last[i];  
	}  
  
	return graycode;  
}