代码优化

for (int i = 0; i < n; i++) {
                StringBuilder sb = new StringBuilder();
                int queenPos = queens[i];//第i行皇后所在列
                for (int j = 0; j < queenPos; j++) {
                    sb.append('.');
                }
                sb.append('Q');
                for (int k = queenPos + 1; k < n; k++) {
                    sb.append('.');
                }
                list.add(sb.toString());
        }

		StringBuilder sb = new StringBuilder();
        for(int j = 0; j < n; j++) {
            if(queens[i] == j) {
                sb.append("Q");
            }else{
                sb.append(".");
            }
        }
        list.add(sb.toString());
			


第一段比第二段效率高