https://leetcode.com/contest/weekly-contest-73/problems/custom-sort-string/
First I tried to use lambda for Arrays.sort(T[]), but it doesn't work that way.
So I come up with 3 arrays of the length of 27 which covers all the chars.
the
count: char -> occurrence
map: char -> i index
seq: index i -> char
this way, you can easily assemble the answer.
From their sorted sequence, with given char and the respective occurrence. all within your reach in O(1).
That's crazily fast! So let's do it!
No comments:
Post a Comment