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

237. Delete Node in a Linked List -David_Lin

时间:2017-10-12 10:27:19      阅读:181      评论:0      收藏:0      [点我收藏+]

标签:span   should   思路   public   except   link   class   with   tail   

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.

 

思路是:从node 节点开始,把后面节点的值赋给前面的节点,直到到表尾;

 1 /**
 2  * Definition for singly-linked list.
 3  * public class ListNode {
 4  *     int val;
 5  *     ListNode next;
 6  *     ListNode(int x) { val = x; }
 7  * }
 8  */
 9 class Solution {
10     public void deleteNode(ListNode node) {
11         ListNode pos = node.next;
12         if (pos==null)
13             node=null;
14         else {
15             while (pos!=null){
16                 node.val = pos.val;
17                 pos = pos.next;
18                 if (pos==null)
19                     node.next = null;
20                 else 
21                     node = node.next;
22             }
23         }
24     }
25 }

 

237. Delete Node in a Linked List -David_Lin

标签:span   should   思路   public   except   link   class   with   tail   

原文地址:http://www.cnblogs.com/David-Lin/p/7654373.html

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