Run #6c4e319f

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
0139cffd100%Same as parent
5fd7278e100%Same as parent
2fac06cd100%First in chain

Code

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

    return result

Compare with Champion

Score Difference

Tied

Runtime Advantage

4μs slower

Code Size

15 vs 9 lines

#Your Solution#Champion
1def solve(input):1def solve(input):
2 n = len(input)2 if not input:
3 if not n:3 return []
4 return []4 result = [input[0]]
5 5 previous = input[0]
6 result = [0] * n6 for current in input[1:]:
7 prev = input[0]7 result.append(current - previous)
8 result[0] = prev8 previous = current
9 9 return result
10 for i in range(1, n):10
11 curr = input[i]11
12 result[i] = curr - prev12
13 prev = curr13
1414
15 return result15
Your Solution
100% (4/4)6μs
1def solve(input):
2    n = len(input)
3    if not n:
4        return []
5    
6    result = [0] * n
7    prev = input[0]
8    result[0] = prev
9    
10    for i in range(1, n):
11        curr = input[i]
12        result[i] = curr - prev
13        prev = curr
14
15    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