34 lines
672 B
Java
34 lines
672 B
Java
/*
|
|
* @lc app=leetcode id=237 lang=java
|
|
*
|
|
* [237] Delete Node in a Linked List
|
|
*/
|
|
|
|
// @lc code=start
|
|
/**
|
|
* Definition for singly-linked list.
|
|
* public class ListNode {
|
|
* int val;
|
|
* ListNode next;
|
|
* ListNode(int x) { val = x; }
|
|
* }
|
|
*/
|
|
class Solution {
|
|
public void deleteNode(ListNode node) {
|
|
if(node == null || node.next == null) {
|
|
return;
|
|
}
|
|
ListNode cur = node, prev = null;
|
|
while(cur!=null && cur.next!=null) {
|
|
cur.val = cur.next.val;
|
|
prev = cur;
|
|
cur = cur.next;
|
|
}
|
|
if(prev != null) {
|
|
prev.next = null;
|
|
}
|
|
}
|
|
}
|
|
// @lc code=end
|
|
|