滴滴 oa

oa过了 hr聊完没下文了
1. 之前有人发过的题 public int solution(String s);
S consists of N lowercase letters, return a minimal number of letters that must be deleted to obtain a word in which every letter occurs a unique number of times. occurrences of letters at least once.
2. public int solution(int[] A);
return the max sum of two numbers whose digits have an equal sum, return -1 otherwise.
求大米呀， 188分的帖子看不了很难受

我好像发错版块了。。。不好意思