Queen's Attack II Discussions | Algorithms | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Queen's Attack II
  5. Discussions

Queen's Attack II

  • ultrinfaern
     + 0 comments

    Hint 1- Just check all obstacles that they are on one of four lines. Then you will have at maximun eight obstacles. Hint 2 - then just calculate distance to obstacle or edge of the board.

    public static boolean isPointOnLines(int xc, int yc, int xt, int yt) {
    if (yt == yc && xt != xc) {
        return true;
    }
    if (xt == xc && yt != yc) {
        return true;
    }
    if ((xt - xc) == (yt - yc)) {
        return true;
    }
    if ((xt - xc) == (yc - yt)) {
        return true;
    }
    return false;
}