package com.wdbyte.leetcode;

public class LeetCode587_OuterTrees {

public static void main(String[] args) {

int[][] trees = {{1, 1}, {2, 2}, {2, 0}, {2, 4}, {3, 3}, {4, 2}};

System.out.println(multi(trees[2], trees[2], trees[4]));

}

public int[][] outerTrees(int[][] trees) {

// 1. 找到最左边的一个点

int startX = 0;

int startY = 0;

for (int[] tree : trees) {

int x = tree[0];

int y = tree[1];

if (x < startX) {

startX = x;

startY = y;

}

}

// 2. 从最左边的一个点开始，寻找最大角度的点的连线

return null;

}

static int[][] sort(int[][] trees) {

return trees;

}

//计算叉积，p1，p2，p0都为点

static double multi(int[] p1, int[] p2, int[] p0) {

double x1, y1, x2, y2;

x1 = p1[0] - p0[0];

y1 = p1[1] - p0[1];

x2 = p2[0] - p0[0];

y2 = p2[1] - p0[1];

return x1 * y2 - x2 * y1;

}

}