Check if the Rectangle Corner Is Reachable
You are given two positive integers xCorner and yCorner, and a 2D array circles, where circles[i] = [xi, yi, ri] denotes a circle with center at (xi, yi) and radius ri.
There is a rectangle in the coordinate plane with its bottom-left corner at the origin and top-right corner at the coordinate (xCorner, yCorner). You need to check whether there is a path from the bottom-left corner to the top-right corner such that:
- The entire path lies inside the rectangle.
- The path does not touch or lie inside any circle.
- The path touches the rectangle only at the two corners.
Return true if such a path exists, and false otherwise.
Example 1
Input
xCorner = 3, yCorner = 4, circles = [[2,1,1]]Output
trueThe black curve shows a possible path between
(0, 0) and (3, 4).Example 2
Input
xCorner = 3, yCorner = 3, circles = [[1,1,2]]Output
falseNo path exists from
(0, 0) to (3, 3).Constraints
- 3 <= xCorner, yCorner <= 10^9
- 1 <= circles.length <= 1000
- circles[i].length == 3
- 1 <= xi, yi, ri <= 10^9