[LeetCode]Merge sorted List/array

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { ListNode *head; ListNode *curr; ListNode *p1 = l1, *p2 = l2; if(l1 == NULL) return l2; if(l2 == NULL) return l1; if(p1->val<p2->val) { head = p1; p1 = p1->next; } else { head = p2; p2 = p2->next; } curr = head; while(p1 != NULL && p2 != NULL) { if(p1->val<p2->val) { curr->next = p1; curr = p1; p1 = p1->next; } else { curr->next = p2; curr = p2; p2 = p2->next; } } if(p1 == NULL) curr->next = p2; else curr->next = p1; return head; }};</p2-></p2->

Given two sorted integer arrays A and B, merge B into A as one sorted array.

class Solution {public: void merge(int A[], int m, int B[], int n) { int k; int i = m-1;int j = n-1; for(k = m+n-1;i>=0 && j >= 0;k--) { if(A[i]>B[j]) { A[k] = A[i]; i--; } else { A[k] = B[j]; j--; } } while(j >= 0) { A[k--] = B[j--]; } return; }};