package leetcode;

/**
 * https://leetcode.com/problems/shortest-bridge/
 */
public class Problem934 {
    public int shortestBridge(int[][] A) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem934 prob = new Problem934();
    }
}

@@ -269,16 +269,501 @@
 m934();%0A
+        System.out.println(prob.shortestBridge(new int%5B%5D%5B%5D%7B%0A            %7B0, 1%7D,%0A            %7B1, 0%7D%0A        %7D)); // 1%0A        System.out.println(prob.shortestBridge(new int%5B%5D%5B%5D%7B%0A            %7B0, 1, 0%7D,%0A            %7B0, 0, 0%7D,%0A            %7B0, 0, 1%7D%0A        %7D)); // 2%0A        System.out.println(prob.shortestBridge(new int%5B%5D%5B%5D%7B%0A            %7B1, 1, 1, 1, 1%7D,%0A            %7B1, 0, 0, 0, 1%7D,%0A            %7B1, 0, 1, 0, 1%7D,%0A            %7B1, 0, 0, 0, 1%7D,%0A            %7B1, 1, 1, 1, 1%7D%0A        %7D)); // 1%0A
     %7D%0A%7D%0A

Update problem 934