Leetcode · 83 biweekly match · 6128. best poker hand · simulation

link ：https://leetcode.cn/problems/best-poker-hand/solution/jian-dan-mo-ni-by-xun-ge-v-q4zp/
source ： Power button （LeetCode）
The copyright belongs to the author . Commercial reprint please contact the author for authorization , Non-commercial reprint please indicate the source . 

subject

Example

Ideas

Their thinking
simulation
Simulate according to the given requirements of the topic
Two arrays will be given , Do a simple treatment , Make the same size , Count the cards with the same color , Then the array after statistics , Sort in descending order , Then judge the card type whose maximum value meets the requirements according to the requirements of the title

Code

int cmp(const void * a, const void *b)
{
    return *(int *)b - *(int *)a;
}
char * bestHand(int* ranks, int ranksSize, char* suits, int suitsSize){
    int ans[14];
    int str[4];
    memset(ans, 0, sizeof(int) * 14);// initialization 
    memset(str, 0, sizeof(int) * 4);// initialization 
    for(int i = 0; i < ranksSize; i++)// Deal with cards 
    {
        ans[ranks[i]]++;
        str[suits[i] - 'a']++;
    }
    qsort(ans, 14, sizeof(int), cmp);
    qsort(str, 4, sizeof(int), cmp);// Descending 
    if(str[0] == 5)// Judge card type 
    {
        return "Flush";
    }
    if(ans[0] >= 3)
    {
        return "Three of a Kind";
    }
    if(ans[0] == 2)
    {
        return "Pair";
    }
    return "High Card";
}

 author ：xun-ge-v
 link ：https://leetcode.cn/problems/best-poker-hand/solution/jian-dan-mo-ni-by-xun-ge-v-q4zp/
 source ： Power button （LeetCode）
 The copyright belongs to the author . Commercial reprint please contact the author for authorization , Non-commercial reprint please indicate the source .

Time and space complexity