zoukankan      html  css  js  c++  java
  • 一键三联糖果粉碎723. Candy Crush

    This question is about implementing a basic elimination algorithm for Candy Crush.

    Given an m x n integer array board representing the grid of candy where board[i][j] represents the type of candy. A value of board[i][j] == 0 represents that the cell is empty.

    The given board represents the state of the game following the player's move. Now, you need to restore the board to a stable state by crushing candies according to the following rules:

    • If three or more candies of the same type are adjacent vertically or horizontally, crush them all at the same time - these positions become empty.
    • After crushing all candies simultaneously, if an empty space on the board has candies on top of itself, then these candies will drop until they hit a candy or bottom at the same time. No new candies will drop outside the top boundary.
    • After the above steps, there may exist more candies that can be crushed. If so, you need to repeat the above steps.
    • If there does not exist more candies that can be crushed (i.e., the board is stable), then return the current board.

    You need to perform the above rules until the board becomes stable, then return the stable board.

     

    Example 1:

    Input: board = [[110,5,112,113,114],[210,211,5,213,214],[310,311,3,313,314],[410,411,412,5,414],[5,1,512,3,3],[610,4,1,613,614],[710,1,2,713,714],[810,1,2,1,1],[1,1,2,2,2],[4,1,4,4,1014]]
    Output: [[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[110,0,0,0,114],[210,0,0,0,214],[310,0,0,113,314],[410,0,0,213,414],[610,211,112,313,614],[710,311,412,613,714],[810,411,512,713,1014]]
    

    Example 2:

    Input: board = [[1,3,5,5,2],[3,4,3,3,1],[3,2,4,5,2],[2,4,4,5,5],[1,4,4,1,1]]
    Output: [[1,3,0,0,0],[3,4,0,5,2],[3,2,0,3,1],[2,4,0,5,2],[1,4,3,1,1]]

    果然用了一个boolean变量,起到了while loop的作用
    public int[][] candyCrush(int[][] board) {
      int m = board.length;
      int n = board[0].length;
    
      boolean shouldContinue = false;
    
      // Crush horizontally
      for (int i = 0; i < m; i++) {
        for (int j = 0; j < n - 2; j++) {
          int v = Math.abs(board[i][j]);
          if (v > 0 && v == Math.abs(board[i][j + 1]) && v == Math.abs(board[i][j + 2])) {
            board[i][j] = board[i][j + 1] = board[i][j + 2] = -v;
            shouldContinue = true;
          }
        }
      }
    
      // Crush vertically
      for (int i = 0; i < m - 2; i++) {
        for (int j = 0; j < n; j++) {
          int v = Math.abs(board[i][j]);
          if (v > 0 && v == Math.abs(board[i + 1][j]) && v == Math.abs(board[i + 2][j])) {
            board[i][j] = board[i + 1][j] = board[i + 2][j] = -v;
            shouldContinue = true;
          }
        }
      }
    
      // Drop vertically
      for (int j = 0; j < n; j++) {
        int r = m - 1;
        for (int i = m - 1; i >= 0; i--) {
          if (board[i][j] >= 0) {
            board[r--][j] = board[i][j];
          }
        }
        for (int i = r; i >= 0; i--) {
          board[i][j] = 0;
        }
      }
    
      return shouldContinue ? candyCrush(board) : board;
    }
     
  • 相关阅读:
    【Mocha.js 101】Mocha 入门指南
    CSS 中 Font-Family 中英文对照表
    Android Studio中找出不再使用的资源
    Java反射机制实战——字段篇
    python进阶——day02、03面向对象进阶
    python进阶_day01面对对象编程基础
    day05(文件配置命令和远程登录)
    day04(磁盘管理与目录介绍)
    day03(系统启动及常用的Linux命令的基本使用)
    day02(操作系统简介和Linux的安装与常用命令简介)
  • 原文地址:https://www.cnblogs.com/immiao0319/p/15565411.html
Copyright © 2011-2022 走看看