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