본문 바로가기

🚀 Algorithm/BOJ

8958

 

 

 

 

 

 

 

 

 

import java.util.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        String arr[] = new String[sc.nextInt()];
        
        for(int i=0; i<arr.length; i++){ //5번
            arr[i]=sc.next();
        }
        sc.close();
        
        for(int i=0; i<arr.length; i++){ //5
            int cnt = 0;
            int score = 0;
            for(int j=0; j<arr[i].length(); j++){
                if(arr[i].charAt(j)=='O'){
                    cnt++;
                    
                }else {
                    cnt = 0;
                }
                score+=cnt;
            }
            System.out.println(score);
                
        }
            
    }
}

 

더보기
import java.util.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        String arr[] = new String[sc.nextInt()];
        
        for(int i=0; i<arr.length; i++){ //5번
            arr[i]=sc.next();
        }
        sc.close();
        
        for(int i=0; i<arr.length; i++){ 
            int cnt = 0;
            int score = 0;
            for(int j=0; j<arr[i].length; j++){ //length가 아닌 lenght()
                if(arr[i].charAt[j]=='O'){ //charAt[j]가 아닌 charAt(j)
                    cnt++;
                    
                }else {
                    cnt = 0;
                }
                score+=cnt;
            }
            System.out.println(score);
                
        }
            
    }
}

 

'🚀 Algorithm > BOJ' 카테고리의 다른 글

[백준] 2178 미로 탐색(JAVA)  (0) 2023.03.27
[백준] 1926 그림(JAVA)  (0) 2023.03.21
1110  (0) 2021.08.16
10952 10951  (0) 2021.08.15
2439  (0) 2021.08.15