对数组结构体按照K值翻转

自己测试可以，但是PTA只能运行只能得4分，哪位大神帮我看看错哪了。

笔记和代码的思路来源：

好大学慕课浙江大学陈越、何钦铭的《数据结构》

package ygh.study.demo1;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/*
Given a constant KKK and a singly linked list LLL, you are supposed to reverse the links of every KKK elements on LLL. For example, given LLL being 1→2→3→4→5→6, if K=3K = 3K=3, then you must output 3→2→1→6→5→4; if K=4K = 4K=4, you must output 4→3→2→1→5→6.
Input Specification:

Each input file contains one test case. For each case, the first line contains the address of the first node, a positive NNN (≤105le 10^5≤10​5​​) which is the total number of nodes, and a positive KKK (≤Nle N≤N) which is the length of the sublist to be reversed. The address of a node is a 5-digit nonnegative integer, and NULL is represented by -1.

Then NNN lines follow, each describes a node in the format:

Address Data Next

where Address is the position of the node, Data is an integer, and Next is the position of the next node.
Output Specification:

For each case, output the resulting ordered linked list. Each node occupies a line, and is printed in the same format as in the input.
Sample Input:

00100 6 4
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218

Sample Output:

00000 4 33218
33218 3 12309
12309 2 00100
00100 1 99999
99999 5 68237
68237 6 -1
*/
public class Demo1 {

    public static void main(String[] args) {
        List<Node> nodeList = new ArrayList<Node>();
        // nodeList.add(new Node("00000", 4, "99999"));
        // nodeList.add(new Node("00100", 1, "12309"));
        // nodeList.add(new Node("68237", 6, "-1"));
        // nodeList.add(new Node("33218", 3, "00000"));
        // nodeList.add(new Node("12309", 2, "33218"));
        // nodeList.add(new Node("99999", 5, "68237"));
        Scanner sc = new Scanner(System.in);
        String initAddress = sc.next();
        int n = sc.nextInt();
        int k = sc.nextInt();
        for (int i = 0; i < n; i++) {
            String address = sc.next();
            int element = sc.nextInt();
            String nextAddrss = sc.next();
            Node node = new Node(address, element, nextAddrss);
            nodeList.add(node);
        }
        sc.close();
        List<Node> sortedList = sort(nodeList, initAddress, n);
        transmit(sortedList, k);
        for (Node node : sortedList) {
            System.out.println(node.toString());
            System.err.println();
        }

    }

    public static void transmit(List<Node> list, int k) {
        int length = list.size();
        int i = 0;
        if (length < k) {
            track(list, 0, length);
            return;
        } else {
            while (i <= length) {
                if (i + k <= length) {
                    track(list, i, i + k);
                    i = i + k;
                } else {
                    track(list, i + k, length);
                    i = i + k;
                }
            }
        }
    }

    public static void track(List<Node> list, int begin, int end) {
        int mid = (begin + end) / 2;
        for (int i = begin; i < mid; i++) {
            Node temp = list.get(i);
            list.set(i, list.get(end - i - 1));
            list.set(end - i - 1, temp);
        }
    }

    public static List<Node> sort(List<Node> list, String initAddress, int length) {
        List<Node> tempList = new ArrayList<Node>();
        tempList.add(getNodeByAddress(list, initAddress));
        for (int i = 1; i < length; i++) {
            tempList.add(getNodeByAddress(list, tempList.get(i - 1).getNextAddress()));
        }

        return tempList;
    }

    public static Node getNodeByAddress(List<Node> list, String address) {
        for (Node node : list) {
            if (node.getAddress().equals(address)) {
                return node;
            }
        }
        return null;
    }

}

class Node {
    private String address;

    private int element;

    private String nextAddress;

    public String getAddress() {
        return address;
    }

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

    public int getElement() {
        return element;
    }

    public void setElement(int element) {
        this.element = element;
    }

    public String getNextAddress() {
        return nextAddress;
    }

    public void setNextAddress(String nextAddress) {
        this.nextAddress = nextAddress;
    }

    public Node(String address, int element, String nextAddress) {
        super();
        this.address = address;
        this.element = element;
        this.nextAddress = nextAddress;
    }

    public Node() {
        super();
    }

    @Override
    public String toString() {
        return this.getAddress() + " " + this.getElement() + " " + this.getNextAddress();
    }

}