# 創(chuàng)建一個簡單的字典
user_profile = {
    "username": "python_lover",
    "age": 28,
    "skills": ["Python", "Django", "Flask"],
    "is_active": True
}

# 遍歷鍵
for key in user_profile:
    print(f"Key: {key}")

# 遍歷值
for value in user_profile.values():
    print(f"Value: {value}")

# 遍歷鍵值對
for key, value in user_profile.items():
    print(f"{key}: {value}")

# 傳統(tǒng)方式可能引發(fā)KeyError
age = user_profile["age"]

# 更安全的方式
age = user_profile.get("age", 0)  # 如果age不存在，返回默認(rèn)值0

# 統(tǒng)計單詞頻率的經(jīng)典用法
word_counts = {}
for word in ["apple", "banana", "apple", "orange"]:
    word_counts.setdefault(word, 0)
    word_counts[word] += 1

# 合并兩個字典
default_settings = {"theme": "light", "notifications": True}
user_settings = {"theme": "dark", "language": "en"}

default_settings.update(user_settings)
# 結(jié)果: {'theme': 'dark', 'notifications': True, 'language': 'en'}

# 刪除指定鍵并返回其值
removed_value = user_profile.pop("age")

# 刪除并返回最后一個鍵值對(3.7+版本有序)
last_item = user_profile.popitem()

# 創(chuàng)建一個數(shù)字到其平方的映射
squares = {x: x*x for x in range(1, 6)}
# 結(jié)果: {1: 1, 2: 4, 3: 9, 4: 16, 5: 25}

# 條件過濾
even_squares = {x: x*x for x in range(10) if x % 2 == 0}

from collections import defaultdict

# 自動為不存在的鍵初始化默認(rèn)值
word_counts = defaultdict(int)
for word in ["apple", "banana", "apple"]:
    word_counts[word] += 1

from collections import OrderedDict

# 記住元素插入順序(在Python 3.7+中普通dict也有序)
ordered_dict = OrderedDict()
ordered_dict["first"] = 1
ordered_dict["second"] = 2

# Python 3.9+ 新特性
dict1 = {"a": 1, "b": 2}
dict2 = {"b": 3, "c": 4}
merged = dict1 | dict2  # {'a': 1, 'b': 3, 'c': 4}

# 傳統(tǒng)方式
merged = {**dict1, **dict2}

class LRUCache:
    def __init__(self, capacity: int):
        self.cache = OrderedDict()
        self.capacity = capacity

    def get(self, key):
        if key not in self.cache:
            return -1
        self.cache.move_to_end(key)
        return self.cache[key]

    def put(self, key, value):
        if key in self.cache:
            self.cache.move_to_end(key)
        self.cache[key] = value
        if len(self.cache) > self.capacity:
            self.cache.popitem(last=False)