feat: add solutions to lc problems: No.3021,3516

solution/3000-3099/3021.Alice and Bob Playing Flower Game/README.md

@@ -151,6 +151,35 @@ function flowerGame(n: number, m: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn flower_game(n: i32, m: i32) -> i64 {
+        let a1 = ((n + 1) / 2) as i64;
+        let b1 = ((m + 1) / 2) as i64;
+        let a2 = (n / 2) as i64;
+        let b2 = (m / 2) as i64;
+        a1 * b2 + a2 * b1
+    }
+}
+```
+
+#### JavaScript
+
+```js
+/**
+ * @param {number} n
+ * @param {number} m
+ * @return {number}
+ */
+var flowerGame = function (n, m) {
+    const [a1, b1] = [(n + 1) >> 1, (m + 1) >> 1];
+    const [a2, b2] = [n >> 1, m >> 1];
+    return a1 * b2 + a2 * b1;
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
@@ -220,6 +249,29 @@ function flowerGame(n: number, m: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn flower_game(n: i32, m: i32) -> i64 {
+        (n as i64 * m as i64) / 2
+    }
+}
+```
+
+#### JavaScript
+
+```js
+/**
+ * @param {number} n
+ * @param {number} m
+ * @return {number}
+ */
+var flowerGame = function (n, m) {
+    return Number(((BigInt(n) * BigInt(m)) / 2n) | 0n);
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3000-3099/3021.Alice and Bob Playing Flower Game/README_EN.md

@@ -149,6 +149,35 @@ function flowerGame(n: number, m: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn flower_game(n: i32, m: i32) -> i64 {
+        let a1 = ((n + 1) / 2) as i64;
+        let b1 = ((m + 1) / 2) as i64;
+        let a2 = (n / 2) as i64;
+        let b2 = (m / 2) as i64;
+        a1 * b2 + a2 * b1
+    }
+}
+```
+
+#### JavaScript
+
+```js
+/**
+ * @param {number} n
+ * @param {number} m
+ * @return {number}
+ */
+var flowerGame = function (n, m) {
+    const [a1, b1] = [(n + 1) >> 1, (m + 1) >> 1];
+    const [a2, b2] = [n >> 1, m >> 1];
+    return a1 * b2 + a2 * b1;
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
@@ -218,6 +247,29 @@ function flowerGame(n: number, m: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn flower_game(n: i32, m: i32) -> i64 {
+        (n as i64 * m as i64) / 2
+    }
+}
+```
+
+#### JavaScript
+
+```js
+/**
+ * @param {number} n
+ * @param {number} m
+ * @return {number}
+ */
+var flowerGame = function (n, m) {
+    return Number(((BigInt(n) * BigInt(m)) / 2n) | 0n);
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3000-3099/3021.Alice and Bob Playing Flower Game/Solution.js

@@ -0,0 +1,10 @@
+/**
+ * @param {number} n
+ * @param {number} m
+ * @return {number}
+ */
+var flowerGame = function (n, m) {
+    const [a1, b1] = [(n + 1) >> 1, (m + 1) >> 1];
+    const [a2, b2] = [n >> 1, m >> 1];
+    return a1 * b2 + a2 * b1;
+};

solution/3000-3099/3021.Alice and Bob Playing Flower Game/Solution.rs

@@ -0,0 +1,9 @@
+impl Solution {
+    pub fn flower_game(n: i32, m: i32) -> i64 {
+        let a1 = ((n + 1) / 2) as i64;
+        let b1 = ((m + 1) / 2) as i64;
+        let a2 = (n / 2) as i64;
+        let b2 = (m / 2) as i64;
+        a1 * b2 + a2 * b1
+    }
+}

solution/3000-3099/3021.Alice and Bob Playing Flower Game/Solution2.js

@@ -0,0 +1,8 @@
+/**
+ * @param {number} n
+ * @param {number} m
+ * @return {number}
+ */
+var flowerGame = function (n, m) {
+    return Number(((BigInt(n) * BigInt(m)) / 2n) | 0n);
+};

solution/3000-3099/3021.Alice and Bob Playing Flower Game/Solution2.rs

@@ -0,0 +1,5 @@
+impl Solution {
+    pub fn flower_game(n: i32, m: i32) -> i64 {
+        (n as i64 * m as i64) / 2
+    }
+}

solution/3500-3599/3516.Find Closest Person/README.md

@@ -184,6 +184,52 @@ function findClosest(x: number, y: number, z: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn find_closest(x: i32, y: i32, z: i32) -> i32 {
+        let a = (x - z).abs();
+        let b = (y - z).abs();
+        if a == b {
+            0
+        } else if a < b {
+            1
+        } else {
+            2
+        }
+    }
+}
+```
+
+#### JavaScript
+
+```js
+/**
+ * @param {number} x
+ * @param {number} y
+ * @param {number} z
+ * @return {number}
+ */
+var findClosest = function (x, y, z) {
+    const a = Math.abs(x - z);
+    const b = Math.abs(y - z);
+    return a === b ? 0 : a < b ? 1 : 2;
+};
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public int FindClosest(int x, int y, int z) {
+        int a = Math.Abs(x - z);
+        int b = Math.Abs(y - z);
+        return a == b ? 0 : (a < b ? 1 : 2);
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3500-3599/3516.Find Closest Person/README_EN.md

@@ -182,6 +182,52 @@ function findClosest(x: number, y: number, z: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn find_closest(x: i32, y: i32, z: i32) -> i32 {
+        let a = (x - z).abs();
+        let b = (y - z).abs();
+        if a == b {
+            0
+        } else if a < b {
+            1
+        } else {
+            2
+        }
+    }
+}
+```
+
+#### JavaScript
+
+```js
+/**
+ * @param {number} x
+ * @param {number} y
+ * @param {number} z
+ * @return {number}
+ */
+var findClosest = function (x, y, z) {
+    const a = Math.abs(x - z);
+    const b = Math.abs(y - z);
+    return a === b ? 0 : a < b ? 1 : 2;
+};
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public int FindClosest(int x, int y, int z) {
+        int a = Math.Abs(x - z);
+        int b = Math.Abs(y - z);
+        return a == b ? 0 : (a < b ? 1 : 2);
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3500-3599/3516.Find Closest Person/Solution.cs

@@ -0,0 +1,7 @@
+public class Solution {
+    public int FindClosest(int x, int y, int z) {
+        int a = Math.Abs(x - z);
+        int b = Math.Abs(y - z);
+        return a == b ? 0 : (a < b ? 1 : 2);
+    }
+}

solution/3500-3599/3516.Find Closest Person/Solution.js

@@ -0,0 +1,11 @@
+/**
+ * @param {number} x
+ * @param {number} y
+ * @param {number} z
+ * @return {number}
+ */
+var findClosest = function (x, y, z) {
+    const a = Math.abs(x - z);
+    const b = Math.abs(y - z);
+    return a === b ? 0 : a < b ? 1 : 2;
+};

solution/3500-3599/3516.Find Closest Person/Solution.rs

@@ -0,0 +1,13 @@
+impl Solution {
+    pub fn find_closest(x: i32, y: i32, z: i32) -> i32 {
+        let a = (x - z).abs();
+        let b = (y - z).abs();
+        if a == b {
+            0
+        } else if a < b {
+            1
+        } else {
+            2
+        }
+    }
+}