class Solution {
public:
int res[11][4];
int countPoints(string s) {
int n = s.size();
for(int i=1;i<n;i++){
if(s[i]>='0'&&s[i]<='9'){
int d = s[i]-'0';
int r;
if(s[i-1]=='R') r=0;
if(s[i-1]=='G') r=1;
if(s[i-1]=='B') r=2;
res[d][r]=1;
}
}
int ans=0;
for(int i=0;i<10;i++){
if((res[i][0]+res[i][1]+res[i][2])==3)ans++;
}
return ans;
}
};
LeetCode 2103. 环和杆
最新推荐文章于 2024-06-12 11:21:39 发布