(processes, m)
| 1 | # Approach 1: |
| 2 | |
| 3 | def minimizeMemory(processes, m): |
| 4 | n=len(processes) |
| 5 | if(n < m): |
| 6 | return -1 |
| 7 | res = 0 |
| 8 | for i in range(m): |
| 9 | res +=processes[i] |
| 10 | curr_sum = res |
| 11 | for i in range(m,n): |
| 12 | curr_sum +=processes[i] - processes[i-m] |
| 13 | res = max(res,curr_sum) |
| 14 | return sum(processes)-res |
| 15 | |
| 16 | |
| 17 | # This is complete logic of a Program |
nothing calls this directly
no outgoing calls
no test coverage detected