Reverse a singly linked list  http://angelonotes.blogspot.tw/2011/08/reverse-singly-linked-list.html Source   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 #include <stdio.h>   typedef st…

Reverse a singly linked list. Hint: A linked list can be reversed either iteratively or recursively. Could you implement both? 递归的办法: /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { v…

Reverse a singly linked list. /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* reverseList(ListNode* head) { if (head == NUL…

Problem: Implement a function to check if a singly linked list is a palindrome. 思路: 最简单的方法是 Reverse and compare. 另外一种非常经典的办法是用 Recursive 的思路,把一个list看成这种形式: 0 ( 1 ( 2 ( 3 ) 2 ) 1 ) 0 0 ( 1 ( 2 ( 3 3 ) 2 ) 1 ) 0 CC150里面给出的Code,非常简洁,贴在下面: length == 1 对应…

单链表反转(Singly Linked Lists in Java) 博客分类: 数据结构及算法   package dsa.linkedlist; public class Node<E>{ E data; Node<E> next; } package dsa.linkedlist; public class ReverseLinkedListRecursively { public static void main(String args[]) { ReverseLinked…

Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node. Have you met this question in a real interview?     Example Given 1->2->3->4, and node 3. return 1->2->4 LeetCode上的原题,请参见我之前的博客De…

Singly Linked List Singly linked list storage structure:typedef struct Node{ ElemType data; struct Node *next;}Node; typedef struct Node *LinkList; LinkedList without head node: LinkedList with head node: Operations: /*check the size of link list.*/i…

Reverse a Singly LinkedList * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */ 这是面试的时候被问到的一题,还是考察LinkedList的理解,最后如何得到reverse之后的head的. public Class Soluti…

In a singly linked list each node in the list stores the contents of the node and a reference (or pointer in some languages) to the next node in the list. It is one of the simplest way to store a collection of items. In this lesson we cover how to cr…

public ListNode reverseBetween(ListNode head, int m, int n) { if(head==null) return head; ListNode slow = head; ListNode fast = head; //find middle while(fast.next!=null) { fast = fast.next; if(fast.next!=null) { fast = fast.next; } else { slow = slo…