Run #77793cd4
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):
if not input:
return []
result = [input[0]]
append_result = result.append
last = input[0]
for number in input[1:]:
diff = number - last
append_result(diff)
last = number
return resultCompare with Champion
Score Difference
Tied
Runtime Advantage
2μs slower
Code Size
14 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 | result = [input[0]] | 5 | previous = input[0] |
| 6 | append_result = result.append | 6 | for current in input[1:]: |
| 7 | last = input[0] | 7 | result.append(current - previous) |
| 8 | 8 | previous = current | |
| 9 | for number in input[1:]: | 9 | return result |
| 10 | diff = number - last | 10 | |
| 11 | append_result(diff) | 11 | |
| 12 | last = number | 12 | |
| 13 | 13 | ||
| 14 | return result | 14 |
Your Solution
100% (4/4)4μs
1def solve(input):2 if not input:3 return []45 result = [input[0]]6 append_result = result.append7 last = input[0]8 9 for number in input[1:]:10 diff = number - last11 append_result(diff)12 last = number1314 return resultChampion
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