| Excerpt |
|---|
Given a linked list, remove the n-th node from the end of list and return its head. |
Example:
Given linked list: 1->2->3->4->5, and n = 2.
...
Istoric Pagină
Rezumat
Unelte pentru conținut
| Excerpt |
|---|
Given a linked list, remove the n-th node from the end of list and return its head. |
Example:
Given linked list: 1->2->3->4->5, and n = 2.
...