新增链表

Author: jincc

alg-cpp.xcodeproj/project.pbxproj

@@ -176,6 +176,7 @@
 		091A5E14231EB6FC000BEFAF /* merge_intervals.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = merge_intervals.h; sourceTree = "<group>"; };
 		091A5E17231EC2AE000BEFAF /* sort_colors.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = sort_colors.h; sourceTree = "<group>"; };
 		091B8A7122F48FD50050FB4C /* IsBalanced_Solution.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = IsBalanced_Solution.h; sourceTree = "<group>"; };
+		091E1CED238EBFB100680649 /* reverseKNodes.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = reverseKNodes.h; sourceTree = "<group>"; };
 		0922310622FA445300F0F5AF /* removeElement.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = removeElement.h; sourceTree = "<group>"; };
 		0922310922FA497500F0F5AF /* searchInsert.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = searchInsert.h; sourceTree = "<group>"; };
 		0922310C22FA50DD00F0F5AF /* maxSubArray.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = maxSubArray.h; sourceTree = "<group>"; };
@@ -199,6 +200,8 @@
 		09421FFA23142AEB00A7BA67 /* searchRange.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = searchRange.h; sourceTree = "<group>"; };
 		09421FFD231583FC00A7BA67 /* isValidSudoku.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = isValidSudoku.h; sourceTree = "<group>"; };
 		0942542C232942D3006B83E9 /* gas_station.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = gas_station.h; sourceTree = "<group>"; };
+		0943DB3A2382E20100E995BB /* addList.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = addList.h; sourceTree = "<group>"; };
+		0943DB3D2382EDEE00E995BB /* getIntersectNode.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = getIntersectNode.h; sourceTree = "<group>"; };
 		094524B7234790CD00CCBFB9 /* coinChange.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = coinChange.h; sourceTree = "<group>"; };
 		094524BA234A32D000CCBFB9 /* levenshtein_distance.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = levenshtein_distance.h; sourceTree = "<group>"; };
 		0946B01522F68BA50043469D /* FirstNotRepeatingChar.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = FirstNotRepeatingChar.h; sourceTree = "<group>"; };
@@ -263,6 +266,7 @@
 		099EAEF822FFC4C5006437BD /* palindrome_number.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = palindrome_number.h; sourceTree = "<group>"; };
 		09A208B02308D96E00094088 /* zigzag_conversion.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = zigzag_conversion.h; sourceTree = "<group>"; };
 		09A208B32309990C00094088 /* string_to_integer_atoi.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = string_to_integer_atoi.h; sourceTree = "<group>"; };
+		09A3F5C2237A358600BE6839 /* copyListWithRand.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = copyListWithRand.h; sourceTree = "<group>"; };
 		09A7AC1D234E34EA00DFECF0 /* matrix_move.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = matrix_move.h; sourceTree = "<group>"; };
 		09ABED832300E22800113589 /* romanToInt.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = romanToInt.h; sourceTree = "<group>"; };
 		09ABED872300EE0900113589 /* longestCommonPrefix.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = longestCommonPrefix.h; sourceTree = "<group>"; };
@@ -296,6 +300,7 @@
 		09E18E5D22F58301002D0227 /* GetNumberOfK.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = GetNumberOfK.h; sourceTree = "<group>"; };
 		09E18E6022F588E8002D0227 /* FindNumsAppearOnce.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = FindNumsAppearOnce.h; sourceTree = "<group>"; };
 		09E18E6422F59065002D0227 /* replaceSpace.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = replaceSpace.h; sourceTree = "<group>"; };
+		09E8C4112379A3AC006E03ED /* listPartition.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = listPartition.h; sourceTree = "<group>"; };
 		09EF0F4C235F43A4008E90DC /* getMaxWindow.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = getMaxWindow.h; sourceTree = "<group>"; };
 		09F082AF235768BD000F84C0 /* sortStackByStack.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = sortStackByStack.h; sourceTree = "<group>"; };
 		09F2A5E52354CF320026F4A2 /* TwoStacksQueue.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = TwoStacksQueue.h; sourceTree = "<group>"; };
@@ -684,6 +689,11 @@
 				09377EDF236A60E800222B54 /* ReversePartLL.h */,
 				095E32C223706CCA00331B4A /* josephusKill.h */,
 				092D77CF2371BF4C00CF2069 /* isPalindrome2.h */,
+				09E8C4112379A3AC006E03ED /* listPartition.h */,
+				09A3F5C2237A358600BE6839 /* copyListWithRand.h */,
+				0943DB3A2382E20100E995BB /* addList.h */,
+				0943DB3D2382EDEE00E995BB /* getIntersectNode.h */,
+				091E1CED238EBFB100680649 /* reverseKNodes.h */,
 			);
 			path = itinterviews;
 			sourceTree = "<group>";

alg-cpp.xcodeproj/project.xcworkspace/xcuserdata/junl.xcuserdatad/UserInterfaceState.xcuserstate

@@ -22,22 +22,22 @@
 		<key>base.xcscheme_^#shared#^_</key>
 		<dict>
 			<key>orderHint</key>
-			<integer>5</integer>
+			<integer>7</integer>
 		</dict>
 		<key>bsearch.xcscheme_^#shared#^_</key>
 		<dict>
 			<key>orderHint</key>
-			<integer>9</integer>
+			<integer>8</integer>
 		</dict>
 		<key>divideandconquer.xcscheme_^#shared#^_</key>
 		<dict>
 			<key>orderHint</key>
-			<integer>14</integer>
+			<integer>13</integer>
 		</dict>
 		<key>dp.xcscheme_^#shared#^_</key>
 		<dict>
 			<key>orderHint</key>
-			<integer>12</integer>
+			<integer>10</integer>
 		</dict>
 		<key>greed.xcscheme_^#shared#^_</key>
 		<dict>
@@ -47,12 +47,12 @@
 		<key>hasTable.xcscheme_^#shared#^_</key>
 		<dict>
 			<key>orderHint</key>
-			<integer>10</integer>
+			<integer>11</integer>
 		</dict>
 		<key>linkedList.xcscheme_^#shared#^_</key>
 		<dict>
 			<key>orderHint</key>
-			<integer>6</integer>
+			<integer>9</integer>
 		</dict>
 		<key>other.xcscheme_^#shared#^_</key>
 		<dict>
@@ -62,17 +62,17 @@
 		<key>recursion.xcscheme_^#shared#^_</key>
 		<dict>
 			<key>orderHint</key>
-			<integer>13</integer>
+			<integer>14</integer>
 		</dict>
 		<key>sort.xcscheme_^#shared#^_</key>
 		<dict>
 			<key>orderHint</key>
-			<integer>8</integer>
+			<integer>5</integer>
 		</dict>
 		<key>stack+queue.xcscheme_^#shared#^_</key>
 		<dict>
 			<key>orderHint</key>
-			<integer>7</integer>
+			<integer>6</integer>
 		</dict>
 		<key>string.xcscheme_^#shared#^_</key>
 		<dict>
@@ -82,7 +82,7 @@
 		<key>tree.xcscheme_^#shared#^_</key>
 		<dict>
 			<key>orderHint</key>
-			<integer>11</integer>
+			<integer>12</integer>
 		</dict>
 	</dict>
 	<key>SuppressBuildableAutocreation</key>

alg-cpp.xcodeproj/project.xcworkspace/xcuserdata/junlongj.xcuserdatad/UserInterfaceState.xcuserstate

@@ -11,6 +11,16 @@
 
 ### [判断一个链表是否为回文结构](./linkedList/itinterviews/isPalindrome2.h)
 
+### [将单向链表按某值划分成左边小，中间相等，右边大的形式](./linkedList/itinterviews/listPartition.h)
+
+### [复制含有随机指针节点的链表](./linkedList/itinterviews/copyListWithRand.h)
+
+### [ 两个单链表生成相加链表](./linkedList/itinterviews/addList.h)
+### [ <font color=red>两个单链表相交的一系列问题</font>](./linkedList/itinterviews/getIntersectNode.h)
+
+### [<font color=red>将单链表的每K个节点之间逆序</font>](./linkedList/itinterviews/reverseKNodes.h)
+
+
 ### leetcode
 
 | &emsp;题号&emsp; | 题目链接&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;| 答案链接&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;| &emsp;难度&emsp;  | &emsp;完成度&emsp;  |

alg-cpp.xcodeproj/xcuserdata/junl.xcuserdatad/xcschemes/xcschememanagement.plist

@@ -0,0 +1,137 @@
+//
+//  addList.h
+//  linkedList
+//
+//  Created by junl on 2019/11/18.
+//  Copyright © 2019 junl. All rights reserved.
+//
+
+#ifndef addList_hpp
+#define addList_hpp
+
+#include <stdio.h>
+#include "creatlist.h"
+#include <stack>
+/*
+ 两个单链表生成相加链表
+ 例如：链表1位9->3->7,链表2位6->3，结果链表为1->0->0->0
+ */
+namespace itinterviews {
+    class addList{
+    public:
+        /*
+         思路：利用栈后进先出的结构O(N+M),O(N+M)
+         */
+        ListNode *solve(ListNode * head1, ListNode *head2){
+            if (!head1 || !head2)
+                return nullptr;
+            std::stack<int> stk1;
+            std::stack<int> stk2;
+            ListNode *node = head1;
+            while (node) {
+                stk1.push(node->val);
+                node=node->next;
+            }
+            node = head2;
+            while (node) {
+                stk2.push(node->val);
+                node=node->next;
+            }
+            int flag=0;
+            ListNode *pre = nullptr;
+            node = nullptr;
+            while (!stk1.empty() || !stk2.empty()) {
+                int n1= 0, n2= 0;
+                if (!stk1.empty()) {
+                    n1 = stk1.top();
+                    stk1.pop();
+                }
+                if (!stk2.empty()){
+                    n2 = stk2.top();
+                    stk2.pop();
+                }
+                int n = n1+n2+flag;
+                flag = n / 10;
+                pre = node;
+                node = new ListNode(n%10);
+                node->next = pre;
+            }
+            if (flag){
+                pre = node;
+                node = new ListNode(flag);
+                node->next = pre;
+            }
+            return node;
+        }
+    };
+    
+    /*
+     思路:
+     通过反转两个链表，可以节省掉栈空间的消耗
+     */
+    class addList2{
+    public:
+        ListNode *solve(ListNode *head1,ListNode *head2){
+            if (!head1 || !head2)
+                return nullptr;
+            head1 = reverse(head1);
+            head2 = reverse(head2);
+            ListNode *ct,*pre;
+            ct = pre = nullptr;
+            int co=0;
+            ListNode *node1 = head1;
+            ListNode *node2 = head2;
+            while (node1 || node2) {
+                int n1 = 0;
+                int n2 = 0;
+                if (node1){
+                    n1 = node1->val;
+                    node1 = node1->next;
+                }
+                if (node2){
+                    n2 = node2->val;
+                    node2 = node2->next;
+                }
+                int n = n1 + n2 + co;
+                co = n/10;
+                pre = ct;
+                ct = new ListNode(n%10);
+                ct->next = pre;
+            }
+            if (co){
+                pre = ct;
+                ct = new ListNode(co);
+                ct->next = pre;
+            }
+            head1 = reverse(head1);
+            head2 = reverse(head2);
+            return ct;
+        }
+    private:
+        ListNode* reverse(ListNode *head){
+            ListNode *pre,*ct,*next;
+            pre=head;
+            ct=pre->next;
+            pre->next=nullptr;
+            while (ct) {
+                next = ct->next;
+                ct->next = pre;
+                pre = ct;
+                ct = next;
+            }
+            return pre;
+        }
+        
+    };
+    
+    void test_addList(){
+        std::cout << "---两个单链表生成相加链表---------" << std::endl;
+//        class addList so;
+        class addList2 so;
+        ListNode *head1 = codinginterviews::creatLists({9,3,7})->next;
+        ListNode *head2 = codinginterviews::creatLists({6,3})->next;
+        so.solve(head1, head2)->print();
+    }
+}
+
+#endif /* addList_hpp */

linkedList.md

@@ -0,0 +1,118 @@
+//
+//  copyListWithRand.h
+//  linkedList
+//
+//  Created by junl on 2019/11/12.
+//  Copyright © 2019 junl. All rights reserved.
+//
+
+#ifndef copyListWithRand_hpp
+#define copyListWithRand_hpp
+
+#include <stdio.h>
+#include "creatlist.h"
+#include <map>
+/*
+ 复制含有随机指针节点的链表.
+ 
+ 进阶：不使用额外的数据结构，只用有限的几个变量，且在时间复杂度为O（n）内完成。
+ 总结：
+ 
+ 两种解析关键点在于：如果通过原节点找到copy的新节点，这样才能设置rand节点值。方法一是通过hashmap，方法二比较取巧，通过构建一个特殊链表.
+ */
+namespace itinterviews {
+    class RNode{
+    public:
+        int val;
+        RNode *next;
+        RNode *rand;
+        RNode() = delete;
+        RNode(int value):val(value),next(nullptr),rand(nullptr){};
+    };
+    /*
+     思路: 关键点在于如何处理rand节点，rand节点是不能new出来的，不然就和新链表的节点对应不上。
+     处理: 借助hashmap,O(N),O(N)
+     */
+    class copyListWithRand{
+    public:
+        RNode *solve(RNode *head){
+            if (!head)
+              return head;
+            std::map<RNode *,RNode *> m;
+            RNode *node = head;
+            //一一映射保存到map中，此时next和rand都还没赋值
+            while (node) {
+                m[node] = new RNode(node->val);
+                node = node->next;
+            }
+            node = head;
+            while (node) {
+                m[node]->next = m[node->next];
+                m[node]->rand = m[node->rand];
+                node = node->next;
+            }
+            return m[head];
+        };
+    };
+    /*
+     思路：比如原链表为1->2->3，构建出新链接为1-> 1‘ -> 2 -> 2' -> 3-> 3'，这样可以非常容易的找到原链表节点和新链表节点之间的关系.即:
+        node源->next即为node新
+     */
+    class copyListWithRand_advance{
+    public:
+        RNode *solve(RNode *head){
+            if (!head)
+                return head;
+            RNode *node = head;
+            RNode *next;
+            //构建1-> 1‘ -> 2 -> 2' -> 3-> 3'
+            while (node) {
+                next = node->next;
+                node->next = new RNode(node->val);
+                node->next->next = next;
+                node = next;
+            }
+            
+            //处理rand节点
+            node = head;
+            while (node) {
+                next = node->next->next;//跳过复制的节点
+                if (node->rand){
+                    node->next->rand = node->rand->next;
+                }
+                node = next;
+            }
+            //删除多余节点
+            RNode *result = head->next;
+            node = head;
+            RNode *copyNode;
+            while (node) {
+                next = node->next->next;
+                copyNode = node->next;
+                node->next = next;
+                copyNode->next = next ? next->next : nullptr;
+                node = node->next;
+            }
+            return result;
+        }
+    };
+    
+    void test_copyListWithRand(){
+        std::cout << "------复制含有随机指针节点的链表.----------" << std::endl;
+        RNode *head = new RNode(1);
+        RNode *head2 = new RNode(2);
+        RNode *head3 = new RNode(3);
+        head->next = head2;
+        head->rand = head3;
+        head2->next = head3;
+        head3->rand = head;
+        
+//        class copyListWithRand so;
+        class copyListWithRand_advance so;
+        head = so.solve(head);
+        head;
+    }
+}
+
+
+#endif /* copyListWithRand_hpp */