https://blog.youkuaiyun.com/liransdzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/liransd/article/details/71075903https://blog.youkuaiyun.com/liransd/article/details/71075903liransdMon, 01 May 2017 22:27:34 +0800https://blog.youkuaiyun.com/liransd/article/details/71075715https://blog.youkuaiyun.com/liransd/article/details/71075715liransdMon, 01 May 2017 22:00:01 +0800https://blog.youkuaiyun.com/liransd/article/details/71057254https://blog.youkuaiyun.com/liransd/article/details/71057254liransdMon, 01 May 2017 18:36:49 +0800https://blog.youkuaiyun.com/liransd/article/details/71057215https://blog.youkuaiyun.com/liransd/article/details/71057215liransdMon, 01 May 2017 18:23:18 +0800https://blog.youkuaiyun.com/liransd/article/details/70991197https://blog.youkuaiyun.com/liransd/article/details/70991197liransdSat, 29 Apr 2017 22:47:46 +0800https://blog.youkuaiyun.com/liransd/article/details/70880588https://blog.youkuaiyun.com/liransd/article/details/70880588liransdThu, 27 Apr 2017 22:43:12 +0800https://blog.youkuaiyun.com/liransd/article/details/70880464https://blog.youkuaiyun.com/liransd/article/details/70880464liransdThu, 27 Apr 2017 22:23:56 +0800https://blog.youkuaiyun.com/liransd/article/details/70195322https://blog.youkuaiyun.com/liransd/article/details/70195322liransdSun, 16 Apr 2017 14:19:03 +0800https://blog.youkuaiyun.com/liransd/article/details/70195253https://blog.youkuaiyun.com/liransd/article/details/70195253liransdSun, 16 Apr 2017 14:08:40 +0800https://blog.youkuaiyun.com/liransd/article/details/69344471https://blog.youkuaiyun.com/liransd/article/details/69344471liransdWed, 05 Apr 2017 20:51:03 +0800https://blog.youkuaiyun.com/liransd/article/details/69337271https://blog.youkuaiyun.com/liransd/article/details/69337271liransdWed, 05 Apr 2017 20:38:16 +08002->3->3->4->5->3, 和 val = 3, 你需要返回删除3之后的链表：1->2->4->5。 3.思路 遍历链表中节点，对于与val值相等的节点，覆盖删除将指针指向下一个节点。 4.代码 /**  * Definition for singly-linke]]>https://blog.youkuaiyun.com/liransd/article/details/69330569https://blog.youkuaiyun.com/liransd/article/details/69330569liransdWed, 05 Apr 2017 20:10:51 +08001->5->null 和 5->9->2->null，返回 8->0->8->null 3.思路 当链表中有空表时，直接返回，当两链表都不是空表时，正常加法，如果有一个链表比另一个]]>https://blog.youkuaiyun.com/liransd/article/details/69316255https://blog.youkuaiyun.com/liransd/article/details/69316255liransdWed, 05 Apr 2017 20:07:33 +08004->3->2->5->2->null，并且 x=3,返回 1->2->2->4->3->5->null 思路：           新建两个链表还有两个指针，]]>https://blog.youkuaiyun.com/liransd/article/details/69315342https://blog.youkuaiyun.com/liransd/article/details/69315342liransdWed, 05 Apr 2017 19:39:05 +08003->8->11->15->null，2->null， 返回1->2->3->8->11->15->null。 思路： 分为链表为空与不为空讨论时，新建一个链表，依次从头节点开始比较移动。 代码： /**  * Definition of ListNode  *]]>https://blog.youkuaiyun.com/liransd/article/details/69214389https://blog.youkuaiyun.com/liransd/article/details/69214389liransdTue, 04 Apr 2017 21:40:51 +08003->2->0->null, return 0->1->2->3->null 思路： 建立了一个新链表，比较大小，然后if语句，还得用到temp暂存。 代码： /**  * Definition of ListNode  * class ListNode]]>https://blog.youkuaiyun.com/liransd/article/details/69212695https://blog.youkuaiyun.com/liransd/article/details/69212695liransdTue, 04 Apr 2017 21:17:04 +08002->3->4, 你应该返回的链表是 2->1->4->3。 思路： （注意当节点数有单数时不用交换）建立一个新链表还有两个指针，进行交换。 代码： /**  * Definition for singly-linked list.  * struct ListNode {  *     i]]>https://blog.youkuaiyun.com/liransd/article/details/69210688https://blog.youkuaiyun.com/liransd/article/details/69210688liransdTue, 04 Apr 2017 21:03:30 +08001->2->null，返回 1->2->null给出 1->1->2->3->3->null，返回 1->2->3->nul 思路：  一旦两节点重复，删掉p2，注意连续三个及以上节点值相同的情况。 代码： /**  * Definition of Li]]>https://blog.youkuaiyun.com/liransd/article/details/69205386https://blog.youkuaiyun.com/liransd/article/details/69205386liransdTue, 04 Apr 2017 20:50:49 +08002->3->null，这个翻转后的链表为3->2->1->null 思路：        新建链表，进行赋值交换，注意temp暂存。 代码： /**  * Definition of ListNode  *   * class ListNode {  * public:]]>https://blog.youkuaiyun.com/liransd/article/details/69201134https://blog.youkuaiyun.com/liransd/article/details/69201134liransdTue, 04 Apr 2017 20:49:13 +08002->1->5->null和n = 2，返回倒数第二个节点的值1. 思路： 遍历得到链表的总长度，总长度减去n，就可以得到它在正数第几个。 代码： /**  * Definition of ListNode  * class ListNode {  ]]>https://blog.youkuaiyun.com/liransd/article/details/69195479https://blog.youkuaiyun.com/liransd/article/details/69195479liransdTue, 04 Apr 2017 20:42:55 +08002->3->4->5->null和 n = 2. 删除倒数第二个节点之后，这个链表将变成1->2->3->5->null. 思路：        主要用两个指针，先让第一个指针指向第n个节点时，让第二个]]>