链表专题更新cpp代码

animation-simulation/链表篇/剑指Offer25合并两个排序的链表.md

@@ -27,8 +27,13 @@
 
 ![合并数组](https://cdn.jsdelivr.net/gh/tan45du/photobed@master/photo/合并数组.216f4nn4lti8.gif)
 
+**题目代码**
+
+Java Code:
+
 ```java
-  public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
+ class Solution {
+    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
          ListNode headpro = new ListNode(-1);
          ListNode headtemp = headpro;
          while (l1 != null && l2 != null) {
@@ -45,7 +50,33 @@
          } 
          headpro.next = l1 != null ? l1:l2;
          return headtemp.next;
-         
     }
+}
+```
+
+C++ Code:
+
+```cpp
+class Solution {
+public:
+    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
+        ListNode * headpro = new ListNode(-1);
+        ListNode * headtemp = headpro;
+        while (l1 != nullptr && l2 != nullptr) {
+             //接上大的那个
+             if (l1->val >= l2->val) {
+                 headpro->next = l2;
+                 l2 = l2->next;
+             }
+             else {
+                 headpro->next = l1;
+                 l1 = l1->next;
+             }
+             headpro = headpro->next;
+         } 
+         headpro->next = l1 != nullptr ? l1: l2;
+         return headtemp->next;
+    }
+};
 ```