[Algorithm_Java] 바탕화면 정리 (Success)

프로그래머스

 

 

☕Language: Java

class Solution {
    public int[] solution(String[] wallpaper) {
        int[] answer = new int[4];
        
        int east = wallpaper[0].length();
        int west = 0;
        int north = wallpaper.length;
        int south = 0;
        
        
        for(String row : wallpaper) {
            east = east > calcRowMin(row) ? calcRowMin(row) : east;
            west = west < calcRowMax(row) ? calcRowMax(row) : west;
        }
        
        for(int i=0; i<wallpaper.length; i++) {
            if(calcMinSharp(wallpaper[i])) {
                north = i;
                break;                
            }
        }
        
        for(int i=0; i<wallpaper.length; i++) {
            south = calcMaxSharp(wallpaper[i]) ? i : south;
        }
        
        answer[0] = north;
        answer[1] = east;
        answer[2] = south+1;
        answer[3] = west+1;
        
        
        return answer;
    }
 
    public static int calcRowMin(String row) {
        int min=row.length();
 
        for(int i=0; i<row.length(); i++) {
            if(row.charAt(i)=='#') {
                min = min > i ? i : min;
                break;
            }
        }
        
        return min;
        
    }
    
    public static int calcRowMax(String row) {
        int max=-1;
 
        for(int i=row.length()-1; i>=0; i--) {
            if(row.charAt(i)=='#') {
                max = max < i ? i : max;
                break;
            }
        }
        
        return max;
        
    }
    
    public static boolean calcMinSharp(String row) {
        boolean result = false;
 
        for(int i=0; i<row.length(); i++) {
            if(row.charAt(i)=='#') {
                result = true;
                break;
            }
        }
 
        return result;
        
    }
 
    public static boolean calcMaxSharp(String row) {
        boolean result = false;
 
        for(int i=row.length()-1; i>=0; i--) {
            if(row.charAt(i)=='#') {
                result = true;
                break;
            }
        }
 
        return result;
        
    }
 
}
 

1. int east, west, north, south

    - 상하좌우 최대, 최소를 담을 변수 선언

2. calcRowMin

    - 좌우 최소값 탐색

3. calcRowMax

    - 좌우 최대값 탐색

4. calcMinSharp

    - 상하 최소값(배열 중 첫번째 Sharp 위치) 탐색

5. calcMaxSharp

    - 상하 최대값(배열 중 마지막 Sharp 위치) 탐색

 

 

😮 찾아본 풀이

class Solution {
    public int[] solution(String[] wallpaper) {
        int minX = 50;
        int minY = 50;
        int maxX = -1;
        int maxY = -1;
        for(int i=0; i< wallpaper.length; i++){
            for(int j=0; j<wallpaper[i].length(); j++){
                if(wallpaper[i].charAt(j)=='#'){
                    minX = Math.min(minX,i);
                    minY = Math.min(minY,j);
                    maxX = Math.max(maxX,i);
                    maxY = Math.max(maxY,j);
                }
            }
        }
        return new int[]{minX,minY,maxX+1,maxY+1};
    }
}
 

* Min, Max 함수 활용

 

 

 

🔗 소스 코드
GitHub

 

📚 참고 자료

프로그래머스