#include <iostream>
using namespace std;
int main()
{
string a;
cin >> a;
cout << a[6] % 2;
return 0;
}
输出字符串最后一位%2的值就行了😅
在整个字符串中找到一个长为26,各个非问号字母均出现1次的字串,对他稍加修改,再把字串外的问号全变为’A’
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int t[10000], n, k;
int main()
{
string s;
cin >> s;
for (int ip = 0; s[ip + 25]; ip ++ )
{
int m = 1;
memset(t, 0, sizeof t);
for (int j = ip; j < ip + 26; j ++ )
{
if (t[s[j]] && s[j] != '?') m = 0;
t[s[j]] = 1;
}
if (m)
{
for (int i = ip; i < ip + 26; i ++ )
if (s[i] == '?')
for (int j = 'A'; j <= 'Z'; j ++ )
if (!t[j])
{
t[j] = 1;
s[i] = j;
break;
}
for (int i = 0; s[i]; i ++ )
if (s[i] == '?') s[i] = 'A';
cout << s;
return 0;
}
}
puts("-1");
return 0;
}
排序 依次选择最小元素即可
如果比所有和都要大,则循环中不会更新 res[i]
class Solution {
public:
vector<int> answerQueries(vector<int>& nums, vector<int>& queries) {
sort(nums.begin(), nums.end());
int n = queries.size();
vector<int> res(n);
for(int i = 0; i < n; ++i){
int sum = 0;
for(int j = 0; j < nums.size(); ++j){
sum += nums[j];
if(sum > queries[i]) {res[i] = j; break;}
}
if(sum <= queries[i]) {res[i] = nums.size();}
}
return res;
}
};
感觉比第一题简单,直接按照顺序遍历就行
class Solution {
public:
string removeStars(string s) {
string ret;
for (auto ch : s) {
if (ch != '*') {
ret += ch;
} else {
ret.pop_back();
}
}
return ret;
}
};