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