力扣310:
第二题:https://leetcode.cn/problems/optimal-partition-of-string/
遇到重复的字符时,才开始划分,这样能保证划分次数最少;此处用 Set 去重,遇到重复的字符说明要在此处划分了,划分完将 Set 进行 clear,继续下一次判断。
class Solution {
public int partitionString(String s) {
int res = 0;
Set<Character> set = new HashSet<>();
for (char c : s.toCharArray()) {
if (!set.add(c)) {
res++;
set.clear();
}
set.add(c);
}
return res + 1;
}
}
acwing68:
第二题:https://www.acwing.com/problem/content/4616/
将左边出的和右边出的加起来
#include <iostream>
using namespace std;
int main ()
{
int n;
string s;
cin >> n >> s;
int ans = 0;
int i = 0;
while (i < n && s[i] == '<') i++,ans++;
i = n - 1;
while (i >= 0 && s[i] == '>') i--,ans++;
cout << ans << endl;
return 0;
}