bars
📈
notes
search
circle-xmark
⌘
Ctrl
k
copy
Copy
chevron-down
0914_X_of_a_Kind_in_a_Deck_of_Cards
思路1 统计各个数出现的次数,然后求次数之间是否存在公约数
如果a == b,则gcd(a,b)就是a
Previous
0914_X_of_a_Kind_in_a_Deck_of_Cards
chevron-left
Next
0922_Sort_Array_By_Parity_II
chevron-right
Last updated
5 years ago