码迷,mamicode.com
首页 > 其他好文 > 详细

237. Delete Node in a Linked List

时间:2015-11-29 00:59:22      阅读:139      评论:0      收藏:0      [点我收藏+]

标签:

题目:

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

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!