-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patharrayManipulation_fast.py
61 lines (44 loc) · 1.42 KB
/
arrayManipulation_fast.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
# https://www.hackerrank.com/challenges/crush/forum?h_l=interview&playlist_slugs%5B%5D=interview-preparation-kit&playlist_slugs%5B%5D=arrays
class Solution_fast:
def arrayManipulation(self, n, queries):
array = [0] * (n + 1)
for query in queries:
a = query[0] - 1
b = query[1]
k = query[2]
array[a] += k
array[b] -= k
max_value = 0
running_count = 0
for i in array:
running_count += i
if running_count > max_value:
max_value = running_count
return max_value
#!/bin/python3
import math
import os
import random
import re
import sys
from collections import defaultdict
# Complete the arrayManipulation function below.
# KEEP GETTING RUNTIME ERROR on test cases 7 to 13
def arrayManipulation(n, queries):
mapping = {i: 0 for i in range(1, n+1)}
for q in queries:
for one_index in range(q[0], q[1]+1):
mapping[one_index] += q[2]
return max(mapping.values())
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
nm = input().split()
n = int(nm[0])
m = int(nm[1])
queries = []
for _ in range(m):
queries.append(list(map(int, input().rstrip().split())))
s = Solution_fast
result = s.arrayManipulation(n, queries)
fptr.write(str(result) + '\n')
fptr.close()