38.外观数列
题目链接
可以熟悉一下string
class Solution {
public:
string countAndSay(int n) {
string pre = "1";
for(int i = 1; i < n; i++){
int cnt = 1;
string nxt = "";
for(int j = 1; j < pre.length(); j++){
if(pre[j] != pre[j-1]){
nxt += to_string(cnt);
nxt += pre[j-1];
cnt = 0;
}
cnt++;
}
nxt += to_string(cnt);
nxt += pre[pre.length()-1];
pre = nxt;
}
return pre;
}
};
53.最大子序和
题目链接
最水的dp那一类
class Solution {
public:
typedef long long LL;
int maxSubArray(vector<int>& nums) {
LL mx=nums[0],sum=0;
for(int i=0;i<nums.size();i++){
sum+=nums[i];
mx=max(sum,mx);
sum=max(sum,0LL);
}
return mx;
}
};