hackerrank-java/src/DataStructure/JavaList.java at master · sonmez-hakan/hackerrank-java · GitHub

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
packageDataStructure;

importjava.util.*;

publicclassJavaList {

staticclassNode {
publicintdata;
publicNodenext = null;

Node()
 {

 }

Node(intdata) {
this.data = data;
 }
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intsize = scan.nextInt();

Nodetmp = newNode();
Noderoot = tmp;

for (intx = 0; x < size; x++) {
if (x == 0) {
tmp.data = scan.nextInt();
 } else {
tmp.next = newNode(scan.nextInt());
tmp = tmp.next;
 }
 }

Nodetmp2;
intquery = scan.nextInt(),
index, number;
scan.nextLine();
Strings;
for (intx = 0; x < query; x++) {
tmp = root;
s = scan.nextLine();
if (s.equals("Insert")) {
index = scan.nextInt();
number = scan.nextInt();
if (index == 0) {
root = newNode(number);
root.next = tmp;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }
tmp2 = newNode(number);
tmp2.next = tmp.next;
tmp.next = tmp2;
 }
 } else {
index = scan.nextInt();
if (index == 0) {
root = root.next;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }

tmp.next = tmp.next.next;
 }
 }
if (scan.hasNext()) {
scan.nextLine();
 }
//write(root);
 }

write(root);
 }

publicstaticvoidwrite(Noderoot)
 {
Nodetmp = root;
while(tmp != null) {
System.out.print(tmp.data + " ");
tmp = tmp.next;
 }
System.out.println();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJavaList {

staticclassNode {
publicintdata;
publicNodenext = null;

Node()
 {

 }

Node(intdata) {
this.data = data;
 }
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intsize = scan.nextInt();

Nodetmp = newNode();
Noderoot = tmp;

for (intx = 0; x < size; x++) {
if (x == 0) {
tmp.data = scan.nextInt();
 } else {
tmp.next = newNode(scan.nextInt());
tmp = tmp.next;
 }
 }

Nodetmp2;
intquery = scan.nextInt(),
index, number;
scan.nextLine();
Strings;
for (intx = 0; x < query; x++) {
tmp = root;
s = scan.nextLine();
if (s.equals("Insert")) {
index = scan.nextInt();
number = scan.nextInt();
if (index == 0) {
root = newNode(number);
root.next = tmp;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }
tmp2 = newNode(number);
tmp2.next = tmp.next;
tmp.next = tmp2;
 }
 } else {
index = scan.nextInt();
if (index == 0) {
root = root.next;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }

tmp.next = tmp.next.next;
 }
 }
if (scan.hasNext()) {
scan.nextLine();
 }
//write(root);
 }

write(root);
 }

publicstaticvoidwrite(Noderoot)
 {
Nodetmp = root;
while(tmp != null) {
System.out.print(tmp.data + " ");
tmp = tmp.next;
 }
System.out.println();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJavaList {

staticclassNode {
publicintdata;
publicNodenext = null;

Node()
 {

 }

Node(intdata) {
this.data = data;
 }
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intsize = scan.nextInt();

Nodetmp = newNode();
Noderoot = tmp;

for (intx = 0; x < size; x++) {
if (x == 0) {
tmp.data = scan.nextInt();
 } else {
tmp.next = newNode(scan.nextInt());
tmp = tmp.next;
 }
 }

Nodetmp2;
intquery = scan.nextInt(),
index, number;
scan.nextLine();
Strings;
for (intx = 0; x < query; x++) {
tmp = root;
s = scan.nextLine();
if (s.equals("Insert")) {
index = scan.nextInt();
number = scan.nextInt();
if (index == 0) {
root = newNode(number);
root.next = tmp;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }
tmp2 = newNode(number);
tmp2.next = tmp.next;
tmp.next = tmp2;
 }
 } else {
index = scan.nextInt();
if (index == 0) {
root = root.next;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }

tmp.next = tmp.next.next;
 }
 }
if (scan.hasNext()) {
scan.nextLine();
 }
//write(root);
 }

write(root);
 }

publicstaticvoidwrite(Noderoot)
 {
Nodetmp = root;
while(tmp != null) {
System.out.print(tmp.data + " ");
tmp = tmp.next;
 }
System.out.println();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJavaList {

staticclassNode {
publicintdata;
publicNodenext = null;

Node()
 {

 }

Node(intdata) {
this.data = data;
 }
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intsize = scan.nextInt();

Nodetmp = newNode();
Noderoot = tmp;

for (intx = 0; x < size; x++) {
if (x == 0) {
tmp.data = scan.nextInt();
 } else {
tmp.next = newNode(scan.nextInt());
tmp = tmp.next;
 }
 }

Nodetmp2;
intquery = scan.nextInt(),
index, number;
scan.nextLine();
Strings;
for (intx = 0; x < query; x++) {
tmp = root;
s = scan.nextLine();
if (s.equals("Insert")) {
index = scan.nextInt();
number = scan.nextInt();
if (index == 0) {
root = newNode(number);
root.next = tmp;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }
tmp2 = newNode(number);
tmp2.next = tmp.next;
tmp.next = tmp2;
 }
 } else {
index = scan.nextInt();
if (index == 0) {
root = root.next;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }

tmp.next = tmp.next.next;
 }
 }
if (scan.hasNext()) {
scan.nextLine();
 }
//write(root);
 }

write(root);
 }

publicstaticvoidwrite(Noderoot)
 {
Nodetmp = root;
while(tmp != null) {
System.out.print(tmp.data + " ");
tmp = tmp.next;
 }
System.out.println();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJavaList {

staticclassNode {
publicintdata;
publicNodenext = null;

Node()
 {

 }

Node(intdata) {
this.data = data;
 }
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intsize = scan.nextInt();

Nodetmp = newNode();
Noderoot = tmp;

for (intx = 0; x < size; x++) {
if (x == 0) {
tmp.data = scan.nextInt();
 } else {
tmp.next = newNode(scan.nextInt());
tmp = tmp.next;
 }
 }

Nodetmp2;
intquery = scan.nextInt(),
index, number;
scan.nextLine();
Strings;
for (intx = 0; x < query; x++) {
tmp = root;
s = scan.nextLine();
if (s.equals("Insert")) {
index = scan.nextInt();
number = scan.nextInt();
if (index == 0) {
root = newNode(number);
root.next = tmp;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }
tmp2 = newNode(number);
tmp2.next = tmp.next;
tmp.next = tmp2;
 }
 } else {
index = scan.nextInt();
if (index == 0) {
root = root.next;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }

tmp.next = tmp.next.next;
 }
 }
if (scan.hasNext()) {
scan.nextLine();
 }
//write(root);
 }

write(root);
 }

publicstaticvoidwrite(Noderoot)
 {
Nodetmp = root;
while(tmp != null) {
System.out.print(tmp.data + " ");
tmp = tmp.next;
 }
System.out.println();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJavaList {

staticclassNode {
publicintdata;
publicNodenext = null;

Node()
 {

 }

Node(intdata) {
this.data = data;
 }
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intsize = scan.nextInt();

Nodetmp = newNode();
Noderoot = tmp;

for (intx = 0; x < size; x++) {
if (x == 0) {
tmp.data = scan.nextInt();
 } else {
tmp.next = newNode(scan.nextInt());
tmp = tmp.next;
 }
 }

Nodetmp2;
intquery = scan.nextInt(),
index, number;
scan.nextLine();
Strings;
for (intx = 0; x < query; x++) {
tmp = root;
s = scan.nextLine();
if (s.equals("Insert")) {
index = scan.nextInt();
number = scan.nextInt();
if (index == 0) {
root = newNode(number);
root.next = tmp;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }
tmp2 = newNode(number);
tmp2.next = tmp.next;
tmp.next = tmp2;
 }
 } else {
index = scan.nextInt();
if (index == 0) {
root = root.next;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }

tmp.next = tmp.next.next;
 }
 }
if (scan.hasNext()) {
scan.nextLine();
 }
//write(root);
 }

write(root);
 }

publicstaticvoidwrite(Noderoot)
 {
Nodetmp = root;
while(tmp != null) {
System.out.print(tmp.data + " ");
tmp = tmp.next;
 }
System.out.println();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJavaList {

staticclassNode {
publicintdata;
publicNodenext = null;

Node()
 {

 }

Node(intdata) {
this.data = data;
 }
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intsize = scan.nextInt();

Nodetmp = newNode();
Noderoot = tmp;

for (intx = 0; x < size; x++) {
if (x == 0) {
tmp.data = scan.nextInt();
 } else {
tmp.next = newNode(scan.nextInt());
tmp = tmp.next;
 }
 }

Nodetmp2;
intquery = scan.nextInt(),
index, number;
scan.nextLine();
Strings;
for (intx = 0; x < query; x++) {
tmp = root;
s = scan.nextLine();
if (s.equals("Insert")) {
index = scan.nextInt();
number = scan.nextInt();
if (index == 0) {
root = newNode(number);
root.next = tmp;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }
tmp2 = newNode(number);
tmp2.next = tmp.next;
tmp.next = tmp2;
 }
 } else {
index = scan.nextInt();
if (index == 0) {
root = root.next;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }

tmp.next = tmp.next.next;
 }
 }
if (scan.hasNext()) {
scan.nextLine();
 }
//write(root);
 }

write(root);
 }

publicstaticvoidwrite(Noderoot)
 {
Nodetmp = root;
while(tmp != null) {
System.out.print(tmp.data + " ");
tmp = tmp.next;
 }
System.out.println();
 }
}
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
packageDataStructure;

importjava.util.*;

publicclassJavaList {

staticclassNode {
publicintdata;
publicNodenext = null;

Node()
 {

 }

Node(intdata) {
this.data = data;
 }
 }

publicstaticvoidmain(String[] args) {
Scannerscan = newScanner(System.in);
intsize = scan.nextInt();

Nodetmp = newNode();
Noderoot = tmp;

for (intx = 0; x < size; x++) {
if (x == 0) {
tmp.data = scan.nextInt();
 } else {
tmp.next = newNode(scan.nextInt());
tmp = tmp.next;
 }
 }

Nodetmp2;
intquery = scan.nextInt(),
index, number;
scan.nextLine();
Strings;
for (intx = 0; x < query; x++) {
tmp = root;
s = scan.nextLine();
if (s.equals("Insert")) {
index = scan.nextInt();
number = scan.nextInt();
if (index == 0) {
root = newNode(number);
root.next = tmp;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }
tmp2 = newNode(number);
tmp2.next = tmp.next;
tmp.next = tmp2;
 }
 } else {
index = scan.nextInt();
if (index == 0) {
root = root.next;
 } else {
for (inty = 1; y < index; y++) {
tmp = tmp.next;
 }

tmp.next = tmp.next.next;
 }
 }
if (scan.hasNext()) {
scan.nextLine();
 }
//write(root);
 }

write(root);
 }

publicstaticvoidwrite(Noderoot)
 {
Nodetmp = root;
while(tmp != null) {
System.out.print(tmp.data + " ");
tmp = tmp.next;
 }
System.out.println();
 }
}