-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedlistInteger.java
More file actions
144 lines (120 loc) · 2.77 KB
/
LinkedlistInteger.java
File metadata and controls
144 lines (120 loc) · 2.77 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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
public class LinkedlistInteger {
private Node first;
private int count;
private Node last;
public LinkedlistInteger() {
first = null;
//last = null;
count = 0;
}
public void prepend(int element) {
first = new Node(element,first);
count++;
if (count == 1) {
last = first;
}
}
public int findAtIndex(int index){
int i = 1;
for (Node traveller = first; traveller != null; traveller = traveller.next){
if (i == index){
return traveller.item;
}
i++;
}
return -1;
}
public int find(int element){
for (Node traveller = first; traveller != null; traveller = traveller.next){
if (element == traveller.item){
return traveller.item;
}
}
return -1;
}
public int size(){
return 0;
}
public boolean isEmpty(){
return (first == null);
}
public void check(){
//System.out.println(first.item);
//System.out.println(last.next);
//System.out.println(first.next.next.item);
//System.out.println(first.next.next.next.item);
// first = first.next;
//System.out.println(last.item);
//System.out.println(last.next);
//last.next = first;
//last = first.next;
// Node traveller;
//for (traveller = first; traveller != null; traveller = traveller.next){
// System.out.println("Node = " + traveller.item);
//}
//System.out.println(traveller.next);
Node traveller = first;
while(traveller != null){
System.out.println("Node = " + traveller.item);
traveller = traveller.next;
}
}
public int sum(){
int sum = 0;
for (Node traveller = first; traveller != null; traveller = traveller.next){
sum = sum + traveller.item;
}
return sum;
}
public int Max(){
Node traveller = first;
int max= traveller.item;
for (; traveller != null; traveller = traveller.next){
if (traveller.item > max){
max = traveller.item;
}
}
return max;
}
public void append(int element) {
Node tmp = new Node(element);
last.next = tmp;
last = tmp;
count++;
tmp = null;
}
public String toString() {
StringBuilder sb = new StringBuilder(count*10);
sb.append("List: size = "+count);
for (Node traveller = first; traveller != null; traveller = traveller.next) {
//this will invoke the String’s toString method!!
sb.append("\n\t"+traveller.item);
}
return sb.toString();
}
public static void main(String[] args) {
LinkedlistInteger obj = new LinkedlistInteger();
obj.prepend(10);
obj.prepend(7);
obj.append(3);
obj.prepend(4);
// System.out.println(obj);
//System.out.println(obj.find(9));
// System.out.println(obj.Max());
obj.check();
}
}
class Node {
int item;
Node next;
Node(int item, Node next) {
this.item = item;
this.next = next;
}
Node(int item) {
this(item,null);
}
Node() {
this(0);
}
}