摘要:
思路很巧妙 class Solution { public: int getMaximumConsecutive(vector<int>& coins) { sort(coins.begin(),coins.end()); int x = 0; for(int y:coins) { if(y > x 阅读全文
摘要:
class Solution { public: string decodeMessage(string key, string message) { string letters = "abcdefghijklmnopqrstuvwxyz"; int index = 0; for (int i = 阅读全文