0

我有 2 个这样的数组列表，但我不确定如何将它们组合在一起。我已经尝试过 Collections.copy() 和 addAll 方法，但它不起作用，我想知道是否有任何方法可以将它们组合到另一个数组列表中？我真正想要的是让第一个数组列表存储来自第二个数组列表的数据，所以每个点里面都会有几行。也许你们可以给我一些关于我如何做到这一点的建议，谢谢。

 static ArrayList<Vertex> getPoints() {
      Scanner input = Reader(Vertex.airports);
      ArrayList<Vertex> result = new ArrayList<Vertex>();

      while(input.hasNext()){
          String point = input.nextLine();
          result.add(new Vertex(point));

      }
      input.close();
      return result;

  }

  static ArrayList<Edge> getlines(){
          Scanner input = Reader(Vertex.graph);
          ArrayList<Edge> result = new ArrayList<Edge>();

          while(input.hasNext()){
              String route = input.nextLine();
              result.add(new Edge(route));
          }
          input.close();
          return result;

      }

数据来自 2 个文本文件，文件如下所示。它们只是其中的一部分，以展示我在这里尝试做的事情。（索引，名称）

1 England
2 France

3 荷兰

（索引，开始，成本，结束） 

1 1 2 2
2 1 3 1
3 1 6 3
4 1 7 3
5 2 1 2
6 2 3 1
7 2 4 1
8 2 5 2
9 2 6 2
10 3 1 1
11 3 2 1
12 3 4 1
13 3 8 1
14 3 10 2

感谢福特船长，这已经完成了！

4

2 回答 2

1

好吧，我的理解是第一个列表包含一个机场列表，第二个列表连接第一个列表中的机场。

如果要存储对具有关联点的线的引用，则需要在包含另一个列表的点周围创建一个包装器。

class Airport {
    public Vertex point;
    public List<Edge> routes = new ArrayList<Edge>();

    public Airport(Vertex p){
        this.point = p;
    }
}

然后，当您加载列表时，您将执行以下操作：

static ArrayList<Airport> getAirports() {
    Scanner input = Reader(Vertex.airports);
    ArrayList<Vertex> result = new ArrayList<Vertex>();

    while(input.hasNext()){
        String point = input.nextLine();
        //  Note the small change on the next line
        result.add(new Airport(new Vertex(point)));

    }
    input.close();
    return result;
}

static ArrayList<Edge> getlines(){
    Scanner input = Reader(Vertex.graph);
    ArrayList<Edge> result = new ArrayList<Edge>();

    while(input.hasNext()){
        String route = input.nextLine();
        result.add(new Edge(route));
    }
    input.close();
    return result;

}

static void combineLists(List<Airport> airports, List<Edge> lines){
    for(Edge edge : lines){
        //  This is where we add the routes to both airports
        //  Since I don't know the structure of the edge class, I'm making a guess that you're using the integer indices that were described in the file to describe the endpoints. Note, however, that you will need to find a way to guarantee that they match the indices of the list of airports.
        airports.get(edge.p1).routes.add(edge);
        airports.get(edge.p2).routes.add(edge);
    }
}
于 2013-03-02T20:45:17.657 回答
0

我想我可以改进我的其他答案。

更完整的解决方案如下所示：

import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Airport {
    public final int id;
    public String name;
    public List<Route> outboundRoutes = new ArrayList<Route>();
    public List<Route> inboundRoutes = new ArrayList<Route>();

    public double minDistance;
    public Airport previous;

    public Airport(int id, String name){
        this.id = id;
        this.name = name;
    }

    public static class Route {
        public final int id;
        public double cost;
        public Airport departure;
        public Airport destination;

        public Route(int id, double cost, Airport departure, Airport destination){
            this.id = id;
            this.cost = cost;
            this.departure = departure;
            this.destination = destination;
        }
    }


    public static Map<Integer,Airport> readAirports(Scanner input){
        Map<Integer,Airport> airports = new HashMap<Integer,Airport>();
        while(input.hasNext()){
            //  Using a map rather than a list simplifies the process of loading 
            //  your routes, and eliminates problems that would crop up if some
            //  airports are listed out of order or removed.
            Airport port = new Airport(input.nextInt(), input.next());
            airports.put(port.id, port);
        }
        return airports;
    }


    //  Note that the list of airports must be passed when loading the routes, 
    //  but that nothing is returned -- the routes are loaded directly 
    //  into the airports.
    public static void readRoutes(Scanner input, Map<Integer,Airport> airports){

        while(input.hasNext()){
            int id = input.nextInt();
            int departureId = input.nextInt();
            int destinationId = input.nextInt();
            double cost = input.nextDouble();

            if(!(airports.containsKey(departureId) && 
                    airports.containsKey(destinationId))){
                //  You'll have to decide how to handle a situation when a route 
                //  refers to airports that don't exist
                throw new RuntimeException(
                        "Undefined airport referenced in route #" + id);
            }

            Route route = new Route(id, cost, airports.get(departureId), 
                    airports.get(destinationId));
            route.departure.outboundRoutes.add(route);
            route.destination.inboundRoutes.add(route);
        }
    }

    public static Map<Integer,Airport> loadAirports() throws FileNotFoundException {
        Scanner inAirports = new Scanner(new File("airports.txt"));
        Scanner inRoutes = new Scanner(new File("routes.txt"));
        Map<Integer,Airport> airports = readAirports(inAirports);
        readRoutes(inRoutes, airports);
        return airports;
    }

    public static void main(String[] args){
        try {
            Map<Integer,Airport> airports = loadAirports();
            for(Airport port : airports.values()){
                System.out.println(port.name + " has " + port.inboundRoutes.size() + " inbound routes and " + port.outboundRoutes.size() + " outbound routes ");
                for(Route r : port.inboundRoutes){
                    System.out.println("\tin from " + r.departure.name + " at a cost of $" + r.cost);
                }
                for(Route r : port.outboundRoutes){
                    System.out.println("\tout to " + r.destination.name + " at a cost of $" + r.cost);
                }
            }

        } catch (IOException e){
            e.printStackTrace();
        }
    }
}

如果您想要一个简单、直接的答案，那么如果不进行某种嵌套，就无法完成您想要对 ArrayLists 执行的操作。

由于您正在处理具有 ID 的数据，因此我强烈建议您无论如何都使用 HashMap，这样您就不必担心数据的顺序不完美。由于您有元数据（机场名称），因此创建这些类是对数据建模的好方法。

编辑：代码现在已更改为全部适合一个文件。使用您提供的示例文件分别称为“airports.txt”和“routes.txt”，它应该可以正常工作。当你运行它时，你应该得到以下输出：

England(LHR) has 4 inbound routes and 4 outbound routes 
    in from France(CDG) at a cost of $2.0
    in from Holland(AMS) at a cost of $1.0
    in from Portugal(LIS) at a cost of $3.0
    in from Iceland(KEF) at a cost of $3.0
    out to France(CDG) at a cost of $2.0
    out to Holland(AMS) at a cost of $1.0
    out to Portugal(LIS) at a cost of $3.0
    out to Iceland(KEF) at a cost of $3.0
France(CDG) has 5 inbound routes and 5 outbound routes 
    in from England(LHR) at a cost of $2.0
    in from Holland(AMS) at a cost of $1.0
    in from Germany(FRA) at a cost of $1.0
    in from Italy(LIN) at a cost of $2.0
    in from Portugal(LIS) at a cost of $2.0
    out to England(LHR) at a cost of $2.0
    out to Holland(AMS) at a cost of $1.0
    out to Germany(FRA) at a cost of $1.0
    out to Italy(LIN) at a cost of $2.0
    out to Portugal(LIS) at a cost of $2.0
Holland(AMS) has 5 inbound routes and 5 outbound routes 
    in from England(LHR) at a cost of $1.0
    in from France(CDG) at a cost of $1.0
    in from Germany(FRA) at a cost of $1.0
    in from Denmark(CPH) at a cost of $1.0
    in from Finland(HEL) at a cost of $2.0
    out to England(LHR) at a cost of $1.0
    out to France(CDG) at a cost of $1.0
    out to Germany(FRA) at a cost of $1.0
    out to Denmark(CPH) at a cost of $1.0
    out to Finland(HEL) at a cost of $2.0
Germany(FRA) has 4 inbound routes and 4 outbound routes 
    in from France(CDG) at a cost of $1.0
    in from Holland(AMS) at a cost of $1.0
    in from Italy(LIN) at a cost of $1.0
    in from Sweden(ARN) at a cost of $2.0
    out to France(CDG) at a cost of $1.0
    out to Holland(AMS) at a cost of $1.0
    out to Italy(LIN) at a cost of $1.0
    out to Sweden(ARN) at a cost of $2.0
Italy(LIN) has 3 inbound routes and 3 outbound routes 
    in from France(CDG) at a cost of $2.0
    in from Germany(FRA) at a cost of $1.0
    in from Portugal(LIS) at a cost of $3.0
    out to Portugal(LIS) at a cost of $3.0
    out to France(CDG) at a cost of $2.0
    out to Germany(FRA) at a cost of $1.0
Portugal(LIS) has 3 inbound routes and 3 outbound routes 
    in from England(LHR) at a cost of $3.0
    in from France(CDG) at a cost of $2.0
    in from Italy(LIN) at a cost of $3.0
    out to England(LHR) at a cost of $3.0
    out to France(CDG) at a cost of $2.0
    out to Italy(LIN) at a cost of $3.0
Iceland(KEF) has 1 inbound routes and 1 outbound routes 
    in from England(LHR) at a cost of $3.0
    out to England(LHR) at a cost of $3.0
Denmark(CPH) has 2 inbound routes and 2 outbound routes 
    in from Holland(AMS) at a cost of $1.0
    in from Norway(OSL) at a cost of $1.0
    out to Holland(AMS) at a cost of $1.0
    out to Norway(OSL) at a cost of $1.0
Norway(OSL) has 2 inbound routes and 2 outbound routes 
    in from Denmark(CPH) at a cost of $1.0
    in from Sweden(ARN) at a cost of $1.0
    out to Denmark(CPH) at a cost of $1.0
    out to Sweden(ARN) at a cost of $1.0
Finland(HEL) has 2 inbound routes and 2 outbound routes 
    in from Holland(AMS) at a cost of $2.0
    in from Sweden(ARN) at a cost of $1.0
    out to Sweden(ARN) at a cost of $1.0
    out to Holland(AMS) at a cost of $2.0
Sweden(ARN) has 3 inbound routes and 3 outbound routes 
    in from Germany(FRA) at a cost of $2.0
    in from Norway(OSL) at a cost of $1.0
    in from Finland(HEL) at a cost of $1.0
    out to Germany(FRA) at a cost of $2.0
    out to Norway(OSL) at a cost of $1.0
    out to Finland(HEL) at a cost of $1.0
于 2013-03-02T21:16:41.207 回答