mirror of
				https://github.com/krahets/hello-algo.git
				synced 2025-10-31 10:26:48 +08:00 
			
		
		
		
	 1c0f350ad6
			
		
	
	1c0f350ad6
	
	
	
		
			
			* Add the intial translation of code of all the languages * test * revert * Remove * Add Python and Java code for EN version
		
			
				
	
	
		
			34 lines
		
	
	
		
			788 B
		
	
	
	
		
			Python
		
	
	
	
	
	
			
		
		
	
	
			34 lines
		
	
	
		
			788 B
		
	
	
	
		
			Python
		
	
	
	
	
	
| """
 | |
| File: max_capacity.py
 | |
| Created Time: 2023-07-21
 | |
| Author: krahets (krahets@163.com)
 | |
| """
 | |
| 
 | |
| 
 | |
| def max_capacity(ht: list[int]) -> int:
 | |
|     """Maximum capacity: Greedy"""
 | |
|     # Initialize i, j, making them split the array at both ends
 | |
|     i, j = 0, len(ht) - 1
 | |
|     # Initial maximum capacity is 0
 | |
|     res = 0
 | |
|     # Loop for greedy selection until the two boards meet
 | |
|     while i < j:
 | |
|         # Update maximum capacity
 | |
|         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
 | |
| 
 | |
| 
 | |
| """Driver Code"""
 | |
| if __name__ == "__main__":
 | |
|     ht = [3, 8, 5, 2, 7, 7, 3, 4]
 | |
| 
 | |
|     # Greedy algorithm
 | |
|     res = max_capacity(ht)
 | |
|     print(f"Maximum capacity is {res}")
 |