- https://leetcode.com/problems/delete-node-in-a-linked-list/description/
- Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
- Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3,
- the linked list should become 1 -> 2 -> 4 after calling your function.
- // 时间 O(1)-因为没有循环遍历 空间 (1)
- public class LC_237_DeleteNodeInALinkedList {
- public void deleteNode(ListNode node) {
- if (node == null) return ;
- // 这道题不好, 因为没有给头, 所以无法遍历 也没有办法用 IF 来判断
- // 假设当前节点就是 NODE NODE 去抢下一个节点的值, 然后再跳过去 这里不用考虑地址空间这些
- node.val = node.next.val ;
- node.next = node.next.next ;
- }
- }
来源: http://www.bubuko.com/infodetail-2502719.html