Run #1aeefd0e
completedScore
100% (4/4)
Runtime
9μs
vs Previous
No change vs parent
Tied for best
Same as parent
Score
100% (4/4)
Runtime
9μs
vs Previous
No change vs parent
Tied for best
Same as parent
from array import array
def solve(input):
if not input:
return []
n = len(input)
result = array('i', [0] * n)
result[0] = input[0]
prev = input[0]
for i in range(1, n):
current = input[i]
result[i] = current - prev
prev = current
return result.tolist()Score Difference
Tied
Runtime Advantage
7μs slower
Code Size
15 vs 9 lines
| # | Your Solution | # | Champion |
|---|---|---|---|
| 1 | from array import array | 1 | def solve(input): |
| 2 | 2 | if not input: | |
| 3 | def solve(input): | 3 | return [] |
| 4 | if not input: | 4 | result = [input[0]] |
| 5 | return [] | 5 | previous = input[0] |
| 6 | 6 | for current in input[1:]: | |
| 7 | n = len(input) | 7 | result.append(current - previous) |
| 8 | result = array('i', [0] * n) | 8 | previous = current |
| 9 | result[0] = input[0] | 9 | return result |
| 10 | prev = input[0] | 10 | |
| 11 | for i in range(1, n): | 11 | |
| 12 | current = input[i] | 12 | |
| 13 | result[i] = current - prev | 13 | |
| 14 | prev = current | 14 | |
| 15 | return result.tolist() | 15 |
1from array import array23def solve(input):4 if not input:5 return []6 7 n = len(input)8 result = array('i', [0] * n)9 result[0] = input[0]10 prev = input[0]11 for i in range(1, n):12 current = input[i]13 result[i] = current - prev14 prev = current15 return result.tolist()1def solve(input):2 if not input:3 return []4 result = [input[0]]5 previous = input[0]6 for current in input[1:]:7 result.append(current - previous)8 previous = current9 return result