Skip to content

Commit 66b3a79

Browse files
author
王俊超
committed
commit
1 parent 74251ca commit 66b3a79

File tree

4 files changed

+76
-0
lines changed

4 files changed

+76
-0
lines changed

.idea/modules.xml

Lines changed: 1 addition & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.
Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
/**
2+
* @author: wangjunchao(王俊超)
3+
* @time: 2018-10-10 09:58
4+
**/
5+
public class ListNode {
6+
int val;
7+
ListNode next;
8+
9+
ListNode(int x) {
10+
val = x;
11+
}
12+
}
Lines changed: 31 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,31 @@
1+
/**
2+
* <pre>
3+
* Definition for singly-linked list.
4+
* public class ListNode {
5+
* int val;
6+
* ListNode next;
7+
* ListNode(int x) { val = x; }
8+
* }
9+
* </pre>
10+
* @author: wangjunchao(王俊超)
11+
* @time: 2018-10-10 09:57
12+
**/
13+
class Solution {
14+
public void deleteNode(ListNode node) {
15+
16+
if (node == null || node.next == null) {
17+
return;
18+
}
19+
20+
ListNode prev = node;
21+
while (node.next != null) {
22+
node.val = node.next.val;
23+
prev = node;
24+
node = node.next;
25+
26+
27+
}
28+
29+
prev.next = null;
30+
}
31+
}
Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
/**
2+
* @author: wangjunchao(王俊超)
3+
* @time: 2018-10-10 10:01
4+
**/
5+
public class Test {
6+
public static void main(String[] args) {
7+
ListNode node = new ListNode(4);
8+
node.next = new ListNode(5);
9+
node.next.next = new ListNode(1);
10+
node.next.next.next = new ListNode(9);
11+
12+
Solution solution = new Solution();
13+
solution.deleteNode(node.next);
14+
15+
print(node);
16+
}
17+
18+
private static void print(ListNode node) {
19+
do {
20+
if (node == null) {
21+
System.out.println("null");
22+
} else if (node.next != null){
23+
System.out.print(node.val + "->");
24+
node = node.next;
25+
} else {
26+
System.out.println(node.val + "->null");
27+
node = node.next;
28+
}
29+
30+
}while (node != null);
31+
}
32+
}

0 commit comments

Comments
 (0)