-
Notifications
You must be signed in to change notification settings - Fork 33
/
ReverseShuffleMerge.cs
70 lines (55 loc) · 1.83 KB
/
ReverseShuffleMerge.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
// Reverse Shuffle Merge
using System.CodeDom.Compiler;
using System.Collections.Generic;
using System.Collections;
using System.ComponentModel;
using System.Diagnostics.CodeAnalysis;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Reflection;
using System.Runtime.Serialization;
using System.Text.RegularExpressions;
using System.Text;
using System;
class Solution {
// Complete the reverseShuffleMerge function below.
static string reverseShuffleMerge(string s)
{
int a = 'a';
var m = 'z' - a + 1;
var frequency = new int[m];
for (var index = 0; index < frequency.Length; index++)
frequency[index] = 0;
foreach (var c in s.ToCharArray())
frequency[c - a]++;
var count = new int[m];
for (var index = 0; index < frequency.Length; index++)
count[index] = frequency[index] / 2;
var top = -1;
var stack = new int[s.Length];
for (int n = s.Length; --n >= 0;)
{
int c = s[n] - a;
frequency[c]--;
if (count[c] < 1) continue;
count[c]--;
while (top >= 0 &&
stack[top] > c &&
frequency[stack[top]] > count[stack[top]])
{
count[stack[top--]]++; // Increment and then pop the stack
}
stack[++top] = c; // Push c on to the stack
}
return string.Concat(stack.Take(top + 1).Select(x => (char)(x + a)));
}
static void Main(string[] args) {
TextWriter textWriter = new StreamWriter(@System.Environment.GetEnvironmentVariable("OUTPUT_PATH"), true);
string s = Console.ReadLine();
string result = reverseShuffleMerge(s);
textWriter.WriteLine(result);
textWriter.Flush();
textWriter.Close();
}
}