package com.zjn.LinkAndQueue;
/**
 * 自定義鏈表設(shè)計(jì)
 * 
 * @author zjn
 *
 */
public class MyLink {
	Node head = null;
	// 頭節(jié)點(diǎn)
	/**
   * 鏈表中的節(jié)點(diǎn)，data代表節(jié)點(diǎn)的值，next是指向下一個(gè)節(jié)點(diǎn)的引用
   * 
   * @author zjn
   *
   */
	class Node {
		Node next = null;
		// 節(jié)點(diǎn)的引用，指向下一個(gè)節(jié)點(diǎn)
		int data;
		// 節(jié)點(diǎn)的對(duì)象，即內(nèi)容
		public Node(int data) {
			this.data = data;
		}
	}
	/**
   * 向鏈表中插入數(shù)據(jù)
   * 
   * @param d
   */
	public void addNode(int d) {
		Node newNode = new Node(d);
		// 實(shí)例化一個(gè)節(jié)點(diǎn)
		if (head == null) {
			head = newNode;
			return;
		}
		Node tmp = head;
		while (tmp.next != null) {
			tmp = tmp.next;
		}
		tmp.next = newNode;
	}
	/**
   * 
   * @param index:刪除第index個(gè)節(jié)點(diǎn)
   * @return
   */
	public Boolean deleteNode(int index) {
		if (index < 1 || index > length()) {
			return false;
		}
		if (index == 1) {
			head = head.next;
			return true;
		}
		int i = 1;
		Node preNode = head;
		Node curNode = preNode.next;
		while (curNode != null) {
			if (i == index) {
				preNode.next = curNode.next;
				return true;
			}
			preNode = curNode;
			curNode = curNode.next;
			i++;
		}
		return false;
	}
	/**
   * 
   * @return 返回節(jié)點(diǎn)長(zhǎng)度
   */
	public int length() {
		int length = 0;
		Node tmp = head;
		while (tmp != null) {
			length++;
			tmp = tmp.next;
		}
		return length;
	}
	/**
   * 在不知道頭指針的情況下刪除指定節(jié)點(diǎn)
   * 
   * @param n
   * @return
   */
	public Boolean deleteNode11(Node n) {
		if (n == null || n.next == null)
		      return false;
		int tmp = n.data;
		n.data = n.next.data;
		n.next.data = tmp;
		n.next = n.next.next;
		System.out.println("刪除成功！");
		return true;
	}
	public void printList() {
		Node tmp = head;
		while (tmp != null) {
			System.out.println(tmp.data);
			tmp = tmp.next;
		}
	}
	public static void main(String[] args) {
		MyLink list = new MyLink();
		list.addNode(5);
		list.addNode(3);
		list.addNode(1);
		list.addNode(2);
		list.addNode(55);
		list.addNode(36);
		System.out.println("linkLength:" + list.length());
		System.out.println("head.data:" + list.head.data);
		list.printList();
		list.deleteNode(4);
		System.out.println("After deleteNode(4):");
		list.printList();
	}
}

/**
   * 鏈表反轉(zhuǎn)
   * 
   * @param head
   * @return
   */
  public Node ReverseIteratively(Node head) {
    Node pReversedHead = head;
    Node pNode = head;
    Node pPrev = null;
    while (pNode != null) {
      Node pNext = pNode.next;
      if (pNext == null) {
        pReversedHead = pNode;
      }
      pNode.next = pPrev;
      pPrev = pNode;
      pNode = pNext;
    }
    this.head = pReversedHead;
    return this.head;
  }

/**
   * 查找單鏈表的中間節(jié)點(diǎn)
   * 
   * @param head
   * @return
   */
  public Node SearchMid(Node head) {
    Node p = this.head, q = this.head;
    while (p != null && p.next != null && p.next.next != null) {
      p = p.next.next;
      q = q.next;
    }
    System.out.println("Mid:" + q.data);
    return q;
  }

/**
   * 查找倒數(shù) 第k個(gè)元素
   * 
   * @param head
   * @param k
   * @return
   */
  public Node findElem(Node head, int k) {
    if (k < 1 || k > this.length()) {
      return null;
    }
    Node p1 = head;
    Node p2 = head;
    for (int i = 0; i < k; i++)// 前移k步
      p1 = p1.next;
    while (p1 != null) {
      p1 = p1.next;
      p2 = p2.next;
    }
    return p2;
  }

/**
   * 排序
   * 
   * @return
   */
public Node orderList() {
	Node nextNode = null;
	int tmp = 0;
	Node curNode = head;
	while (curNode.next != null) {
		nextNode = curNode.next;
		while (nextNode != null) {
			if (curNode.data > nextNode.data) {
				tmp = curNode.data;
				curNode.data = nextNode.data;
				nextNode.data = tmp;
			}
			nextNode = nextNode.next;
		}
		curNode = curNode.next;
	}
	return head;
}

/**
   * 刪除重復(fù)節(jié)點(diǎn)
   */
  public void deleteDuplecate(Node head) {
    Node p = head;
    while (p != null) {
      Node q = p;
      while (q.next != null) {
        if (p.data == q.next.data) {
          q.next = q.next.next;
        } else
          q = q.next;
      }
      p = p.next;
    }

  }

/**
   * 從尾到頭輸出單鏈表，采用遞歸方式實(shí)現(xiàn)
   * 
   * @param pListHead
   */
  public void printListReversely(Node pListHead) {
    if (pListHead != null) {
      printListReversely(pListHead.next);
      System.out.println("printListReversely:" + pListHead.data);
    }
  }

/**
   * 判斷鏈表是否有環(huán)，單向鏈表有環(huán)時(shí)，尾節(jié)點(diǎn)相同
   * 
   * @param head
   * @return
   */
  public boolean IsLoop(Node head) {
    Node fast = head, slow = head;
    if (fast == null) {
      return false;
    }
    while (fast != null && fast.next != null) {
      fast = fast.next.next;
      slow = slow.next;
      if (fast == slow) {
        System.out.println("該鏈表有環(huán)");
        return true;
      }
    }
    return !(fast == null || fast.next == null);
  }

  /**
   * 找出鏈表環(huán)的入口
   * 
   * @param head
   * @return
   */
  public Node FindLoopPort(Node head) {
    Node fast = head, slow = head;
    while (fast != null && fast.next != null) {
      slow = slow.next;
      fast = fast.next.next;
      if (slow == fast)
        break;
    }
    if (fast == null || fast.next == null)
      return null;
    slow = head;
    while (slow != fast) {
      slow = slow.next;
      fast = fast.next;
    }
    return slow;
  }