Run #c9dfd862
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):
n = len(input)
if n == 0:
return []
output = [0] * n
output[0] = input[0]
for i in range(1, n):
output[i] = input[i] - input[i - 1]
return outputCompare 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 | n = len(input) | 2 | if not input: |
| 3 | if n == 0: | 3 | return [] |
| 4 | return [] | 4 | result = [input[0]] |
| 5 | 5 | previous = input[0] | |
| 6 | output = [0] * n | 6 | for current in input[1:]: |
| 7 | output[0] = input[0] | 7 | result.append(current - previous) |
| 8 | 8 | previous = current | |
| 9 | for i in range(1, n): | 9 | return result |
| 10 | output[i] = input[i] - input[i - 1] | 10 | |
| 11 | 11 | ||
| 12 | return output | 12 |
Your Solution
100% (4/4)5μs
1def solve(input):2 n = len(input)3 if n == 0:4 return []56 output = [0] * n7 output[0] = input[0]8 9 for i in range(1, n):10 output[i] = input[i] - input[i - 1]11 12 return outputChampion
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