deploy: d3e53ba

Author: yanglbme

en/lc/3235/index.html

@@ -77937,17 +77937,17 @@ <h1 id="3235-check-if-the-rectangle-corner-is-reachable"><a href="https://leetco
 <h2 id="description">Description</h2>
 <!-- description:start -->
 
-<p>You are given two positive integers <code>X</code> and <code>Y</code>, and a 2D array <code>circles</code>, where <code>circles[i] = [x<sub>i</sub>, y<sub>i</sub>, r<sub>i</sub>]</code> denotes a circle with center at <code>(x<sub>i</sub>, y<sub>i</sub>)</code> and radius <code>r<sub>i</sub></code>.</p>
+<p>You are given two positive integers <code>xCorner</code> and <code>yCorner</code>, and a 2D array <code>circles</code>, where <code>circles[i] = [x<sub>i</sub>, y<sub>i</sub>, r<sub>i</sub>]</code> denotes a circle with center at <code>(x<sub>i</sub>, y<sub>i</sub>)</code> and radius <code>r<sub>i</sub></code>.</p>
 
-<p>There is a rectangle in the coordinate plane with its bottom left corner at the origin and top right corner at the coordinate <code>(X, Y)</code>. You need to check whether there is a path from the bottom left corner to the top right corner such that the <strong>entire path</strong> lies inside the rectangle, <strong>does not</strong> touch or lie inside <strong>any</strong> circle, and touches the rectangle <strong>only</strong> at the two corners.</p>
+<p>There is a rectangle in the coordinate plane with its bottom left corner at the origin and top right corner at the coordinate <code>(xCorner, yCorner)</code>. You need to check whether there is a path from the bottom left corner to the top right corner such that the <strong>entire path</strong> lies inside the rectangle, <strong>does not</strong> touch or lie inside <strong>any</strong> circle, and touches the rectangle <strong>only</strong> at the two corners.</p>
 
 <p>Return <code>true</code> if such a path exists, and <code>false</code> otherwise.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
 <div class="example-block">
-<p><strong>Input:</strong> <span class="example-io">X = 3, Y = 4, circles = [[2,1,1]]</span></p>
+<p><strong>Input:</strong> <span class="example-io">xCorner = 3, yCorner = 4, circles = [[2,1,1]]</span></p>
 
 <p><strong>Output:</strong> <span class="example-io">true</span></p>
 
@@ -77961,7 +77961,7 @@ <h2 id="description">Description</h2>
 <p><strong class="example">Example 2:</strong></p>
 
 <div class="example-block">
-<p><strong>Input:</strong> <span class="example-io">X = 3, Y = 3, circles = [[1,1,2]]</span></p>
+<p><strong>Input:</strong> <span class="example-io">xCorner = 3, yCorner = 3, circles = [[1,1,2]]</span></p>
 
 <p><strong>Output:</strong> <span class="example-io">false</span></p>
 
@@ -77975,7 +77975,7 @@ <h2 id="description">Description</h2>
 <p><strong class="example">Example 3:</strong></p>
 
 <div class="example-block">
-<p><strong>Input:</strong> <span class="example-io">X = 3, Y = 3, circles = [[2,1,1],[1,2,1]]</span></p>
+<p><strong>Input:</strong> <span class="example-io">xCorner = 3, yCorner = 3, circles = [[2,1,1],[1,2,1]]</span></p>
 
 <p><strong>Output:</strong> <span class="example-io">false</span></p>
 
@@ -77989,7 +77989,7 @@ <h2 id="description">Description</h2>
 <p><strong class="example">Example 4:</strong></p>
 
 <div class="example-block">
-<p><strong>Input:</strong> <span class="example-io">X = 4, Y = 4, circles = [[5,5,1]]</span></p>
+<p><strong>Input:</strong> <span class="example-io">xCorner = 4, yCorner = 4, circles = [[5,5,1]]</span></p>
 
 <p><strong>Output:</strong> <span class="example-io">true</span></p>
 
@@ -78002,7 +78002,7 @@ <h2 id="description">Description</h2>
 <p><strong>Constraints:</strong></p>
 
 <ul>
-    <li><code>3 &lt;= X, Y &lt;= 10<sup>9</sup></code></li>
+    <li><code>3 &lt;= xCorner, yCorner &lt;= 10<sup>9</sup></code></li>
     <li><code>1 &lt;= circles.length &lt;= 1000</code></li>
     <li><code>circles[i].length == 3</code></li>
     <li><code>1 &lt;= x<sub>i</sub>, y<sub>i</sub>, r<sub>i</sub> &lt;= 10<sup>9</sup></code></li>

en/lc/3242/index.html

@@ -77933,10 +77933,10 @@ <h2 id="description">Description</h2>
 
 <p>You are given a <code>n x n</code> 2D array <code>grid</code> containing <strong>distinct</strong> elements in the range <code>[0, n<sup>2</sup> - 1]</code>.</p>
 
-<p>Implement the <code>neighborSum</code> class:</p>
+<p>Implement the <code>NeighborSum</code> class:</p>
 
 <ul>
-    <li><code>neighborSum(int [][]grid)</code> initializes the object.</li>
+    <li><code>NeighborSum(int [][]grid)</code> initializes the object.</li>
     <li><code>int adjacentSum(int value)</code> returns the <strong>sum</strong> of elements which are adjacent neighbors of <code>value</code>, that is either to the top, left, right, or bottom of <code>value</code> in <code>grid</code>.</li>
     <li><code>int diagonalSum(int value)</code> returns the <strong>sum</strong> of elements which are diagonal neighbors of <code>value</code>, that is either to the top-left, top-right, bottom-left, or bottom-right of <code>value</code> in <code>grid</code>.</li>
 </ul>
@@ -77949,7 +77949,7 @@ <h2 id="description">Description</h2>
 <div class="example-block">
 <p><strong>Input:</strong></p>
 
-<p>[&quot;neighborSum&quot;, &quot;adjacentSum&quot;, &quot;adjacentSum&quot;, &quot;diagonalSum&quot;, &quot;diagonalSum&quot;]</p>
+<p>[&quot;NeighborSum&quot;, &quot;adjacentSum&quot;, &quot;adjacentSum&quot;, &quot;diagonalSum&quot;, &quot;diagonalSum&quot;]</p>
 
 <p>[[[[0, 1, 2], [3, 4, 5], [6, 7, 8]]], [1], [4], [4], [8]]</p>
 
@@ -77972,7 +77972,7 @@ <h2 id="description">Description</h2>
 <div class="example-block">
 <p><strong>Input:</strong></p>
 
-<p>[&quot;neighborSum&quot;, &quot;adjacentSum&quot;, &quot;diagonalSum&quot;]</p>
+<p>[&quot;NeighborSum&quot;, &quot;adjacentSum&quot;, &quot;diagonalSum&quot;]</p>
 
 <p>[[[[1, 2, 0, 3], [4, 7, 15, 6], [8, 9, 10, 11], [12, 13, 14, 5]]], [15], [9]]</p>