/**
 * 模擬結(jié)點(diǎn)
 */
public class SingleNode {
    /**
     * @row 行號(hào)
     * @column 列號(hào)
     * @num 值
     */
    public int row;
    public int colunm;
    public int num;
    /**
     *next域：指向下一個(gè)結(jié)點(diǎn)
     */
    public SingleNode next;

    public SingleNode(int row, int colunm, int num) {
        this.row = row;
        this.colunm = colunm;
        this.num = num;
    }

    @Override
    public String toString() {
        return "SingleNode{" + "row=" + row + ", colunm=" + colunm + ", num=" + num + '}';
    }
}

public class SingleLinkList {
    //頭節(jié)點(diǎn)
    private SingleNode headSingleNode;
	//通過構(gòu)造行數(shù)初始化頭節(jié)點(diǎn)
    public SingleLinkList(SingleNode headSingleNode) {
        this.headSingleNode = headSingleNode;
    }

    /**
     * 添加結(jié)點(diǎn)(追加在鏈表的尾端)
     */
    public void add(SingleNode SingleNode){
        SingleNode temp = headSingleNode;
        while(true){
            if (temp.next == null) {
                //如果這個(gè)結(jié)點(diǎn)的next域?yàn)榭站吞鰓hile循環(huán)
                break;
            }
            //將下一個(gè)結(jié)點(diǎn)賦值給temp
            temp = temp.next;
        }
        temp.next= SingleNode;
    }
    /**
     * 遍歷單項(xiàng)鏈表
     */
    public void show(){
        if (headSingleNode.next == null) {
            System.out.println("當(dāng)前鏈表為空");
            return;
        }
        SingleNode temp = headSingleNode;
        while (true){
            if (temp.next == null){
                break;
            }
            temp = temp.next;
            System.out.println(temp);
        }
    }

    /**
     * 將鏈表還原成二維數(shù)組
     * @return array還原后的二維數(shù)組
     */
    public int[][] backToArray(){
        SingleNode temp = headSingleNode;
        //頭結(jié)點(diǎn)中存儲(chǔ)著原數(shù)組的行數(shù)和列數(shù)
        //通過這兩個(gè)值創(chuàng)建二維數(shù)組
        int[][] array = new int[headSingleNode.row][headSingleNode.colunm];
        while (true){
            if (temp.next == null){
                break;
            }
            temp = temp.next;
            //每遍歷一個(gè)結(jié)點(diǎn)就還原一個(gè)數(shù)據(jù)
            array[temp.row][temp.colunm] = temp.num;
        }
        return array;
    }
}

public class ArrayToLink {
    public static void main(String[] args) {
        int[][] array = new int[4][5];
        //初始化二維數(shù)組
        array[0][2] = 1;
        array[1][1] = 2;
        array[2][3] = 3;

        System.out.println("========普通數(shù)組========");
        //遍歷二維數(shù)組
        int count = 0;
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[i].length; j++) {
                if (array[i][j]!=0){
                    count++;
                }
                System.out.print(array[i][j] + " ");
            }
            System.out.println();
        }

        //將數(shù)組轉(zhuǎn)化成鏈?zhǔn)酱鎯?chǔ)
        SingleLinkList list = new SingleLinkList(new SingleNode(array.length,array[0].length,count));
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[i].length; j++) {
                if (array[i][j] != 0){
                	//當(dāng)數(shù)字不為0時(shí)視為有效值就創(chuàng)建一個(gè)結(jié)點(diǎn)并添加到鏈表尾部
                    list.add(new SingleNode(i,j,array[i][j]));
                }
            }
        }
        System.out.println("========轉(zhuǎn)化后的鏈表========");
        //遍歷單向鏈表
        list.show();

        int[][] returnArray = list.backToArray();
        //遍歷還原后的二維數(shù)組
        System.out.println("========還原后的數(shù)組========");
        for (int i = 0; i < returnArray.length; i++) {
            for (int j = 0; j < returnArray[i].length; j++) {
                System.out.print(returnArray[i][j] + " ");
            }
            System.out.println();
        }
    }
}