Run #847619c7
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):
out = input[:1]
append = out.append
append = append
last = input[0] if out else 0
for current in input[1:]:
diff = current - last
append(diff)
last = current
return outCompare with Champion
Score Difference
Tied
Runtime Advantage
2μs slower
Code Size
10 vs 9 lines
| # | Your Solution | # | Champion |
|---|---|---|---|
| 1 | def solve(input): | 1 | def solve(input): |
| 2 | out = input[:1] | 2 | if not input: |
| 3 | append = out.append | 3 | return [] |
| 4 | append = append | 4 | result = [input[0]] |
| 5 | last = input[0] if out else 0 | 5 | previous = input[0] |
| 6 | for current in input[1:]: | 6 | for current in input[1:]: |
| 7 | diff = current - last | 7 | result.append(current - previous) |
| 8 | append(diff) | 8 | previous = current |
| 9 | last = current | 9 | return result |
| 10 | return out | 10 |
Your Solution
100% (4/4)4μs
1def solve(input):2 out = input[:1]3 append = out.append4 append = append5 last = input[0] if out else 06 for current in input[1:]:7 diff = current - last8 append(diff)9 last = current10 return outChampion
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