-
Notifications
You must be signed in to change notification settings - Fork 0
/
movenonzerotoleft.cs
162 lines (141 loc) · 2.27 KB
/
movenonzerotoleft.cs
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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
using System;
public class Program
{
public static void Main()
{
LinkedList list = new LinkedList();
list.Add(85);
list.Add(15);
list.Add(4);
list.Add(20);
list.PrintList();
Console.WriteLine();
list.Reverse();
list.PrintList();
int[] arr = new int[8]{4, -1, -2, 0, -3, -2, 0, -7};
int[] results = movenonzerotoleft(arr);
for (int i = 0; i < results.Length; i++)
{
Console.Write(results[i] + " ");
}
}
public static void moveNonZeroToLeft(int[] arr)
{
int length = arr.Length;
int k=0;
for(int i=0; i<length; i++)
{
if(arr[i] != 0)
{
arr[k] = arr[i];
k++;
}
}
while(k < length)
{
arr[k] = 0;
k++;
}
for(int j=0; j<length; j++)
{
Console.Write(arr[j] + " ");
}
}
public static int[] movenonzerotoleft(int[] arr)
{
int length = arr.Length;
int lastIndex = arr.Length - 1;
for (int i = 0; i < length; i++)
{
if (i == lastIndex)
break;
if (arr[i] == 0)
{
//swap to last index
int temp = arr[lastIndex];
arr[lastIndex] = arr[i];
arr[i] = temp;
lastIndex--;
}
}
return arr;
}
}
public class Node
{
public int Data
{
get;
set;
}
public Node Next
{
get;
set;
}
public Node(int newData)
{
Data = newData;
Next = null;
}
}
public class LinkedList
{
public Node Head
{
get;
set;
}
public LinkedList()
{
Head = null;
}
public void Add(int newData)
{
Node newNode = new Node(newData);
if (Head == null)
{
Head = newNode;
}
else
{
Node temp = Head;
while (temp != null) //iterate until the last node
{
if (temp.Next != null)
{
temp = temp.Next;
}
else
{
temp.Next = newNode;
break;
}
}
temp.Next = newNode;
}
}
public void PrintList()
{
Node temp = Head;
while (temp != null)
{
Console.Write(temp.Data + " ");
temp = temp.Next;
}
}
public void Reverse()
{
Node prev = null;
Node current = Head;
Node next = null;
while (current != null)
{
next = current.Next;
current.Next = prev;
prev = current;
current = next;
}
Head = prev;
}
}