尾递归 ```python def _recursion_merge_sort2(l1, l2, tmp): if len(l1) == 0 or len(l2) == 0: ...

```python N =100 print ([[x for x in range(1,100)] [i:i+3] for i in range(0,100,3)]) ```

[表达式 for 变量 in 列表] 或者 [表达式 for 变量 in 列表 if 条件]

```python def loop_merge_sort(l1,l2): tmp = [] while len(l1)>0 and len(l2)>0: ...

该列表只包含满足以下条件的值，元素为原始列表中偶数切片 ```python list_data = [1,2,5,8,10,3,18,6,20] res = [x for x in lis...

```python a = [1,2,3,4,5,6,7,8,9,10] res = [ i for i in a if i%2==1] print(res) ```

遍历在新在列表操作，删除时在原来的列表操作 ```python a = [1,2,3,4,5,6,7,8] print(id(a)) print(id(a[:])) for i in ...

```python list1 = [1,2,3] list2 = [3,4,5] set1 = set(list1) set2 = set(list2) print(set1 & s...

```python print([x*11 for x in range(10)]) ```

``` ```