30個Python常用極簡代碼


1.檢查給定列表是不是存在重復元素

def all_unique(lst):
    return len(lst) == len(set(lst))


x = [1, 1, 2, 2, 3, 2, 3, 4, 5, 6]
y = [1, 2, 3, 4, 5]
all_unique(x)  # False
all_unique(y)  # True

2.檢查兩個字符串的組成元素是不是一樣的

from collections import Counter


def anagram(first, second):
    return Counter(first) == Counter(second)


anagram("abcd3", "3acdb")  # True

3.內存占用

import sys

variable = 30
print(sys.getsizeof(variable))  # 28

4.檢查字符串占用的字節數

def byte_size(string):
    return (len(string.encode('utf-8')))


byte_size('')  # 4
byte_size('Hello World')  # 11

5.打印 N 次字符串

n = 2
s = "Programming"
print(s * n)

6.大寫第一個字母

s = "programming is awesome"
print(s.title())  # Programming Is Awesome

7.給定具體的大小,定義一個函數以按照這個大小切割列表

from math import ceil


def chunk(lst, size):
    return list(
        map(lambda x: lst[x * size:x * size + size],
            list(range(0, ceil(len(lst) / size)))))


chunk([1, 2, 3, 4, 5], 2)  # [[1,2],[3,4],5]

8.這個方法可以將布爾型的值去掉,例如(False,None,0,“”),它使用 filter() 函數

def compact(lst):
    return list(filter(bool, lst))


compact([0, 1, False, 2, '', 3, 'a', 's', 34])  # [ 1, 2, 3, 'a', 's', 34 ]

9.如下代碼段可以將打包好的成對列表解開成兩組不同的元組

array = [['a', 'b'], ['c', 'd'], ['e', 'f']]
transposed = zip(*array)
print(transposed)  # [('a', 'c', 'e'), ('b', 'd', 'f')]

10.我們可以在一行代碼中使用不同的運算符對比多個不同的元素

a = 3
print(2 < a < 8)  # True
print(1 == a < 2)  # False

11.將列表連接成單個字符串,且每一個元素間的分隔方式設置為了逗號

hobbies = ["basketball", "football", "swimming"]
print("My hobbies are: " + ", ".join(hobbies))  # My hobbies are: basketball, football, swimming

12.統計字符串中的元音 (‘a’, ‘e’, ‘i’, ‘o’, ‘u’) 的個數,它是通過正則表達式做的

import re


def count_vowels(str):
    return len(re.findall(r'[aeiou]', str, re.IGNORECASE))


count_vowels('foobar')  # 3
count_vowels('gym')  # 0

13.給定字符串的第一個字符統一為小寫

def decapitalize(string):
    return string[:1].lower() + string[1:]


decapitalize('FooBar')  # 'fooBar'
decapitalize('FooBar')  # 'fooBar'

14.通過遞歸的方式將列表的嵌套展開為單個列表

def spread(arg):
    ret = []
    for i in arg:
        if isinstance(i, list):
            ret.extend(i)
        else:
            ret.append(i)
    return ret


def deep_flatten(lst):
    result = []

    result.extend(
        spread(list(map(lambda x: deep_flatten(x) if type(x) == list else x, lst))))
    return result


print(deep_flatten([1, [2], [[3], 4], 5]))  # [1,2,3,4,5]

15.返回第一個列表的元素,其不在第二個列表內。如果同時要反饋第二個列表獨有的元素,還需要加一句 set_b.difference(set_a)

def difference(a, b):
    set_a = set(a)
    set_b = set(b)
    comparison = set_a.difference(set_b)
    return list(comparison)


difference([1, 2, 3], [1, 2, 4])  # [3]

16.如下方法首先會應用一個給定的函數,然后再返回應用函數后結果有差別的列表元素

from math import floor


def difference_by(a, b, fn):
    b = set(map(fn, b))
    return [item for item in a if fn(item) not in b]


print(difference_by([2.1, 1.2], [2.3, 3.4], floor))  # [1.2]
print(difference_by([{'x': 2}, {'x': 1}], [{'x': 1}], lambda v: v['x']))  # [ { x: 2 } ]

17.你可以在一行代碼內調用多個函數

def add(a, b):
    return a + b


def subtract(a, b):
    return a - b


a, b = 4, 5
print((subtract if a > b else add)(a, b))  # 9

18.檢查兩個列表是不是有重復項

def has_duplicates(lst):
    return len(lst) != len(set(lst))


x = [1, 2, 3, 4, 5, 5]
y = [1, 2, 3, 4, 5]
print(has_duplicates(x))  # True
print(has_duplicates(y))  # False

19.合並兩個字典

def merge_two_dicts(a, b):
    c = a.copy()  # make a copy of a
    c.update(b)  # modify keys and values of a with the once from b
    return c


a = {'x': 1, 'y': 2}
b = {'y': 3, 'z': 4}
print(merge_two_dicts(a, b))  # {'y':3,'x':1,'z':4}


def merge_dictionaries(a, b):
    return {**a, **b}


a = {'x': 1, 'y': 2}
b = {'y': 3, 'z': 4}
print(merge_dictionaries(a, b))  # {'y': 3, 'x': 1, 'z': 4}

20.兩個列表轉化為單個字典

def to_dictionary(keys, values):
    return dict(zip(keys, values))


keys = ["a", "b", "c"]
values = [2, 3, 4]
print(to_dictionary(keys, values))  # {'a': 2, 'c': 4, 'b': 3}

21.我們常用 For 循環來遍歷某個列表,同樣我們也能枚舉列表的索引與值

list = ["a", "b", "c", "d"]
for index, element in enumerate(list):
    print("Value", element, "Index ", index, )
# ('Value', 'a', 'Index ', 0)
# ('Value', 'b', 'Index ', 1)
# ('Value', 'c', 'Index ', 2)
# ('Value', 'd', 'Index ', 3)

22.計算執行特定代碼所花費的時間

import time

start_time = time.time()
a = 1
b = 2
c = a + b
print(c)  # 3
end_time = time.time()
total_time = end_time - start_time
print("Time: ", total_time)  # ('Time: ', 1.1205673217773438e-05)

23.我們在使用 try/except 語句的時候也可以加一個 else 子句,如果沒有觸發錯誤的話,這個子句就會被運行

try:
    2 * 3
except TypeError:
    print("An exception was raised")
else:
    print("Thank God, no exceptions were raised.")  # Thank God, no exceptions were raised.

24.根據元素頻率取列表中最常見的元素

def most_frequent(list):
    return max(set(list), key=list.count)


list = [1, 2, 1, 2, 3, 2, 1, 4, 2]
print(most_frequent(list))  # 2

25.檢查給定的字符串是不是回文序列,它首先會把所有字母轉化為小寫,並移除非英文字母符號。最后,它會對比字符串與反向字符串是否相等,相等則表示為回文序列

from re import sub


def palindrome(string):
    s = sub('[\W_]', '', string.lower())
    return s == s[::-1]


print(palindrome('taco cat'))  # True

26.不使用條件語句就實現加減乘除、求冪操作,它通過字典這一數據結構實現

import operator

action = {
    "+": operator.add,
    "-": operator.sub,
    "/": operator.truediv,
    "*": operator.mul,
    "**": pow
}
print(action['-'](50, 25))  # 25

27.該算法會打亂列表元素的順序,它主要會通過 Fisher-Yates 算法對新列表進行排序

from copy import deepcopy
from random import randint


def shuffle(lst):
    temp_lst = deepcopy(lst)
    m = len(temp_lst)
    while (m):
        m -= 1
    i = randint(0, m)
    temp_lst[m], temp_lst[i] = temp_lst[i], temp_lst[m]
    return temp_lst


foo = [1, 2, 3]
print(shuffle(foo))  # [2,3,1] , foo = [1,2,3]

28.將列表內的所有元素,包括子列表,都展開成一個列表

def spread(arg):
    ret = []
    for i in arg:
        if isinstance(i, list):
            ret.extend(i)
        else:
            ret.append(i)
    return ret


print(spread([1, 2, 3, [4, 5, 6], [7], 8, 9]))  # [1,2,3,4,5,6,7,8,9]

29.不需要額外的操作就能交換兩個變量的值

def swap(a, b):
    return b, a


a, b = -1, 14
print(swap(a, b))  # (14, -1)

30.通過 Key 取對應的 Value 值,可以通過以下方式設置默認值。如果 get() 方法沒有設置默認值,那么如果遇到不存在的 Key,則會返回 None

d = {'a': 1, 'b': 2}
print(d.get('c', 3))  # 3

  

 


免責聲明!

本站轉載的文章為個人學習借鑒使用,本站對版權不負任何法律責任。如果侵犯了您的隱私權益,請聯系本站郵箱yoyou2525@163.com刪除。



 
粵ICP備18138465號   © 2018-2025 CODEPRJ.COM