Hyplus目录
Java
/**
* <a href="https://leetcode.cn/problems/minimum-money-required-before-transactions/">Minimum Money Required before Transactions</a>
* 贪心;数组;排序
*/
class Solution {
public long minimumMoney(int[][] transactions) {
long totalLose = 0;
int res = 0;
for (int[] t : transactions) {
int cost = t[0];
int cashback = t[1];
totalLose += Math.max(cost - cashback, 0);
res = Math.max(res, Math.min(cost, cashback));
}
return totalLose + res;
}
}
Go
func minimumMoney(transactions [][]int) int64 {
var totalLose int64 = 0
var res int = 0
for _, t := range transactions {
cost, cashback := t[0], t[1]
totalLose += int64(max(cost-cashback, 0))
res = max(res, min(cost, cashback))
}
return totalLose + int64(res)
}
JavaScript
var minimumMoney = function (transactions) {
let totalLose = 0;
let res = 0;
for (let t of transactions) {
const cost = t[0];
const cashback = t[1];
totalLose += Math.max(cost - cashback, 0);
res = Math.max(res, Math.min(cost, cashback));
}
return totalLose + res;
};
PHP
class Solution {
/**
* @param Integer[][] $transactions
* @return Integer
*/
function minimumMoney(array $transactions): int {
$total_lose = 0;
$res = 0;
foreach ($transactions as $t) {
$cost = $t[0];
$cashback = $t[1];
$total_lose += max($cost - $cashback, 0);
$res = max($res, min($cost, $cashback));
}
return $total_lose + $res;
}
}