最少递减子序列个数和子序列(pythoh)求重复元素个数(C++)
ACM模式
inputstr = input()
nums = [int(i) for i in inputstr.split(',')]
dp = [0 for i in range(len(nums))]
ans = 0
n = len(nums)
for i in range(n):
dp[i] = 1
for j in range(i):
if nums[j] <= nums[i]:
dp[i] = max(dp[i], dp[j] + 1)
ans = max(dp[i], ans)
if ans == 0:
print(1)
else:
print(ans)
result = []
for i in range(1, max(dp)+1):
result.append([])
for j in range(len(dp)):
if dp[j] == i:
result[i-1].append(str(nums[j]))
for x in result:
print(','.join(x))
输入: 7,3,6,5,2,1
输出:3
7,3,2,1
6,5
2求重复元素个数
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main() {
string str;
getline(cin, str);
vector<int> res;
for (int i = 0; i < str.size(); ++i) {
if (str[i] >= '0' && str[i] <= '9') {
int tmp;
if (i >= 1 && str[i - 1] == '-') {
tmp = 0-(str[i] - '0');
}
else {
tmp = str[i] - '0';
}
res.push_back(tmp);
}
}
sort(res.begin(), res.end());
int count=0;
for (int i = 0; i < res.size(); ++i) {
if (i >= 1 && res[i - 1] == res[i]) continue;
count++;
}
cout<<count << endl;
return 0;
}
ACM自测没问题,输入AC
输入:[1,2,2,3]
输出:3