题目描述
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
Given linked list — head = [4,5,1,9], which looks like following:
Example 1:
1 |
Input: head = [4,5,1,9], node = 5 |
Example 2:
1 |
Input: head = [4,5,1,9], node = 1 |
Note:
- The linked list will have at least two elements.
- All of the nodes’ values will be unique.
- The given node will not be the tail and it will always be a valid node of the linked list.
- Do not return anything from your function.
题目描述有点问题,题目的原意是给一个node,直接在该node存在的list中删除这个node,因为不知道父节点的地址,所以只需要将node的val改成node.next的val,然后把node.next设置成node.next.next就可以了。
1 |
|
近期评论