摘要:
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. After removi 阅读全文
posted @ 2019-08-21 04:06
Schwifty
阅读(137)
评论(0)
推荐(0)
摘要:
Given a linked list, rotate the list to the right by k places, where k is non-negative. Example 1: Input: 1->2->3->4->5->NULL, k = 2 Output: 4->5->1-> 阅读全文
posted @ 2019-08-21 03:52
Schwifty
阅读(144)
评论(0)
推荐(0)

浙公网安备 33010602011771号