标签:
题目:
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.
链接: http://leetcode.com/problems/delete-node-in-a-linked-list/
题解:
没啥可说的,就是干!
Time Complexity - O(1), Space Complexity - in place
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution { public void deleteNode(ListNode node) { node.val = node.next.val; node.next = node.next.next; } }
测试:
237. Delete Node in a Linked List
标签:
原文地址:http://www.cnblogs.com/yrbbest/p/5003811.html