-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathListNode.java
More file actions
75 lines (64 loc) · 1.03 KB
/
ListNode.java
File metadata and controls
75 lines (64 loc) · 1.03 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
public class ListNode
{
int val;
ListNode next;
ListNode( int x )
{
val = x;
next = null;
}
ListNode( int[] v )
{
ListNode t = this;
this.val = v[0];
for ( int i = 1; i < v.length; i++ )
{
t.next = new ListNode( v[i] );
t = t.next;
}
}
public int[] toarray()
{
ListNode tmp = this;
int count = 0;
while ( tmp != null )
{
tmp = tmp.next;
count++;
}
int[] ret = new int[count];
tmp = this;
for ( int i = 0; i < count; i++ )
{
ret[i] = tmp.val;
tmp = tmp.next;
}
return ret;
}
public void print()
{
ListNode t = this;
System.out.print( "Listnode: " );
while ( t.next != null )
{
System.out.print( "->" + t.val );
t = t.next;
}
System.out.print( "->" + t.val + "->NULL" );
System.out.println();
}
public ListNode reverse()
{
ListNode ret = new ListNode( 0 );
ListNode tmp = ret, n;
ret.next = this;
while ( tmp.next != null )
{
n = ret.next;
ret.next = new ListNode( tmp.next.val );
ret.next.next = n;
tmp = tmp.next;
}
return ret;
}
}