- There Are N Trees Numbered From 0 To N 1 In A Forest The K Th Tree Is Located At Coordinates X K Y K We Want To 1 (167.34 KiB) Viewed 78 times
There are N trees (numbered from 0 to N-1) in a forest. The K-th tree is located at coordinates (X[K], Y[K]). We want to build the widest possible vertical path, such that there is no tree on it. The path must be built somewhere between a leftmost and a rightmost tree, which means that the width of the path cannot be infinite. What is the width of the widest possible path that can be built? Write a function: class Solution { public int solution (int[] X, int[] Y); } that, given two arrays X and Y consisting of N integers each, denoting the positions of trees, returns the width of the widest possible path that can be built. Examples: 1. Given X=[1, 8, 7, 3, 4, 1, 8], Y=[6, 4, 1, 8, 5, 1, 7], the function should return 3. 8 7 6