好记性不如烂笔头的专栏

问题Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2 ↘

问题Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3.解答链表的运用！ Easy!/** * Definiti

题目Remove all elements from a linked list of integers that have value val.Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5解答典型的在链表头部多申请一个指针指向链表头部，解决问题！/** * Defin

题目Reverse a singly linked list.解答反转链表！循环class Solution1 { public: ListNode* reverseList(ListNode* head) { if(head==NULL) return NULL; ListNode *p=head; ListNode *pn=p->next,

题目Given a singly linked list, determine if it is a palindrome.Follow up: Could you do it in O(n) time and O(1) space?解答找到链表的一半，把剩下的进行反转，然后比对前后一半。 找到链表的一半：fast和slow两个指针，fast每次递增2，slow每次递增1，也可以用count。

题目Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Note: Do not modify the linked list.Follow up: Can you solve it without using extra space?原题： https://

题目Given a list, rotate the list to the right by k places, where k is non-negative.For example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL.解答One Solution:/** * Definition for sin

题目Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of th

/************************************************************************* > File Name: main.cpp > Author: > Mail: > Created Time: 三 7/26 18:43:04 2017 *****************************