Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Rotting Orange Algorithm #778

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
camiloibarrayepes wants to merge 2 commits into TheAlgorithms:master from camiloibarrayepes:newChallengeAlgorithm
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
51 changes: 51 additions & 0 deletions Sorts/rottingOranges.js
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,51 @@
//https://leetcode.com/problems/rotting-oranges/

/* You are given an m x n grid where each cell can have one of three values:

0 representing an empty cell,
1 representing a fresh orange, or
2 representing a rotten orange.
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.

Return the minimum number of minutes that must elapse until no cell has a fresh orange. If this is impossible, return -1. */


var dx = [-1,0,+1,0];
Copy link
Member

@raklaptudirm raklaptudirm Oct 16, 2021

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Put everything into a function.

var dy = [0,-1,0,+1];
var orangesRotting = function(grid) {
var X = grid[0].length;
var Y = grid.length;
var queue=[];
var map={};
var rotten;
var ans = 0;
for(var x = 0; x < X; x++){
for(var y = 0; y < Y; y++){
if(grid[y][x] == 2){
queue.push(y*X+x);
map[y*X+x]=0;
}
}
}
while((rotten = queue.shift())!=undefined){
var x = rotten % X;
var y = Math.floor(rotten / X);
for(var i = 0; i < 4; i++){
var mx = x+dx[i];
var my = y+dy[i];
if(mx >= 0 && mx < X && my >= 0 && my <Y && grid[my][mx] == 1){
grid[my][mx] = 2;
queue.push((mx)+(my)*X);
map[(mx)+(my)*X] = map[x+y*X]+1;
ans = map[mx+my*X];
}
}
}
for(var x = 0; x < X; x++){
for(var y = 0; y < Y; y++){
if(grid[y][x] == 1)
return -1;
}
}
return ans;
};
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

⛔ is GitHub saying that it expects all files to end with one and only one carriage return (\n).

AltStyle によって変換されたページ (->オリジナル) /