39 lines
907 B
Swift
39 lines
907 B
Swift
/**
|
|
* File: max_capacity.swift
|
|
* Created Time: 2023-09-03
|
|
* Author: nuomi1 (nuomi1@qq.com)
|
|
*/
|
|
|
|
/* Maximum capacity: Greedy */
|
|
func maxCapacity(ht: [Int]) -> Int {
|
|
// Initialize i, j, making them split the array at both ends
|
|
var i = ht.startIndex, j = ht.endIndex - 1
|
|
// Initial maximum capacity is 0
|
|
var res = 0
|
|
// Loop for greedy selection until the two boards meet
|
|
while i < j {
|
|
// Update maximum capacity
|
|
let cap = min(ht[i], ht[j]) * (j - i)
|
|
res = max(res, cap)
|
|
// Move the shorter board inward
|
|
if ht[i] < ht[j] {
|
|
i += 1
|
|
} else {
|
|
j -= 1
|
|
}
|
|
}
|
|
return res
|
|
}
|
|
|
|
@main
|
|
enum MaxCapacity {
|
|
/* Driver Code */
|
|
static func main() {
|
|
let ht = [3, 8, 5, 2, 7, 7, 3, 4]
|
|
|
|
// Greedy algorithm
|
|
let res = maxCapacity(ht: ht)
|
|
print("Maximum capacity = \(res)")
|
|
}
|
|
}
|