golang 解法, 执行用时: 0 ms, 内存消耗: 2.2 MB, 提交时间: 2024-10-15 09:14:19

func maxHeightOfTriangle(red int, blue int) int {
    cnt := [2]int{0, 0}  // 分别记录偶数行和奇数行分别放了多少个球
    i := 1
    for {
        cnt[i%2] += i
        if (cnt[0] > red || cnt[1] > blue) && (cnt[0] > blue || cnt[1] > red) {
            return i - 1
        }
        i++
    }
}

python3 解法, 执行用时: 39 ms, 内存消耗: 16.3 MB, 提交时间: 2024-10-15 09:10:58

# 枚举
class Solution:
    def maxHeightOfTriangle(self, red: int, blue: int) -> int:
        cnt = [0, 0]  # 分别记录偶数行和奇数行分别放了多少个球
        for i in count(1):
            cnt[i % 2] += i
            if (cnt[0] > red or cnt[1] > blue) and (cnt[0] > blue or cnt[1] > red):
                return i - 1

java 解法, 执行用时: 0 ms, 内存消耗: 39.9 MB, 提交时间: 2024-07-01 09:13:04

class Solution {
    public int maxHeightOfTriangle(int red, int blue) {
        return Math.max(f(red, blue), f(blue, red));
    }

    private int f(int n, int m) {
        int odd = (int) Math.sqrt(n);
        int even = (int) ((Math.sqrt(m * 4 + 1) - 1) / 2);
        return odd > even ? even * 2 + 1 : odd * 2;
    }
}

cpp 解法, 执行用时: 0 ms, 内存消耗: 7.3 MB, 提交时间: 2024-07-01 09:12:51

class Solution {
    int f(int n, int m) {
        int odd = sqrt(n);
        int even = (sqrt(m * 4 + 1) - 1) / 2;
        return odd > even ? even * 2 + 1 : odd * 2;
    }

public:
    int maxHeightOfTriangle(int red, int blue) {
        return max(f(red, blue), f(blue, red));
    }
};

golang 解法, 执行用时: 0 ms, 内存消耗: 2.3 MB, 提交时间: 2024-07-01 09:12:30

func f(n, m int) int {
	odd := int(math.Sqrt(float64(n)))
	even := int((math.Sqrt(float64(m*4+1)) - 1) / 2)
	if odd > even {
		return even*2 + 1
	}
	return odd * 2
}

func maxHeightOfTriangle(red, blue int) int {
	return max(f(red, blue), f(blue, red))
}

python3 解法, 执行用时: 45 ms, 内存消耗: 16.3 MB, 提交时间: 2024-07-01 09:12:17

class Solution:
    '''
    奇数行放红球，偶数行放蓝球；或者奇数行放蓝球，偶数行放红球。
    计算最多能放多少排。两种情况取最大值。
    '''
    def maxHeightOfTriangle(self, red: int, blue: int) -> int:
        def f(n: int, m: int) -> int:
            odd = isqrt(n)
            even = int((sqrt(m * 4 + 1) - 1) / 2)
            return even * 2 + 1 if odd > even else odd * 2
        return max(f(red, blue), f(blue, red))