摘要：
反转字符串 class Solution { public: void reverseString(vector<char>& s) { int n = s.size(); for (int i = 0; i < n/2; i++){ char tmp = s[i]; s[i] = s[n-1-i] 阅读全文
摘要：
class Solution { public: string bestHand(vector<int>& ranks, vector<char>& suits) { int sameNum = 0; if (count(suits.begin(),suits.end(),suits[0]) == 阅读全文