Python中的元组（6）

元组

元组定义

定义:元组是一个不可修改的，元素以逗号分割，以小括号包围的有序序列。

names = ['lisi', 'zhangsan', 'wangwu']
print(names)  # 输出列表['lisi', 'zhangsan', 'wangwu']
print(type(names))  # <class 'list'>

访问元祖

#通过与索引获取1元素
a=(1,2,3)
print(a[0])#1
# a[0]=9#这是错的，不支持修改

#使用for循环获取所有元素
a=(1,2,3)
for x in a:
    print(x)

#切片
a=(1,2,3,4)
print(a[2::1])#(3, 4)

元组的合并和重复

#合并
a=(1,2,)
b=(3,4)
c=a+b
print(c)#(1, 2, 3, 4)
#重复
d=a*2
print(d)#(1, 2, 1, 2)

使用多个变量接受元组中的值

a,b,c=(1,2,3)
print(a)#1
print(b,c)#2 3

序列解包

a,b,c=(1,2,3)
a,*b=(1,2,3)
print(a)#1
print(b)#[2, 3] b变成了列表

增加

a=(1,2,3,[4,5])
a[3].append(9)
print(a)#(1, 2, 3, [4, 5, 9])

类型强制转换

a=[1,2,3]
b=tuple(a)
print(b)#(1, 2, 3)
c=list(b)
print(c)#[1, 2, 3]

元组中的方法

a=('a','b','c')
#没找知道会报错
b=a.index('e',1,2)#后面的1,2是指定的范围
print(b)
#没找知道会报错
x=a.index('d')
print(x)

遍历元祖

#遍历二维数组
print("第一个")
a=(('张三',19),('李四',20),('王五',7))
for x in a:
    print(x)

print("第二个")
for x,y in a:
    print(x,y)

print("第三个")
#enumerate()内置函数
#for循环每遍历一次enumerate()函数返回一个元组(index,value),索引从0开始
a=(11,12,13,'a')
for x in enumerate(a):
    print(x)

运行结果：

逗号

#一个元素的时候加一个， 才能表示元组
a=(1,)
print(type(a))#<class 'tuple'>
a=(1)
print(type(a))#<class 'int'>

练习题

# 1.元组求和
a = (1, 2, 3, 4, 5, 6)
he = 0
i = 0
while i < len(a):
    print(a[i])
    he += a[i]
    i += 1
print(he)  # 21

#2.输出元祖内7的倍数及个位数为7的总数
a = (1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
gs = 0
for x in a:
    if x % 7 == 0 or x % 10 == 7:
        gs += 1
        print(x, "是")
print(gs)  # 2


#3.输出元组内奇偶数的个数
a=(1,2,3,4,5,6,7,8,9,10,11)
js=0
os=0
for x in a:
    if x%2==0:
        os+=1
    else:
        js+=1
print(os,js)

#法二：
a=(1,2,3,4,5,6,7,8,9,10,11)
js=0
os=0
i=0
while i<len(a):
    if a[i] % 2 == 0:# 因为用的是里面的值所以需要a[i]
        os += 1
    else:
        js += 1
    i+=1
print(os,js)


# 4.# 输出元组内最大值和最小值及其下标
# 法一
a = (3, 2, 5, 1, 4, 9, 7)
max = a[0]
min = a[0]
for i in a:
    if max < i:
        max = i
    if min > i:
        min = i
print(max, a.index(max))  # 9 5
print(min, a.index(min))  # 1 3

# 法二
a = (3, 2, 5, 1, 4, 9, 7)
max_zhi = a[0]
max_xb = 0
min_zhi = a[0]
min_xb = 0
i = 0
while i < len(a):
    if a[i] > max_zhi:
        max_zhi = a[i]
        max_xb = i
    elif a[i] < min_zhi:
        min_zhi = a[i]
        min_xb = i
    i += 1
print(max_zhi, max_xb)
print(min_zhi, min_xb)

扩展

# 1.上下第一个，第二个元素依次相加，然后结果弄到另一个列表
# 法一：
a = [1, 2, 3, 3, 2, 5]
b = [11, 22, 8, 7, 5, 9]
i = 0
c = []
while i < len(a):
    d = a[i] + b[i]
    c.append(d)
    i += 1
print(c)  # [12, 24, 11, 10, 7, 14]

# 法二：
a = [1, 2, 3, 3, 2, 5]
b = [11, 22, 8, 7, 5, 9]
c = []
for i in range(len(a)):
    c.append(a[i] + b[i])
print(c)

# 2.实现循环转
#法一:
import time

a = [1, 2, 3, 4, 5, 6]
while True:
    t=a[0]  #1
    for i in range(0,5):
        a[i]=a[i+1]
        a[i+1]=t
    print(a)
    time.sleep(1)
#法二：
import time

a = [1, 2, 3, 4, 5, 6]
while True:
    t = a[0]
    i = 0
    while i < len(a) - 1:
        a[i] = a[i + 1]
        i += 1
    a[i] = t
    print(a)
    time.sleep(1)

另一种：和上面循环转的方向不同（顺序）
import time
a=[1,2,3,4,5,6]
while True:
    t=a[len(a)-1]
    i=len(a)-1
    while i>0:
        a[i]=a[i-1]
        i-=1
    a[0]=t
    print(a)
    time.sleep(1)

2的运行效果：

# 3.实现逆序输出
# 法一：
a = [1, 2, 3, 4, 5, 6]
i = 0
while i < len(a) // 2:
    t = a[i]
    a[i] = a[len(a) - 1 - i]
    a[len(a) - 1 - i] = t
    i += 1
print(a)  # [6, 5, 4, 3, 2, 1]

# 法二：
a = [1, 2, 3, 4, 5, 6]
i = 0
j = len(a) - 1
while i < j:
    t = a[i]
    a[i] = a[j]
    a[j] = t
    i += 1
    j -= 1
print(a)  # [6, 5, 4, 3, 2, 1]
# 法三：
# 法三先进行铺垫再根据这些原理，得到法三的方法
a = [1, 2, 3, 4, 5, 6]
a = 3
b = 4
a, b = b, a
print(a, b)  # 4 3

a = [1, 2, 3, 4, 5, 6]
i = 0
j = len(a) - 1
while i < j:
    a[i], a[j] = a[j], a[i]
    i += 1
    j -= 1
print(a)  # [6, 5, 4, 3, 2, 1]

# 4.在a中找到有几个b
# 法一：
a = [1, 2, 3, 4, 1, 2, 5, 1, 1, 2]
b = [1, 2]
count = 0
for i in range(len(a)):
    if a[i] == b[0] and a[i + 1] == b[1]:
        count += 1
print(count)  # 3

# 法二：
a = [1, 2, 3, 4, 1, 2, 5, 1, 1, 2]
b = [1, 2]
count = 0
i = 0
while i < len(a):
    if a[i] == b[0] and a[i + 1] == b[1]:
        count += 1
    i += 1
print(count)