摘要:
Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence. For example, in the given t 阅读全文
摘要:
创建集合(括号中只能有一个参数): >>> s = set('set') >>> s {'s', 't', 'e'} >>> s = set(['set']) >>> s {'set'} 增加一个元素: >>> s {'set'} >>> s.add('python') >>> s {'set', 阅读全文
摘要:
a = [1,2,3,4,5,6] for i in a : a.remove(i) print(a) 对于上边一段代码一直以来我都认为是将a中的全部元素删除,但结果却让我始料未及: [2, 4, 6] 将第i个元素删除后,下一次迭代是下下个元素,我猜是删除第i个元素后将其后整体前移一个位置,然后下 阅读全文