这是我得到的:
# D. Given a list of numbers, return a list where
# all adjacent == elements have been reduced to a single element,
# so [1, 2, 2, 3] returns [1, 2, 3]. You may create a new list or
# modify the passed in list.
def remove_adjacent(nums):
for number in nums:
numberHolder = number
# +++your code here+++
return
Run Code Online (Sandbox Code Playgroud)
我有点被困在这里.我能做什么?
>>> import itertools
>>> [i[0] for i in itertools.groupby([1,2,2,3,3,3,2,2])]
[1, 2, 3, 2]
Run Code Online (Sandbox Code Playgroud)
要么:
>>> def f(l):
... r = []
... last = None
... for i in l:
... if i != last:
... r.append(i)
... last = i
... return r
...
>>> f([1,2,2,3,3,3,4,4,2,2])
[1, 2, 3, 4, 2]
Run Code Online (Sandbox Code Playgroud)