Tag Archives: BFS

  1. Number of Distinct Islands

    Leave a comment

    October 8, 2017 by oneOokay

    问题在于如何存/translate an island so you can distinct them from each other. 我的代码跑过了所有700+个test case但是就是最后两个跑不过,而且test case太大不可能debug.最终拿了别人的pass的代码一个一个比较output才明白为什么我卡在最后两个test case了… 我的: main method里面 boolean[][] visited和String …
    Continue reading

  2. Walls and Gates

    Leave a comment

    September 21, 2017 by oneOokay

    You are given a m x n 2D grid initialized with these three possible values. -1 – A wall or an obstacle. 0 – …
    Continue reading

  3. 01 Matrix

    Leave a comment

    June 20, 2017 by oneOokay

    Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell. The distance …
    Continue reading

  4. Course Schedule I II

    Leave a comment

    December 19, 2016 by oneOokay

    There are a total of n courses you have to take, labeled from 0 to n – 1. Some courses …
    Continue reading

  5. Topological Sorting Related

    Leave a comment

    December 18, 2016 by oneOokay

    拓扑排序以及相关题目: 拓扑排序 For each directed edge A -> B in graph, A must before B in the order list. The …
    Continue reading

  6. Graph Valid Tree

    Leave a comment

    November 30, 2016 by oneOokay

    Given n nodes labeled from 0 to n – 1 and a list of undirected edges (each edge is a …
    Continue reading

  7. Binary Tree Right Side View

    Leave a comment

    November 22, 2016 by oneOokay

    Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you …
    Continue reading