Prince_H_23的博客

周赛地址1.模拟class Solution {public: vector<string> cellsInRange(string s) { vector<string> ans; char c1 = s[0]; char c2 = s[3]; char n1 = s[1]; char n2 = s[4]; for(char c = c1; c <= c2; c+.

周赛地址1.模拟class Solution {public: int countElements(vector<int>& nums) { sort(nums.begin(), nums.end()); int n = nums.size(); if(n <= 2) return 0; if(nums[0] == nums[n - 1]) return 0; int ans = n .

周赛地址1.模拟class Solution {public: string firstPalindrome(vector<string>& words) { for(auto& s:words){ int l = 0, r = s.size() - 1; int flag = 1; while(l < r){ if(s[l] != s[.

周赛地址1.暴力模拟class Solution {public: int timeRequiredToBuy(vector<int>& tickets, int k) { int ans = 0; while(tickets[k] != 0){ for(int i = 0; i < tickets.size(); i++){ if(tickets[i] == 0) continu