Leetcode in Java && Oracle
422 subscribers
8 photos
397 files
400 links
Second channel: @codeforces_java

Let's Develop Together!
Download Telegram
image_2022-02-04_18-41-26.png
61 KB
#N2103. Rings and Rods
problem link

#solution
public int countPoints(String rings) {
int n = rings.length()/2;
int arr1[] = new int[10];
int arr2[] = new int[10];
int arr3[] = new int[10];
int count = 0;

for(int i=0; i<n; i++){
if(rings.charAt(2*i) == 'R')
arr1[rings.charAt(2*i+1)-'0']++;
if(rings.charAt(2*i) == 'G')
arr2[rings.charAt(2*i+1)-'0']++;
if(rings.charAt(2*i) == 'B')
arr3[rings.charAt(2*i+1)-'0']++;
}

for(int i=0; i<10; i++){
if(arr1[i]*arr2[i]*arr3[i] != 0)
count++;
}

return count;
}