标签：
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 -> 4after calling your function.
Subscribe to see which companies asked this question
解题分析：
基本的题意就是将指定的node delete，我使用python实现，这里不涉及到指针的问题，这里就是将node的l后一个结点 value 赋值给前一个value，
后一个node的next 赋值给这个node的next
# -*- coding:utf-8 -*-
__author__ = 'jiuzhang'
class ListNode(object):
def __init__(self, x):
self.val = x
self.next = None
class Solution(object):
def deleteNode(self, node):
node.val = node.next.val
node.next - node.next.next
(LeetCode)Delete Node in a Linked List --- 删除链表中结点
标签：
原文地址：http://blog.csdn.net/u012965373/article/details/52298281
