weixin_43509224 2019-03-25 21:20 采纳率: 0%
浏览 167

如何把这个段代码不改变意思 更改成一个跟为简便的方法

public String displayString() {
String s = "";
for(int i = 0; i < size; i++) { // for each row
for (FutoshikiSquare[] g : grid) { // print tops of cells separated by spaces
s += "-";
for (int j = 0; j < digit; j++) {
s += "-";
}
s += "- ";
}
s += "\n";

        for(int j = 0; j < size; j++) {                                     // for each column in that row
            s += "|" + grid[i][j].toString() + "|";                         // print | then contents then |
            if (j >= size - 1) break;                                       // if column is not the last                           
            if (constraints.isEmpty()) {
                    s += " ";
            } else {
                for (int k = 0; k < constraints.size(); k++) {                  // print horizontal constraints between that column and next
                    if (constraints.get(k).compares(grid[i][j], 
                            grid[i][j+1])) {
                        s += constraints.get(k).get();
                        break;
                    }
                    if (k == constraints.size() - 1) {
                        s += " ";
                        break;
                    }
                }
            }
        }
        s += " \n";
        // end of for each column
        for (FutoshikiSquare[] g : grid) {                                  // print bottoms of cells separated by spaces
            s += "-";
            for (int j = 0; j < digit; j ++) {
                s += "-";
            }
            s += "- ";
        }
        s += "\n";

        if(i >= size - 1) break;
        for(int j = 0; j < size; j++) {                                     // print vertical constraint between this row and next
            for (int k = 0; k < digit / 2 + 1; k++) {
                s += " ";
            }
            if (constraints.isEmpty()) {
                    s += " ";
            } else {
                for (int k = 0; k < constraints.size(); k++) {
                    if (constraints.get(k).compares(grid[i][j], 
                            grid[i+1][j])) {
                        s += constraints.get(k).get();
                        break;
                    }
                    if (k == constraints.size() - 1) {
                        s += " ";
                        break;
                    }
                }
            }
            if (digit % 2 == 1) {
                s += " ";
            }
            for (int k = 0; k < digit / 2 + 1; k++) {
                s += " ";
            }
        }
        s += "\n";
    }
    return s;
}
  • 写回答

0条回答 默认 最新

    报告相同问题?

    悬赏问题

    • ¥15 求差集那个函数有问题,有无佬可以解决
    • ¥15 【提问】基于Invest的水源涵养
    • ¥20 微信网友居然可以通过vx号找到我绑的手机号
    • ¥15 寻一个支付宝扫码远程授权登录的软件助手app
    • ¥15 解riccati方程组
    • ¥15 display:none;样式在嵌套结构中的已设置了display样式的元素上不起作用?
    • ¥15 使用rabbitMQ 消息队列作为url源进行多线程爬取时,总有几个url没有处理的问题。
    • ¥15 Ubuntu在安装序列比对软件STAR时出现报错如何解决
    • ¥50 树莓派安卓APK系统签名
    • ¥65 汇编语言除法溢出问题