摘要：
class Solution { public: int lastRemaining(int n, int m) { int f = 0; for (int i = 2; i != n + 1; ++i) { f = (m + f) % i; } return f; } }; 阅读全文
摘要：
class Solution { public: int findComplement(int num) { int sum = 0; long long x = 1; while(num){ int shang = num/2; int yu = num%2; int y = (yu == 1)? 阅读全文
摘要：
class Solution { public: vector<int> shortestToChar(string S, char C) { vector<int>vc(S.size(),10001); for(int i=0;i < S.size();i++){ if(S[i] == C){ v 阅读全文
摘要：
class Solution { public: int countCharacters(vector<string>& words, string chars) { unordered_map<char,int>mpchar; for(char c:chars){ mpchar[c]++; } i 阅读全文
摘要：
class Solution { public: int findJudge(int N, vector<vector<int>>& trust) { vector<unordered_set<int>> vc1(N+1); vector<unordered_set<int>> vc2(N+1); 阅读全文