摘要: This is a simple but important algorithm when dealing with singly linked list.This algorithms can reversely access a singly linked list using O(n) time. Below is my code in Java.class Node{ Node next; int val;}class SinglyLinkedList{ Node head; Node tail; //append a new Node t... 阅读全文
posted @ 2014-04-11 05:28 门对夕阳 阅读(203) 评论(0) 推荐(0) 编辑