Leet Code OJ 237. Delete Node in a Linked List [Difficulty: Easy]

题目：
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.

翻译：
写一个方法去删除单链表的一个节点（非尾节点），只给出访问这个节点的参数。

假定链表是1 -> 2 -> 3 -> 4，给你的节点是第三个节点（值为3），这个链表在调用你的方法后应该变为 1 -> 2 -> 4。

分析：
删除链表的节点的常规做法是修改上一个节点的next指针。然而这边并没有提供上一个节点的访问方式，故转变思路改为删除下一节点，直接将下一个节点的val和next赋值给当前节点。

代码：

/*** 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;}
}

Leet Code OJ 237. Delete Node in a Linked List [Difficulty: Easy]相关推荐

LeetCode刷题记录3——237. Delete Node in a Linked List（easy）
LeetCode刷题记录3--237. Delete Node in a Linked List(easy) 目录 LeetCode刷题记录3--237. Delete Node in a Linke ...
Leet Code OJ 107. Binary Tree Level Order Traversal II [Difficulty: Easy]
题目: Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from ...
leetcode 237: Delete Node in a Linked List
题目: Write a function to delete a node (except the tail) in a singly linked list, given only access t ...
237. Delete Node in a Linked List
题目: Write a function to delete a node (except the tail) in a singly linked list, given only access t ...
LeetCode 237. Delete Node in a Linked List
题目: Write a function to delete a node (except the tail) in a singly linked list, given only access t ...
Xiaohe-LeetCode 237 Delete Node in a Linked List
This is almost the best solution.16ms. /** * Definition for singly-linked list. * struct ListNode { ...
Leet Code OJ 119. Pascal's Triangle II [Difficulty: Easy]
题目: Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return ...
Leet Code OJ 刷题顺序参考
出现频度为5: 1. Leet Code OJ 1. Two Sum [Difficulty: Easy] 2. Leet Code OJ 8. String to Integer (atoi) ...
C#LeetCode刷题之#237-删除链表中的节点（Delete Node in a Linked List）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3832 访问. 请编写一个函数,使其可以删除某个链表中给定的(非末 ...

Leet Code OJ 237. Delete Node in a Linked List [Difficulty: Easy]

Leet Code OJ 237. Delete Node in a Linked List [Difficulty: Easy]相关推荐

最新文章

热门文章