Deep_Lee
article thumbnail


๋‘ ์ง์„ ์ด ๊ฒน์น˜๋Š” ๊ฒฝ์šฐ ( ํ‰ํ–‰ ํ•˜๋Š” ๊ฒฝ์šฐ ) = ๊ธฐ์šธ๊ธฐ๊ฐ€ ๊ฐ™๋‹ค๋Š” ๊ฒƒ์ด๋‹ค.

4๊ฐœ์˜ ์ขŒํ‘œ์—์„œ ์„œ๋กœ 2๊ฐœ์”ฉ ์ด์–ด์„œ 2๊ฐœ์˜ ์ง์„ ์ด ๋งŒ๋“ค์–ด์กŒ์„๋•Œ, ๊ทธ ์ง์„ ์˜ ๊ธฐ์šธ๊ธฐ๊ฐ€ ๊ฐ™์€๊ฒŒ ์žˆ๋‹ค๋ฉด return 1 

 

๊ธฐ์šธ๊ธฐ๊ฐ€ ๊ฐ™๋‹ค = ( y์ขŒํ‘œ์˜ ์ฐจ์ด / x ์ขŒํ‘œ์˜ ์ฐจ์ด ) ๊ฐ€ ๊ฐ™๋‹ค๋Š” ๊ฒƒ

( y๊ฐ’์˜ ์ฆ๊ฐ€๋Ÿ‰ / x๊ฐ’์˜ ์ฆ๊ฐ€๋Ÿ‰ ) 

 

class Solution {
    public double find(int[] a, int[] b){
        // ๊ธฐ์šธ๊ธฐ ๊ณต์‹ = y๊ฐ’์˜ ์ฆ๊ฐ€๋Ÿ‰ / x๊ฐ’์˜ ์ฆ๊ฐ€๋Ÿ‰
        return (double)(b[1]-a[1])/(b[0]-a[0]);
    }
    public int solution(int[][] dots) {
        int answer = 0;

        if (find(dots[0],dots[1])==find(dots[2],dots[3])){
            return 1;
        }

        if (find(dots[0],dots[2])==find(dots[1],dots[3])){
            return 1;
        }

        if (find(dots[0],dots[3])==find(dots[1],dots[2])){
            return 1;
        }
        return answer;
    }
}