python_test_08

11. 有一个字典列表如下：
    portfolio = [{‘name’: ‘IBM’, ‘shares’: 100, ‘price’: 91.1},
    {‘name’: ‘AAPL’, ‘shares’: 50, ‘price’: 543.22},
    {‘name’: ‘FB’, ‘shares’: 200, ‘price’: 21.09},
    {‘name’: ‘HPQ’, ‘shares’: 35, ‘price’: 31.75},
    {‘name’: ‘YHOO’, ‘shares’: 45, ‘price’: 16.35},
    {‘name’: ‘ACME’, ‘shares’: 75, ‘price’: 115.65}]
    name代表品牌名，shares代表分享数量，price代表价格
    问题：请编写一个程序，输出价格最高的的前三个商品，如：
    [{‘name’: ‘AAPL’, ‘price’: 543.22, ‘shares’: 50},
    {‘name’: ‘ACME’, ‘price’: 115.65, ‘shares’: 75},
    {‘name’: ‘IBM’, ‘price’: 91.1, ‘shares’: 100}]

# 方法1：

portfolio = [{'name': 'IBM', 'shares': 100, 'price': 91.1}, {'name': 'AAPL', 'shares': 50, 'price': 543.22},
             {'name': 'FB', 'shares': 200, 'price': 21.09}, {'name': 'HPQ', 'shares': 35, 'price': 31.75},
             {'name': 'YHOO', 'shares': 45, 'price': 16.35}, {'name': 'ACME', 'shares': 75, 'price': 115.65}]

max_price = sorted(portfolio, key=operator.itemgetter("price"), reverse=False)
max_price = max_price[-1:-4:-1]
print(max_price)

# 方法2：

portfolio = [{'name': 'IBM', 'shares': 100, 'price': 91.1}, {'name': 'AAPL', 'shares': 50, 'price': 543.22},
             {'name': 'FB', 'shares': 200, 'price': 21.09}, {'name': 'HPQ', 'shares': 35, 'price': 31.75},
             {'name': 'YHOO', 'shares': 45, 'price': 16.35}, {'name': 'ACME', 'shares': 75, 'price': 115.65}]
             
max_price = sorted(portfolio,key=lambda  x:x["price"])
max_price = max_price[-1:-4:-1]
print(max_price)

# 方法3–冒泡排序法1：

max_price = []
n = len(portfolio)
for j in range(0, n - 1):  # 反复执行n-1次操作j
    for i in range(0, n - 1 - j):  # 内层循环控制从头走到尾的遍历
        if portfolio[i].get("price") < portfolio[i + 1].get("price"):
            portfolio[i], portfolio[i + 1] = portfolio[i + 1], portfolio[i]
max_price = portfolio[0:3:1]
print(max_price)

# 方法3–冒泡排序法2：

max_price = []
n = len(portfolio)
for j in range(0, n - 1):  # 反复执行n-1次操作j
    for i in range(0, n - 1 - j):  # 内层循环控制从头走到尾的遍历
        if portfolio[i].get("price") > portfolio[i + 1].get("price"):
            portfolio[i], portfolio[i + 1] = portfolio[i + 1], portfolio[i]
max_price = portfolio[-1:-4:-1]
print(max_price)

# 方法4–选择排序法：

max_price = []
n = len(portfolio)
for j in range(n - 1):
     max_index = j
     for i in range(j + 1, n):
         if portfolio[max_index].get("price") < portfolio[i].get("price"):
               max_index = i
         if j != max_index:
            portfolio[j], portfolio[max_index] = portfolio[max_index], portfolio[j]
max_price = portfolio[:3:]
print(max_price)