-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStringReverse.cs
More file actions
72 lines (65 loc) · 1.97 KB
/
StringReverse.cs
File metadata and controls
72 lines (65 loc) · 1.97 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
namespace DA.Algorithms.Strings
{
public static class StringReverse
{
/// <summary>
/// Reverse all characters of the source array.
/// </summary>
/// <param name="source">string reference</param>
public static void Reverse (char[] source)
{
int start = 0;
int end = source.Length - 1;
char temp;
while (start < end)
{
temp = source[start];
source[start] = source[end];
source[end] = temp;
++start;
--end;
}
}
/// <summary>
/// Reverse all characters of the source array.
/// </summary>
/// <param name="source">string reference</param>
/// <param name="start">start index of a reverse range</param>
/// <param name="end">end index of a reverse range</param>
public static void Reverse (char[] source, int start, int end)
{
char temp;
while (start < end)
{
temp = source[start];
source[start] = source[end];
source[end] = temp;
++start;
--end;
}
}
/// <summary>
/// Reverse order of words in a string sentence.
/// </summary>
/// <param name="source">reference to array of a characters</param>
public static void ReverseWords (char[] source)
{
int lower = 0;
int upper = -1;
for (int i = 0; i < source.Length; i++)
{
if (source[i] == ' ' || source[i] == '\0')
{
Reverse (source, lower, upper);
lower = i + 1;
upper = i;
}
else
{
++upper;
}
}
Reverse (source, 0, source.Length - 1);
}
}
}