백준 8958

OO -> 1+2

OX -> 1+0

OXO -> 1+0+1

OOOO-> 1+2+3+4

test  

5
OOXXOXXOOO
OOXXOOXXOO
OXOXOXOXOXOXOX
OOOOOOOOOO
OOOOXOOOOXOOOOX

output

10
9
7
55
30

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

int testCase = sc.nextInt();

sc.nextLine();

String[] input = new String[testCase];

int count =0;

int sum=0;

int[] sumArr = new int[testCase];

int buff;

for(int i=0;  i<testCase ; i++ ){

input[i] = sc.nextLine();

for(int j=0; j<input[i].length() ; j++){

if(input[i].charAt(j) == 'O'){

count++;

input[i]=input[i].replaceFirst("O", ""+ count);

buff= count;

}else{

input[i]=input[i].replaceFirst("X", "0");

count=0;

buff= 0;

}

sum += buff;

}

sumArr[i] = sum;

count=0;

sum=0;

}

for(int i=0;  i<testCase ; i++ ){

System.out.println(sumArr[i]);

}

System.out.println(Arrays.toString(input));

}