Given an array of integers (x), and a target (t), you must find out if any two consecutive numbers in the array sum to t. If so, remove the second number.
Example:
x = [1, 2, 3, 4, 5]
t = 3 
1+2 = t, so remove 2. No other pairs = t, so rest of array remains:
[1, 3, 4, 5]
Work through the array from left to right.
Return the resulting array.
def trouble(x, t):
    n = x[:1]
    for i in x[1:]:
        if i + n[-1] != t:
            n.append(i)
    return n

def trouble(x, t):
    n = x[:1]
    for i in x[1:]:
        if i + n[-1] != t:
            n.append(i)
    return n
