NO.1
思路:while输入字符串自动跳过空格,首字符如果为小写,减去32就为大写,最后强转为字符型就可以了。
代码实现:
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s;
while (cin >> s)
{
if (s[0] >= 'a' && s[0] <= 'z') {
cout << (char)(s[0] - 32);
}
else
{
cout << s[0];
}
}
return 0;
}
NO.2
思路:利用双指针,先将数据求和如果大于等于数据x,先进行判断,我们现在的长度是否小于relen,如果小于,则记录现在的left和right下标,更新relen,再减去数组第一个值arr[left],再left++,right++,再进行下次的求和。
代码实现:
#include<iostream>
using namespace std;
const int N = 1e7 + 10;
int arr[N];
int n, x;
int main()
{
cin >> n >> x;
for (int i = 0; i < n; i++) cin >> arr[i];
int relen = N;
int left = 0, right = 0, rleft = -1, rright = -1,sum=0;
while (right < n)
{
sum += arr[right];
while (sum >= x)
{
if (right - left + 1 < relen)
{
rleft = left;
rright = right;
relen = right - left;
}
sum -= arr[left++];
}
right++;
}
cout << left << " " << right << endl;
return 0;
}
NO.3
思路:先将数据求和,再将偶数全部放入大堆,取堆顶除2再减去这个数,如果这个数还为偶数继续入大堆(优先级队列)。
代码实现:
#include<iostream>
#include<queue>
using namespace std;
typedef long long ll;
int n, k;
priority_queue<int> q;
int main()
{
ll sum = 0;
cin >> n>>k;
ll x;
while (n--)
{
cin >> x;
sum += x;
if (x % 2 == 0) q.push(x);
}
while (q.size() && k--)
{
ll t = q.top() / 2;
q.pop();
sum -= t;
if (t % 2 == 0) q.push(t);
}
cout << sum << endl;
return 0;
}