Skip to content

Commit 1020b7c

Browse files
committed
modify st
1 parent 444e8c9 commit 1020b7c

File tree

2 files changed

+44
-1
lines changed

2 files changed

+44
-1
lines changed

Algorithm/sort/odd-even.py

Lines changed: 9 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,9 @@
1+
对列表内的元素进行排序奇数在前偶数在后如果你高兴的话也可以反过来呀
2+
使用列表解析式解决
3+
```python
14
# -*- coding: utf-8 -*-
25

36
from random import randrange
4-
from insert_sort import *
57

68
def odd_even(seq):
79
odd = [i for i in lst if i % 2 != 0]
@@ -12,6 +14,11 @@ def odd_even(seq):
1214
if __name__ == "__main__":
1315
lst = [randrange(100) for _ in range(10)]
1416
print(odd_even(lst))
17+
```
18+
什么你想要奇偶数排好序的行呀导入之前自己写的插入排序走起
19+
```python
20+
from random import randrange
21+
from insert_sort import *
1522

1623
def odd_even(seq):
1724
odd = [i for i in lst if i % 2 != 0]
@@ -25,3 +32,4 @@ def odd_even(seq):
2532
if __name__ == "__main__":
2633
lst = [randrange(100) for _ in range(10)]
2734
print(odd_even(lst))
35+
```

Algorithm/sort/odd_even.md

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
对列表内的元素进行排序,奇数在前,偶数在后。如果你高兴的话也可以反过来呀。
2+
使用列表解析式解决!
3+
```python
4+
# -*- coding: utf-8 -*-
5+
6+
from random import randrange
7+
8+
def odd_even(seq):
9+
odd = [i for i in lst if i % 2 != 0]
10+
even = [i for i in lst if i % 2 == 0]
11+
12+
return odd + even
13+
14+
if __name__ == "__main__":
15+
lst = [randrange(100) for _ in range(10)]
16+
print(odd_even(lst))
17+
```
18+
什么,你想要奇偶数排好序的。行呀,导入之前自己写的插入排序!走起
19+
```python
20+
from random import randrange
21+
from insert_sort import *
22+
23+
def odd_even(seq):
24+
odd = [i for i in lst if i % 2 != 0]
25+
odd = insert_sort(odd)
26+
27+
even = [i for i in lst if i % 2 == 0]
28+
even = insert_sort(even)
29+
30+
return odd + even
31+
32+
if __name__ == "__main__":
33+
lst = [randrange(100) for _ in range(10)]
34+
print(odd_even(lst))
35+
```

0 commit comments

Comments
 (0)