lintcode 22.平面列表
2018-02-26 17:16
253 查看
class Solution(object):
# @param nestedList a list, each element in the list
# can be a list or integer, for example [1,2,[1,2]]
# @return {int[]} a list of integer
def flatten(self, nestedList):
# Write your code here
if isinstance(nestedList, int):
return [nestedList]
result = []
for ele in nestedList:
result.append(self.flatten(ele))
return result
'''
答案是错误的,不应该用append,应该改为extend,答案就对了
'''
class Solution(object):
# @param nestedList a list, each element in the list
# can be a list or integer, for example [1,2,[1,2]]
# @return {int[]} a list of integer
def flatten(self, nestedList):
# Write your code here
if isinstance(nestedList, int):
return [nestedList]
result = []
for ele in nestedList:
result.extend(self.flatten(ele))
return result
# @param nestedList a list, each element in the list
# can be a list or integer, for example [1,2,[1,2]]
# @return {int[]} a list of integer
def flatten(self, nestedList):
# Write your code here
if isinstance(nestedList, int):
return [nestedList]
result = []
for ele in nestedList:
result.append(self.flatten(ele))
return result
'''
答案是错误的,不应该用append,应该改为extend,答案就对了
'''
class Solution(object):
# @param nestedList a list, each element in the list
# can be a list or integer, for example [1,2,[1,2]]
# @return {int[]} a list of integer
def flatten(self, nestedList):
# Write your code here
if isinstance(nestedList, int):
return [nestedList]
result = []
for ele in nestedList:
result.extend(self.flatten(ele))
return result
相关文章推荐
- 22. 平面列表-LintCode
- LintCode【简单】22. 平面列表 。代码及思路
- lintcode 22.平面列表
- LintCode-22. 平面列表
- LintCode 22. 平面列表 挑战用非递归方法尝试解答这道题
- lintcode-22-平面列表
- LintCode 22 平面列表
- 22. 平面列表
- LintCode:平面列表
- LintCode 平面列表
- (lintcode)第22题 平面列表
- lintcode 平面列表
- 平面列表-LintCode
- LintCode2016年8月22日算法比赛----平面列表
- Lintcode:平面列表
- LintCode python 小白-简单题-22平面列表
- LintCode算法题解——判断数独是否合法、平面列表、克隆二叉树、序列排号
- 平面列表
- LintCode:删除列表中的元素
- 排序列表转换为二分查找树-LintCode