Java方法在不特定于字母序列的字符串中查找字母集？

Question

In Java I am developing scramble game for playing with words.

If player1 sends letters like "B,A,C,N,R,E" , then again player1 should not send same set of letters ( sequence does not matter ) eg "A,B,C,N,R,E", "B,A,N,C,E,R" etc.

Is there anyway to find the given set of letters in a string not specific with sequence of Letters?

Answer 1

Corresponding to player1, you can sort and store the sequence he has sent. Next time he chooses a sequence, sort it and do a check in the map

Answer 2

1) Sort the letters as it was said before. Complexity O(n log n).

2) To implement some kind of array with counters where the ordinal number of the simbol in alphabet will be an index in mask array. And use this mask array to match the words. Just like that Integer[] maskArray = [0(for A),0(for B),0(for C),etc.] Complexity O(n).