LeetCode 723. Candy Crush
原题链接在这里:https://leetcode.com/problems/candy-crush/
题目:
This question is about implementing a basic elimination algorithm for Candy Crush.
Given a 2D integer array board
representing the grid of candy, different positive integers board[i][j]
represent different types of candies. A value of board[i][j] = 0
represents that the cell at position (i, j)
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 (ie. the board is stable), then return the current board.
You need to perform the above rules until the board becomes stable, then return the current board.
Example:
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]] Explanation:
Note:
- The length of
board
will be in the range [3, 50]. - The length of
board[i]
will be in the range [3, 50]. - Each
board[i][j]
will initially start as an integer in the range [1, 2000].
题解:
There are two steps.
Step 1: Mark 3 adjacent candies. Check if there are 3 adjacent candies. First check row by row, then column by column.
If there are, mark these values as negative.
Step 2: Crush them. Rewrite board with only positive numbers.
If there is crushing, that means there may be another round of crash, use recursion. Otherwise, there wouldn't be another round of crash, return the board.
Time Comlexity: O(M^2*n^2). m = board.length. n = board[0].length.
Each crash, there would be 3 crashed at minimum. Totally there are m*n candies. So recursion could run for m*n/3 times.
Each recursion, it takes O(m*n).
Space: O(1).
AC Java:
class Solution {
public int[][] candyCrush(int[][] board) {
if(board == null || board.length == 0 | board[0].length == 0){
return board;
} boolean todo = false;
int m = board.length;
int n = board[0].length;
for(int i = 0; i<m; i++){
for(int j = 0; j<n-2; j++){
int val = Math.abs(board[i][j]);
if(val!=0 && val==Math.abs(board[i][j+1]) && val==Math.abs(board[i][j+2])){
todo = true;
board[i][j] = board[i][j+1] = board[i][j+2] = -val;
}
}
} for(int j = 0; j<n; j++){
for(int i = 0; i<m-2; i++){
int val = Math.abs(board[i][j]);
if(val!=0 && val==Math.abs(board[i+1][j]) && val==Math.abs(board[i+2][j])){
todo = true;
board[i][j] = board[i+1][j] = board[i+2][j] = -val;
}
}
} for(int j = 0; j<n; j++){
int br = m-1;
for(int i = m-1; i>=0; i--){
if(board[i][j] > 0){
board[br--][j] = board[i][j];
}
} while(br>=0){
board[br--][j] = 0;
}
} return todo ? candyCrush(board) : board;
}
}
最新文章
- centos添加和删除用户及 xxx is not in the sudoers file.This incident will be reported.的解决方法
- 跟vczh看实例学编译原理——一:Tinymoe的设计哲学
- a版本冲刺第九天
- 剪短的python数据结构和算法的书《Data Structures and Algorithms Using Python》
- android service两种启动方式
- Java程序员的日常—— POI与JDBC、Mockmvc与单元测试
- SkipList 跳表
- 汽车行业的DMS系统 IT不变应万变
- 关于XMLEncoder和XMLDecoder
- SQl 判断 表 视图 临时表等 是否存在
- IOS基金会_ UICollectionView简单易用
- Ajax实现在textbox中输入内容,动态从数据库中模糊查询显示到下拉框中
- .net导出不规则Excel
- 深度理解div+css布局嵌套盒子
- HTTP库Axios
- HDU2289-Cup-二分
- 一个关于C8051F350模拟电源的小问题
- REM——适合移动开发的自适应方案
- 【转】对random_state参数的理解
- JSTLView快速国际化(SpringMVC)