Run #0139cffd

completed

Score

100% (4/4)

Runtime

6μs

vs Previous

No change vs parent

Tied for best

Same as parent

Solution Lineage

Current100%Same as parent
5fd7278e100%Same as parent
2fac06cd100%First in chain

Code

def solve(input):
    result = [0] * len(input)
    result[0] = input[0]
    for i in range(1, len(input)):
        result[i] = input[i] - input[i - 1]
    return result

Compare with Champion

Score Difference

Tied

Runtime Advantage

4μs slower

Code Size

6 vs 9 lines

#Your Solution#Champion
1def solve(input):1def solve(input):
2 result = [0] * len(input)2 if not input:
3 result[0] = input[0]3 return []
4 for i in range(1, len(input)):4 result = [input[0]]
5 result[i] = input[i] - input[i - 1]5 previous = input[0]
6 return result6 for current in input[1:]:
77 result.append(current - previous)
88 previous = current
99 return result
Your Solution
100% (4/4)6μs
1def solve(input):
2    result = [0] * len(input)
3    result[0] = input[0]
4    for i in range(1, len(input)):
5        result[i] = input[i] - input[i - 1]
6    return result
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 = current
9    return result