Run #b85e4a99
completedScore
100% (4/4)
Runtime
10μs
vs Previous
No change vs parent
Tied for best
Same as parent
Solution Lineage
Current100%Same as parent
Code
from array import array
def solve(input):
input_array = array('i', input)
result = array('i', [input_array[0]])
for i in range(1, len(input_array)):
result.append(input_array[i] - input_array[i-1])
return list(result)Compare with Champion
Score Difference
Tied
Runtime Advantage
8μs slower
Code Size
8 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 | input_array = array('i', input) | 4 | result = [input[0]] |
| 5 | result = array('i', [input_array[0]]) | 5 | previous = input[0] |
| 6 | for i in range(1, len(input_array)): | 6 | for current in input[1:]: |
| 7 | result.append(input_array[i] - input_array[i-1]) | 7 | result.append(current - previous) |
| 8 | return list(result) | 8 | previous = current |
| 9 | 9 | return result |
Your Solution
100% (4/4)10μs
1from array import array23def solve(input):4 input_array = array('i', input)5 result = array('i', [input_array[0]])6 for i in range(1, len(input_array)):7 result.append(input_array[i] - input_array[i-1])8 return list(result)Champion
100% (4/4)2μs
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