package Week03;

public class LinkedList
{
     NumNode list;
     NumNode head1 = new NumNode(0);
     int nWangYuHan = 0;

    public LinkedList()
    {
        head1.next = null;
    }

    public void InsertNode(int num, int a) {
        head1.next = list;
        NumNode node = new NumNode(num);
        NumNode temp = head1;

        for (int x = 0; x < a - 1; x++){
            temp = temp.next;
        }
        if (temp.next == null){
            temp.next = node;
            nWangYuHan++;
        }
        else {
            NumNode node1 = temp.next;
            temp.next = node;
            node.next = node1;
            nWangYuHan++;
        }
    }

    public void add(int num)
    {
        NumNode node = new NumNode(num);
        NumNode current;
        if (list == null)
        {
            list = node;
            nWangYuHan++;
        }
        else
        {
            current = list;
            while (current.next != null)
            {
                current = current.next;
            }
            current.next = node;
            nWangYuHan++;
        }
        head1.next = list;
    }
    public int size(){
        return nWangYuHan;
    }

    public void sort()
    {
        NumNode min;
        int temp;
        NumNode numNode = head1.next;
        numNode.next = list;

        while (numNode != null)
        {
            min = numNode;
            NumNode current = min.next;
            while (current!=null)
            {
                if(Integer.parseInt(String.valueOf(min.number)) > Integer.parseInt(String.valueOf(current.number)))
                {
                    min = current ;
                }
                current = current.next;
            }
            temp = min.number;
            min.number = numNode.number;
            numNode.number = temp;

            numNode  = numNode.next;
        }
    }

    public void BubbleSort() {
        String str = "";
        NumNode current = head1.next;
        int n = 0;
        while (current != null)
        {
            str += current.number + " ";
            current = current.next;
        }
        String[] arr = str.split("\\s");
        int wangyuhan = arr.length;
        System.out.println("当前链表为：");
        for(String num:arr){
            System.out.print(num + " ");
        }
        System.out.println("当前有" + arr.length + "个元素在链表中");
        for(int i=0;i<arr.length-1;i++){
            for (int j = 0; j < arr.length - 1; j++){
                if (Integer.parseInt(arr[j]) > Integer.parseInt(arr[j + 1])){
                    String temp = arr[j];
                    arr[j] =arr[j + 1];
                    arr[j + 1] = temp;
                }
                n++;
                System.out.println("(第" + n +"次排序)");
                System.out.println("当前链表为：");
                for(String num:arr){
                    System.out.print(num + " ");
                }
                System.out.println("当前有" + wangyuhan + "个元素在链表中");
            }
        }
        System.out.println("(第" + n +"次排序)");
        System.out.println("当前数组为：");
        for(String num:arr){
            System.out.print(num + " ");
        }
        System.out.println("当前有" + wangyuhan + "个元素在链表中");
    }

    public void delete(int k){
        NumNode first = head1.next;
        first.next = list;
        NumNode PreNode, Currentnode = head1;
        for (int x = 0; x < k; x++){
            Currentnode = Currentnode.next;
        }
        if (Currentnode.next != null){
                PreNode = Currentnode;
                Currentnode = Currentnode.next;
                PreNode.next = Currentnode.next;
                nWangYuHan--;
        }
        else{
            PreNode = Currentnode;
            PreNode.next = null;
            nWangYuHan--;
        }
    }
        @Override
    public String toString()
    {
        String result = "";

        NumNode current = head1.next;
        while (current != null)
        {
            result += current.number + " ";
            current = current.next;
        }
        return result;
    }

    private class NumNode{
        public int number;
        public NumNode next;

        public NumNode(int number)
        {
            this.number = number;
            next = null;
        }

    }

}