Question

大家好，这是我的第一篇文章，我对Java很新。在发布此内容之前，我确实在网站上搜索了重复内容，并看到了一些相似但不太相似的情况，以便我能够提供有效的解决方案。

我试图从两个一维数组X1 []和X2 []构建一个二维数组double X [] []。

以前在下面的代码中，X1 []和X2 []分别在第10行和第11行初始化：

double[] degree = new double[numNodes];
for (int id = 0; id < numNodes; id++){
    Vector neighbors = (Vector) netInfo.get(id);
    System.out.println(id+" "+neighbors+" "+neighbors.size() );
    degree[id] = neighbors.size();
}

double X1[] = new double[edgeList.size()];
double X2[] = new double[edgeList.size()];
double Y[] = new double[edgeList.size()]; //EBWC which is also 1-NOVER

for (int edgeIndex = 0; edgeIndex < edgeList.size(); edgeIndex++){
    String edge = (String) edgeList.get(edgeIndex);
    StringTokenizer stk = new StringTokenizer(edge);
    int uID = Integer.parseInt(stk.nextToken());
    int vID = Integer.parseInt(stk.nextToken());
    X1[edgeIndex] = degree[uID];
    X2[edgeIndex] = degree[vID];                                                                                  
    Vector uNeighbors = (Vector) netInfo.get(uID);
    Vector vNeighbors = (Vector) netInfo.get(vID);
    // finding the intersection
    Vector commonNeighbors = new Vector();
    for (int uindex = 0; uindex < uNeighbors.size(); uindex++){
        int uNeighbID = ( (Integer) uNeighbors.get(uindex) ).intValue();
        if (vNeighbors.contains(uNeighbID)) {
           commonNeighbors.add(uNeighbID);
        }
        // check if uNeighbID is in vNeighbors
        // if it is there, add uNeighbID to commonNeighbors
    }                                       
    // finding the union
    Vector AllNeighbors = (Vector) uNeighbors.clone();
    //Set<Integer> temp=new HashSet<Integer>();
    for(int vindex = 0; vindex < vNeighbors.size(); vindex++){
       //temp.add(i);
       int i = ( (Integer) vNeighbors.get(vindex) ).intValue();
       if (!AllNeighbors.contains(i))
           AllNeighbors.add(i);
    }
    double NOVER = 0;
    if (AllNeighbors.size() > 2)
       NOVER = ( (double) commonNeighbors.size() )/ (AllNeighbors.size()-2);

    Y[edgeIndex] = 1 - NOVER;

    // using the intersection and union, find EBWC scores for the edge uID-vID as 1-NOVER(uID, vID)

    // put uID vID and the EBWC score for the edge to the TreeMap EBWC
   System.out.println(edgeIndex+" "+X1[edgeIndex]+" "+X2[edgeIndex]+" "+Y[edgeIndex]);
}

但是，我目前的问题是输入如下：
X1 X2
0 1

0 2

1 2

1 5

2 3

2 4

3 4

3 5

4 5

4 6

5 6

5 7

6 7

我想要的输出是：

X

0 1

0 2

1 2

1 5

2 3

2 4

3 4

3 5

4 5

4 6

5 6

5 7

6 7

我尝试了什么：

// construct the X[][] two-dim array using X1[] and X2[]

double[][] X = {X1, X2};
for (int rowIndex = 0; rowIndex < edgeList.size(); rowIndex++){
    for (int colIndex = 0; colIndex < 2(); colIndex++){
        System.out.print(X[rowIndex][colIndex]+" ");
    }
    System.out.println();
}

然而它引发了一个异常：java.lang.ArrayIndexOutOfBoundsException：2

任何想法，提示或示例都将不胜感激。我想知道我做错了什么。

Answer 1

[ -e file ] && rm file

这里有一个有效的例子。这应该可以帮助您解决问题

在java中如何将两个一维数组放入一个二维数组中？

1 个答案: