From 540986c4058f9c3185a3bf3c4ed81949471cfe7e Mon Sep 17 00:00:00 2001
From: camiloibarrayepes <camilo.ibarray@gmail.com>
Date: 2021年10月11日 21:43:16 -0500
Subject: [PATCH 1/2] Rotting Orange Algorithm
#765
An Amazon coding interview question: Rotting orange in Javascript Language
---
 Sorts/rottingOranges.js &#124; 48 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 48 insertions(+)
 create mode 100644 Sorts/rottingOranges.js
diff --git a/Sorts/rottingOranges.js b/Sorts/rottingOranges.js
new file mode 100644
index 0000000000..8f727cf9dc
--- /dev/null
+++ b/Sorts/rottingOranges.js
@@ -0,0 +1,48 @@
+//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 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; +}; \ No newline at end of file From 92e5b87d5dc79a0082e3abf9b24df19f595ea3f1 Mon Sep 17 00:00:00 2001 From: camiloibarrayepes <camilo.ibarray@gmail.com>
Date: 2021年10月11日 21:47:15 -0500
Subject: [PATCH 2/2] Update script
---
 Sorts/rottingOranges.js &#124; 3 +++
 1 file changed, 3 insertions(+)
diff --git a/Sorts/rottingOranges.js b/Sorts/rottingOranges.js
index 8f727cf9dc..2bab9c423d 100644
--- a/Sorts/rottingOranges.js
+++ b/Sorts/rottingOranges.js
@@ -9,6 +9,9 @@ Every minute, any fresh orange that is 4-directionally adjacent to a rotten oran
 
 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];
+var dy = [0,-1,0,+1];
 var orangesRotting = function(grid) {
 var X = grid[0].length;
 var Y = grid.length;
</div><div class="naked_ctrl">
<form action="/index.cgi/contrast" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://patch-diff.githubusercontent.com/raw/TheAlgorithms/JavaScript/pull/778.patch">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://patch-diff.githubusercontent.com/raw/TheAlgorithms/JavaScript/pull/778.patch" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast" selected="selected">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>