Run #a7c4355f
completedScore
100% (4/4)
Runtime
4μs
vs Previous
No change vs parent
Tied for best
Same as parent
Solution Lineage
Current100%Same as parent
Code
def solve(input):
deltas = [input[0]]
append_delta = deltas.append
last = input[0]
for current in input[1:]:
append_delta(current - last)
last = current
return deltasCompare with Champion
Score Difference
Tied
Runtime Advantage
2μs slower
Code Size
8 vs 9 lines
| # | Your Solution | # | Champion |
|---|---|---|---|
| 1 | def solve(input): | 1 | def solve(input): |
| 2 | deltas = [input[0]] | 2 | if not input: |
| 3 | append_delta = deltas.append | 3 | return [] |
| 4 | last = input[0] | 4 | result = [input[0]] |
| 5 | for current in input[1:]: | 5 | previous = input[0] |
| 6 | append_delta(current - last) | 6 | for current in input[1:]: |
| 7 | last = current | 7 | result.append(current - previous) |
| 8 | return deltas | 8 | previous = current |
| 9 | 9 | return result |
Your Solution
100% (4/4)4μs
1def solve(input):2 deltas = [input[0]]3 append_delta = deltas.append4 last = input[0]5 for current in input[1:]:6 append_delta(current - last)7 last = current8 return deltasChampion
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