mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-06 23:28:29 +08:00
修改leetcode-master\problems\kamacoder\0044.开发商购买土地.md Java版本
This commit is contained in:
@ -212,13 +212,14 @@ public class Main {
|
|||||||
int horizontalCut = 0;
|
int horizontalCut = 0;
|
||||||
for (int i = 0; i < n; i++) {
|
for (int i = 0; i < n; i++) {
|
||||||
horizontalCut += horizontal[i];
|
horizontalCut += horizontal[i];
|
||||||
result = Math.min(result, Math.abs(sum - 2 * horizontalCut));
|
result = Math.min(result, Math.abs((sum - horizontalCut) - horizontalCut));
|
||||||
|
// 更新result。其中,horizontalCut表示前i行的和,sum - horizontalCut表示剩下的和,作差、取绝对值,得到题目需要的“A和B各自的子区域内的土地总价值之差”。下同。
|
||||||
}
|
}
|
||||||
|
|
||||||
int verticalCut = 0;
|
int verticalCut = 0;
|
||||||
for (int j = 0; j < m; j++) {
|
for (int j = 0; j < m; j++) {
|
||||||
verticalCut += vertical[j];
|
verticalCut += vertical[j];
|
||||||
result = Math.min(result, Math.abs(sum - 2 * verticalCut));
|
result = Math.min(result, Math.abs((sum - verticalCut) - verticalCut));
|
||||||
}
|
}
|
||||||
|
|
||||||
System.out.println(result);
|
System.out.println(result);
|
||||||
|
Reference in New Issue
Block a user