所以我一直在尝试创建一个1和0的矩阵,然后搜索1的最大正方形(块)。我想使用GridPane来显示矩阵。但是由于这行grid.add(z,i,j),我一直收到错误;我怎样才能解决这个问题?我在做什么/不明白导致这不能编译和运行? 这是我的代码:
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
package cs211;
import javafx.application.Application;
import javafx.scene.Group;
import javafx.scene.Scene;
import javafx.scene.layout.BorderPane;
import javafx.scene.layout.ColumnConstraints;
import javafx.scene.layout.GridPane;
import javafx.scene.layout.Pane;
import javafx.scene.layout.RowConstraints;
import javafx.scene.paint.Color;
import javafx.scene.text.Text;
import javafx.stage.Stage;
/**
*
* @author KeQinWu
*/
public class LargestBlock extends Application{
public Group root=new Group();
public GridPane grid=new GridPane();
public int[][] xy=new int[10][10];
public void init(){
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
xy[i][j]=(int)(Math.random()*2);
}
}
}
public GridPane addGridPane(){
grid.setHgap(10);
grid.setVgap(10);
grid.getColumnConstraints().add(new ColumnConstraints(10)); // column 1 is 10 wide
grid.getRowConstraints().add(new RowConstraints(10)); // column 1 is 10 wide
Text z=new Text("0");
Text o=new Text("1");
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
if(xy[i][j]==0)
grid.add(z,i,j);
if(xy[i][j]==1)
grid.add(o, i, j);
}
}
return grid;
}
@Override
public void start(Stage stage){
init();
BorderPane bp=new BorderPane();
bp.setCenter(addGridPane());
bp.getChildren();
root.getChildren().add(bp);
Scene scene=new Scene(root,250,250,Color.BEIGE);
stage.setTitle("Num Pane");
stage.setScene(scene);
stage.show();
}
public static void main(String[] args){
Application.launch(args);
}
}
答案 0 :(得分:1)
所以问题是您尝试多次添加子项(Text z
和Text o
),导致此错误:
java.lang.IllegalArgumentException: Children: duplicate children added: parent = Grid hgap=10.0, vgap=10.0, alignment=TOP_LEFT
将构造函数移动到循环内部:
for(int j=0;j<9;j++){
if(xy[i][j]==0)
Text z = new Text("0");
grid.add(z,i,j);
if(xy[i][j]==1)
Text o = new Text("1");
grid.add(o, i, j);
}
每次需要时都会创建一个新实例,而不是在开头创建单个实例。