-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.cs
More file actions
66 lines (59 loc) · 1.71 KB
/
Solution.cs
File metadata and controls
66 lines (59 loc) · 1.71 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
public class Solution
{
public int[] SmallestTrimmedNumbers(string[] nums, int[][] queries)
{
int n = nums.Length;
int len = nums[0].Length;
int[][] memo = new int[len + 1][];
for (int i = 0; i <= len; i++)
{
memo[i] = new int[n];
}
for (int i = 0; i < n; i++)
{
memo[0][i] = i;
}
RadixSort(nums, memo);
int m = queries.Length;
int[] ret = new int[m];
for (int i = 0; i < m; i++)
{
int idx = queries[i][0], place = queries[i][1];
ret[i] = memo[place][idx - 1];
}
return ret;
}
void RadixSort(string[] nums, int[][] memo)
{
int n = nums.Length;
int len = nums[0].Length;
int[] counts = new int[10];
for (int place = 1; place <= len; place++)
{
Array.Clear(counts);
for (int i = 0; i < n; i++)
{
int key = nums[i][^place] - '0';
counts[key]++;
}
int startIdx = 0;
for (int i = 0; i < 10; i++)
{
int count = counts[i];
counts[i] = startIdx;
startIdx += count;
}
int[] sortedIndex = new int[n];
string[] sortedArray = new string[n];
for (int i = 0; i < n; i++)
{
int key = nums[i][^place] - '0';
sortedIndex[counts[key]] = memo[place - 1][i];
sortedArray[counts[key]] = nums[i];
counts[key]++;
}
Array.Copy(sortedIndex, memo[place], n);
Array.Copy(sortedArray, nums, n);
}
}
}