LeetCode--No.237--Delete Node In a Linked List
来源:互联网 发布:yessuperstore淘宝 编辑:程序博客网 时间:2024/05/16 05:37
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.
/** * 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) { if(node == null) return; else{ node.val = node.next.val; node.next = node.next.next; } }}
0 0
- Leetcode NO.237 Delete Node in a Linked List
- LeetCode--No.237--Delete Node In a Linked List
- leetcode: Delete Node in a Linked List
- LeetCode Delete Node in a Linked List
- 【leetcode】Delete Node in a Linked List
- Leetcode: Delete Node in a Linked List
- [LeetCode]Delete Node in a Linked List
- 【leetcode】Delete Node in a Linked List
- Leetcode Delete Node in a Linked List
- LeetCode || Delete Node in a Linked List
- [LeetCode] Delete Node in a Linked List
- LeetCode-Delete Node in a Linked List
- 【leetCode】Delete Node In A Linked List
- [leetcode] Delete Node in a Linked List
- [LeetCode]Delete Node in a Linked List
- [leetcode]Delete Node in a Linked List
- Leetcode: Delete Node in a Linked List
- LeetCode Delete Node in a Linked List
- Windows 8.1 PLSQL_32连接到RHEL6.1 Oracle10gr2_64
- 基于Spring的多数据源(Druid)定时任务项目开发(一)<带Demo>
- 查看LUN对应的HBA、查看HBA的WWN信息
- LeetCode--No.53--Maximum Subarray
- [leetcode] 24. Swap Nodes in Pairs
- LeetCode--No.237--Delete Node In a Linked List
- 用python自动发微博
- 勾股定理一日一证连载13
- 随笔:写给我深爱的球队
- JavaScript Array 原型方法 大盘点
- 多线程之_beginThreadex的用法
- 多线程之常用api
- hdu 1233 还是畅通工程(最小生成树,prim,kruskal)
- R语言绘制均线图SMA的交叉点