[프로그래머스][JAVA] 교점에 별 만들기 (구현)

실패원인

int형을 long값으로 바꾸어야함

maxX , minX, maxY, minY를 Long.MAX_VALUE, Long.MIN_VALUE로 초기화해야함

 

 

 

import java.util.HashSet;
import java.util.Arrays;
class Solution {
    static long minx= Long.MAX_VALUE, miny= Long.MAX_VALUE;
    static long maxx= Long.MIN_VALUE, maxy= Long.MIN_VALUE;
    
    public String[] solution(int[][] line) {
        String[] answer = {};
        HashSet<Point> pSet= new HashSet<>();
        
        //x= (bf-ed)/(ad-bc)
        //y= (ec-af)/(ad-bc)
        long x, y;
        for(int i=0; i<line.length-1; i++){
            long a= line[i][0];
            long b= line[i][1];
            long e= line[i][2];
            for(int j=i+1; j<line.length; j++){
                long c= line[j][0];
                long d= line[j][1];
                long f= line[j][2];
                
                long adbc= a*d-b*c;
                if(adbc==0) continue; //비교대상 직선과 평행함
                
                long bfed= b*f-e*d;
                if(bfed%adbc!=0) continue; //x가 정수가 아님
                
                long ecaf= e*c-a*f;
                if(ecaf%adbc!=0) continue; //y가 정수가 아님
                
                x= bfed/adbc;
                y= ecaf/adbc;
                pSet.add(new Point(x, y));
                
                minx= Math.min(minx, x);
                miny= Math.min(miny, y);
                maxx= Math.max(maxx, x);
                maxy= Math.max(maxy, y);
            }
        }
        
        long height= maxy-miny+1;
        long width= maxx-minx+1;
        answer= new String[(int)height];
        StringBuilder sb= new StringBuilder();
        for(int i=0; i<width; i++){
            sb.append(".");
        }
        
        Arrays.fill(answer, sb.toString());
        
        long nx, ny;
        for(Point p: pSet){
            ny= maxy-p.y;
            nx= p.x-minx;
            answer[(int)ny]= answer[(int)ny].substring(0, (int)nx)+"*"
                        +answer[(int)ny].substring((int)nx+1);
        }
        
        return answer;
    }
    
    public class Point{
        long x;
        long y;
        public Point(long x, long y){
            this.x= x;
            this.y= y;
        }
    }
}

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

---

실패코드

import java.util.*;
 
class Solution {
    public String[] solution(int[][] line) {
        Set<Point> set = new HashSet<>();
        int minX = 1001;
        int maxX = -1001;
        int minY = 1001;
        int maxY = -1001;
        
        for(int i=0; i<line.length; i++){
            for(int j=i+1; j<line.length; j++){
                int A = line[i][0];
                int B = line[i][1];
                int E = line[i][2];
                int C = line[j][0];
                int D = line[j][1];
                int F = line[j][2];
                
                int ADBC = A*D-B*C;
                if(ADBC==0) continue;
                
                int BFED = B*F-E*D;
                if(BFED%ADBC!=0) continue;
                
                int ECAF = E*C-A*F;
                if(ECAF%ADBC!=0) continue;
                
                
                
                
                int x = BFED/ADBC;
                int y = ECAF/ADBC;
                  
                set.add(new Point(x,y));
                
                minX = Math.min(minX, x);
                maxX = Math.max(maxX, x);
                minY = Math.min(minY, y);
                maxY = Math.max(maxY, y);
                
                
            }
        }
        int height = maxY-minY+1;
        int width = maxX-minX+1;
        
        // System.out.println(height+" "+width);
        char[][] charArr = new char[height][width];
        for(char[] cArr : charArr){
            Arrays.fill(cArr,'.');
        }
        
        for(Point p : set){
            int r = -p.y+maxY;
            int c = p.x-minX;
            
            
            // System.out.println(p.x+" "+p.y);
            // System.out.println(r+" "+c);
            // System.out.println();
            
            charArr[r][c]='*';
        }
        
        
        
        
        String[] answer = new String[charArr.length];
        for(int i=0; i<charArr.length; i++){
            answer[i] = new String(charArr[i]);
        }
        
        
        return answer;
    }
    
    public class Point{
        int x;
        int y;
        
        public Point(int x, int y){
            this.x = x;
            this.y = y;
        }
    }
}

 

 

 

 

메모리 초과남 2차원 char배열로 하면 안되는듯

 

 

 

 

 

import java.util.*;
 
class Solution {
    public String[] solution(int[][] line) {
        Set<Point> set = new HashSet<>();
        int minX = 1001;
        int maxX = -1001;
        int minY = 1001;
        int maxY = -1001;
        
        for(int i=0; i<line.length; i++){
            for(int j=i+1; j<line.length; j++){
                int A = line[i][0];
                int B = line[i][1];
                int E = line[i][2];
                int C = line[j][0];
                int D = line[j][1];
                int F = line[j][2];
                
                int ADBC = A*D-B*C;
                if(ADBC==0) continue;
                
                int BFED = B*F-E*D;
                if(BFED%ADBC!=0) continue;
                
                int ECAF = E*C-A*F;
                if(ECAF%ADBC!=0) continue;
                
                
                
                
                int x = BFED/ADBC;
                int y = ECAF/ADBC;
                  
                set.add(new Point(x,y));
                
                minX = Math.min(minX, x);
                maxX = Math.max(maxX, x);
                minY = Math.min(minY, y);
                maxY = Math.max(maxY, y);
                
                
            }
        }
        int height = maxY-minY+1;
        int width = maxX-minX+1;
        
        // System.out.println(height+" "+width);
        String[] answer = new String[height];
        StringBuilder sb = new StringBuilder();
        for(int i=0; i<width; i++){
            sb.append('.');
        }
        for(int i=0; i<height; i++){
            answer[i] = new String(sb);
        }
        
        for(Point p : set){
            int r = -p.y+maxY;
            int c = p.x-minX;
            
            answer[r] = answer[r].substring(0, c) + "*" + answer[r].substring(c+1,width);
           
        }
 
        
        
        return answer;
    }
    
    public class Point{
        int x;
        int y;
        
        public Point(int x, int y){
            this.x = x;
            this.y = y;
        }
    }
}

 

 

 

또 초과