烧烤团子

6037. 按奇偶性交换后的最大数字 class Solution { public: int largestInteger(int num) { int n=0; int cal=num; vector<int>count; int res=0; while(cal>0) { n++; count.insert(count.begin

6055. 转化时间需要的最少操作数 class Solution { public: int convertTime(string current, string correct) { int t1=stoi(correct.substr(0,2))-stoi(current.substr(0,2)); int t2=stoi(correct.substr(3,2))-stoi(current.substr(3,2)); int k=t1*.

第一题直接过了，哈希表 class Solution { public: vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) { unordered_set<int>hash1; unordered_set<int>hash2; sort(nums1.begin(.