|
2 | 2 |
|
3 | 3 | ##Description |
4 | 4 |
|
5 | | -Given a sorted array, remove the duplicates in place such that each element appear only*once* and return the new length. |
6 | | - |
7 | | -Do not allocate extra space for another array, you must do this in place with constant memory. |
8 | | - |
9 | | -For example, |
10 | | -Given input array*nums* =`[1,1,2]`, |
11 | | - |
12 | | -Your function should return length =`2`, with the first two elements of*nums* being`1` and`2` respectively. It doesn't matter what you leave beyond the new length. |
| 5 | +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. |
13 | 6 |
|
14 | 7 | **Tags:** Linked List |
15 | 8 |
|
|