363. 矩形区域不超过K的最大数值和

• 题号：363
• 来源：LeetCode
• 难度：困难
• 标签：模拟
• 语言：TypeScript
• 解法：1 个
• 作者：lmliheng
• 最近更新：2026-09-27

TypeScript · O(n) 时间 · O(n) 空间 · 更新于 2026-09-27

文件内容是完成时间模拟，与题名不符

/**
 * @difficulty hard
 * @tags 模拟
 * @time O(n)
 * @space O(n)
 * @note 文件内容是完成时间模拟，与题名不符
 * @363. 矩形区域不超过K的最大数值和
 */
let landStartTime = [2, 8]
let landDuration = [4, 1]
let waterStartTime = [6,7]
let waterDuration = [3,3]

let landStartTimeCopy = [...landStartTime]
let waterStartTimeCopy = [...waterStartTime]
// 从陆地
let landCompleteTime = Math.min(...landStartTime.map((item, index) => {
    return item + landDuration[index]
}))
for (let i = 0; i < waterStartTimeCopy.length; i++) {
    if (waterStartTimeCopy[i] < landCompleteTime) {
        waterStartTimeCopy[i] = landCompleteTime
    }
}

console.log("landCompleteTime:", landCompleteTime)
console.log(waterStartTimeCopy)


// 从水上
let waterCompleteTime = Math.min(...waterStartTime.map((item, index) => {
    return item + waterDuration[index]
}))

console.log("waterCompleteTime:", waterCompleteTime)
for (let i = 0; i < landStartTimeCopy.length; i++) {
    if (landStartTimeCopy[i] < waterCompleteTime) {
        landStartTimeCopy[i] = waterCompleteTime
    }
}

console.log(landStartTimeCopy)

let res1 = Math.min(...waterStartTimeCopy.map((item, index) => item + waterDuration[index]))
let res2 = Math.min(...landStartTimeCopy.map((item, index) => item + landDuration[index]))
console.log("res1:", res1)
console.log("res2:", res2)

源码：ts/leetcode/363. 矩形区域不超过K的最大数值和.ts

---

在 GitHub 上查看题目所在目录：lmliheng/algorithm