PAT 乙级 1075 Java

三个测试点通过，两个测试点错误，一个测试点超时。。。为什么C++会比Java快这么多，难过.jpg

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;

/**
 * 1075
 * @author quchu
 * @date 2019/10/30
 * 时间复杂度O(n)
 */
public class Main {
    public static void main(String[] args) throws Exception{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String [] inputStr=br.readLine().split("[ ]");
        String firstAddress=inputStr[0];//第一个节点的地址
        int nodeCount=Integer.parseInt(inputStr[1]);//节点总个数
        int splitNum=Integer.parseInt(inputStr[2]);//正整数K
        List<NodeEntity> nodeEntityList = new ArrayList<>();
        HashMap<String, NodeEntity> nodes = new HashMap<>();
        for (int i = 0; i < nodeCount; i++) {
            String [] node=br.readLine().split("[ ]");
            NodeEntity nodeEntity = new NodeEntity();
            nodeEntity.setAddress(node[0]);
            nodeEntity.setData(Integer.parseInt(node[1]));
            nodeEntity.setNext(node[2]);
            nodes.put(node[0],nodeEntity);
        }
        //按照节点的顺序将节点存储到ArrayList中
        int flag=0;
        String next="";
        while(nodeEntityList.size()<nodeCount){
            if(nodes.containsKey(firstAddress) && flag==0){
                //加入头节点
                nodeEntityList.add(nodes.get(firstAddress));
                flag=1;
                next=nodes.get(firstAddress).getNext();
            }
            //先存储next的node，然后修改next的值
            nodeEntityList.add(nodes.get(next));
            next=nodes.get(next).getNext();
        }
        //最后存储结果的数组
        List<NodeEntity> result = new ArrayList<>();
        //1:首先将对应的负元素按照存储的位置获取到
        for (NodeEntity nodeEntity : nodeEntityList) {
            if(nodeEntity.getData()<0){
                result.add(nodeEntity);
            }
        }
        //2:将小于K的元素继续存储
        for (NodeEntity nodeEntity : nodeEntityList) {
            if(nodeEntity.getData()>=0&&nodeEntity.getData()<=splitNum){
                result.add(nodeEntity);
            }
        }
        //3:将大于K的元素继续存储
        for (NodeEntity nodeEntity : nodeEntityList) {
            if(nodeEntity.getData()>splitNum){
                result.add(nodeEntity);
            }
        }
        //4:修改每个节点的next的值；
        for (int i = 0; i < result.size()-1; i++) {
            result.get(i).setNext(result.get(i+1).getAddress());
            if(i==(result.size()-2)){
                result.get(i+1).setNext("-1");
            }
        }
        //5：打印输出
        for (NodeEntity nodeEntity : result) {
            System.out.println(nodeEntity.getAddress()+" "+nodeEntity.getData()+" "+nodeEntity.getNext());
        }
    }
}

class NodeEntity{
    private String address;
    private int data;
    private String next;

    public String getAddress() {
        return address;
    }

    public void setAddress(String address) {
        this.address = address;
    }

    public int getData() {
        return data;
    }

    public void setData(int data) {
        this.data = data;
    }

    public String getNext() {
        return next;
    }

    public void setNext(String next){
        this.next=next;
    }

    @Override
    public String toString() {
        return "NodeEntity{" +
                "address='" + address + '\'' +
                ", data=" + data +
                ", next=" + next +
                '}';
    }
}