Run #d1333f67
completedScore
100% (4/4)
Runtime
5μs
vs Previous
No change vs parent
Tied for best
Same as parent
Solution Lineage
Current100%Same as parent
Code
def solve(input):
return [input[0]] + [input[i] - input[i - 1] for i in range(1, len(input))]Compare with Champion
Score Difference
Tied
Runtime Advantage
3μs slower
Code Size
2 vs 9 lines
| # | Your Solution | # | Champion |
|---|---|---|---|
| 1 | def solve(input): | 1 | def solve(input): |
| 2 | return [input[0]] + [input[i] - input[i - 1] for i in range(1, len(input))] | 2 | if not input: |
| 3 | 3 | return [] | |
| 4 | 4 | result = [input[0]] | |
| 5 | 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)5μs
1def solve(input):2 return [input[0]] + [input[i] - input[i - 1] for i in range(1, len(input))]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