Run #2b7ab3f8
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):
length = len(input)
if length == 0:
return []
result = [0] * length
result[0] = input[0]
last = input[0]
for i in range(1, length):
current = input[i]
result[i] = current - last
last = current
return resultCompare with Champion
Score Difference
Tied
Runtime Advantage
3μs slower
Code Size
12 vs 9 lines
| # | Your Solution | # | Champion |
|---|---|---|---|
| 1 | def solve(input): | 1 | def solve(input): |
| 2 | length = len(input) | 2 | if not input: |
| 3 | if length == 0: | 3 | return [] |
| 4 | return [] | 4 | result = [input[0]] |
| 5 | result = [0] * length | 5 | previous = input[0] |
| 6 | result[0] = input[0] | 6 | for current in input[1:]: |
| 7 | last = input[0] | 7 | result.append(current - previous) |
| 8 | for i in range(1, length): | 8 | previous = current |
| 9 | current = input[i] | 9 | return result |
| 10 | result[i] = current - last | 10 | |
| 11 | last = current | 11 | |
| 12 | return result | 12 |
Your Solution
100% (4/4)5μs
1def solve(input):2 length = len(input)3 if length == 0:4 return []5 result = [0] * length6 result[0] = input[0]7 last = input[0]8 for i in range(1, length):9 current = input[i]10 result[i] = current - last11 last = current12 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