2016-7-27 13:26:20

Author: lxfgit

src/linkedlist/common/TNode.java

@@ -0,0 +1,25 @@
+package linkedlist.common;
+
+/**
+ * Created by LXF on 2016/7/27.
+ */
+public class TNode {
+    public int value;
+    public TNode next;
+
+    public TNode() {
+        this.next = null;
+    }
+
+    /*为添加一个节点的方法*/
+    public void add(int k) {
+        TNode t = this;
+        while (t.next != null) {
+            t = t.next;
+        }
+        TNode node = new TNode();
+        node.value = k;
+        t.next = node;
+        node.next = null;
+    }
+}

src/linkedlist/removeByRatio/RemoveByRatio.java

@@ -0,0 +1,46 @@
+package linkedlist.removeByRatio;
+
+import linkedlist.common.Node;
+import org.junit.Test;
+
+/**
+ * 根据链表长度n，删除链表a/b处的结点，向上取整。
+ * Created by LXF on 2016/7/27.
+ */
+public class RemoveByRatio {
+    public Node Remove(Node head, int a, int b) {
+        if (a < 1 || a > b) {
+            return head;
+        }
+        int n = 0;
+        Node cur = head;
+        while (cur != null) {
+            n++;
+            cur = cur.next;
+        }
+        n = (int) Math.ceil((double) (a * n) / (double) b);
+        if (n == 1) {
+            head = head.next;
+        }
+        if (n > 1) {
+            cur = head;
+            while (--n != 1) {
+                cur = cur.next;
+            }
+            cur.next = cur.next.next;
+        }
+        return head;
+    }
+
+    @Test
+    public void test() {
+        Node head = new Node(2);
+        head.add(3);
+        head.add(5);
+        head.add(8);
+        head.add(6);
+        RemoveByRatio removeByrRatio = new RemoveByRatio();
+        Node res = removeByrRatio.Remove(head, 3, 4);
+        System.out.println(res.next.next.next.value);
+    }
+}

src/linkedlist/reserveList/ReserveList.java

@@ -0,0 +1,96 @@
+package linkedlist.reserveList;
+
+import linkedlist.common.DNode;
+import linkedlist.common.Node;
+import linkedlist.common.TNode;
+import org.junit.Test;
+
+/**
+ * Created by LXF on 2016/7/27.
+ */
+public class ReserveList {
+    /*不带头结点的反转*/
+    public Node reverse(Node head) {
+        Node pre,next;
+        pre = next = null;
+        while (head != null) {
+            next = head.next;
+            head.next = pre;
+            pre = head;
+            head = next;
+        }
+        return pre;
+    }
+
+    /*带头结点的头插法反转*/
+    public TNode reserve1(TNode head) {
+        TNode cur = head.next;
+        head.next = null;
+        TNode next;
+        while (cur != null) {
+            next = cur.next;
+            cur.next = head.next;
+            head.next = cur;
+            cur = next;
+        }
+        return head;
+    }
+
+    /*反转双链表*/
+    public DNode reserveD(DNode head) {
+        DNode pre,next;
+        pre = next = null;
+        while (head != null) {
+            next = head.next;
+            head.next = pre;
+            head.last = next;
+            pre = head;
+            head = next;
+        }
+        return pre;
+    }
+
+
+    @Test
+    public void test() {
+
+        Node head = new Node(2);
+        head.add(3);
+
+        ReserveList reserveList = new ReserveList();
+        Node res = reserveList.reverse(head);
+        System.out.println(res.next.value);
+    }
+
+    @Test
+    public void testT() {
+        TNode head = new TNode();
+        head.add(3);
+        head.add(4);
+        head.add(5);
+
+        ReserveList reserveList = new ReserveList();
+        TNode res = reserveList.reserve1(head);
+        while (res != null) {
+            System.out.println(res.value);
+            res = res.next;
+        }
+    }
+
+    @Test
+    public void testD() {
+        DNode head = new DNode(3);
+        head.add(4);
+        head.add(42);
+        head.add(56);
+
+        ReserveList reserveList = new ReserveList();
+        DNode res = reserveList.reserveD(head);
+
+        while (res != null) {
+            System.out.println(res.value);
+            res = res.next;
+        }
+
+    }
+}