package leetcode;

public class Problem1162 {
}

@@ -16,33 +16,557 @@
 e;%0A%0A
-public class Problem1162 %7B
+/**%0A * https://leetcode.com/problems/as-far-from-land-as-possible/%0A */%0Apublic class Problem1162 %7B%0A    public int maxDistance(int%5B%5D%5B%5D grid) %7B%0A        // TODO%0A        return 0;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Problem1162 prob = new Problem1162();%0A        System.out.println(prob.maxDistance(new int%5B%5D%5B%5D%7B%0A            %7B1,0,1%7D,%0A            %7B0,0,0%7D,%0A            %7B1,0,1%7D%0A        %7D)); //%0A        System.out.println(prob.maxDistance(new int%5B%5D%5B%5D%7B%0A            %7B1,0,0%7D,%0A            %7B0,0,0%7D,%0A            %7B0,0,0%7D%0A        %7D)); // 4%0A    %7D
 %0A%7D%0A

Update problem 1162