Skip to content

Commit 46d6674

Browse files
Solutions: 3021, 3516
1 parent 9fd7a8e commit 46d6674

File tree

7 files changed

+63
-0
lines changed

7 files changed

+63
-0
lines changed
Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
/**
2+
* @param {number} n
3+
* @param {number} m
4+
* @return {number}
5+
*/
6+
var flowerGame = function (n, m) {
7+
const [a1, b1] = [(n + 1) >> 1, (m + 1) >> 1];
8+
const [a2, b2] = [n >> 1, m >> 1];
9+
return a1 * b2 + a2 * b1;
10+
};
Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
impl Solution {
2+
pub fn flower_game(n: i32, m: i32) -> i64 {
3+
let a1 = ((n + 1) / 2) as i64;
4+
let b1 = ((m + 1) / 2) as i64;
5+
let a2 = (n / 2) as i64;
6+
let b2 = (m / 2) as i64;
7+
a1 * b2 + a2 * b1
8+
}
9+
}
Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
/**
2+
* @param {number} n
3+
* @param {number} m
4+
* @return {number}
5+
*/
6+
var flowerGame = function (n, m) {
7+
return Number(((BigInt(n) * BigInt(m)) / 2n) | 0n);
8+
};
Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
impl Solution {
2+
pub fn flower_game(n: i32, m: i32) -> i64 {
3+
(n as i64 * m as i64) / 2
4+
}
5+
}
Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
public class Solution {
2+
public int FindClosest(int x, int y, int z) {
3+
int a = Math.Abs(x - z);
4+
int b = Math.Abs(y - z);
5+
return a == b ? 0 : (a < b ? 1 : 2);
6+
}
7+
}
Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
/**
2+
* @param {number} x
3+
* @param {number} y
4+
* @param {number} z
5+
* @return {number}
6+
*/
7+
var findClosest = function (x, y, z) {
8+
const a = Math.abs(x - z);
9+
const b = Math.abs(y - z);
10+
return a === b ? 0 : a < b ? 1 : 2;
11+
};
Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
impl Solution {
2+
pub fn find_closest(x: i32, y: i32, z: i32) -> i32 {
3+
let a = (x - z).abs();
4+
let b = (y - z).abs();
5+
if a == b {
6+
0
7+
} else if a < b {
8+
1
9+
} else {
10+
2
11+
}
12+
}
13+
}

0 commit comments

Comments
 (0)