Run #2402e846
completedScore
100% (4/4)
Runtime
6μ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 []
return [input[0]] + [b - a for a, b in zip(input, input[1:])]Compare with Champion
Score Difference
Tied
Runtime Advantage
4μs slower
Code Size
5 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 | 4 | result = [input[0]] | |
| 5 | return [input[0]] + [b - a for a, b in zip(input, input[1:])] | 5 | previous = input[0] |
| 6 | 6 | for current in input[1:]: | |
| 7 | 7 | result.append(current - previous) | |
| 8 | 8 | previous = current | |
| 9 | 9 | return result |
Your Solution
100% (4/4)6μs
1def solve(input):2 if not input:3 return []4 5 return [input[0]] + [b - a for a, b in zip(input, input[1:])]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