zoukankan      html  css  js  c++  java
  • python笔记-tuple元组的方法

    
    
    #!/usr/bin/env python
    #-*- coding:utf-8 -*-
    
    # 创建空元组
    tuple1 = ()
    print(tuple)
    # 创建带有元素的元组
    # 元组中的类型可以不同
    tuple2 = (1,2,3,"good",True)
    print(tuple2)
    # 定义只有一个元素的元组
    tuple3 = (1, )
    print(tuple3)
    print(type(tuple3))
    
    
    # 元组元素的访问
    # 格式:元组名[下标]
    # 下标从0开始
    # 取值
    tuple4 = (1,2,3,4,5)
    print(tuple4[0])
    print(tuple4[1])
    print(tuple4[2])
    print(tuple4[3])
    print(tuple4[4])
    # print(tuple4[5]) #下标超过了范围(越界)
    # 获取最后一个元素
    print(tuple4[-1])
    print(tuple4[-2])
    
    
    
    
    # 修改元组
    tuple5 = (1,2,3,4,5,[6,7,8])
    # tuple5[0] = 100    #报错,元组不能变
    # tuple5[-1] = [1,2,3]
    tuple5[-1][0] = 100
    print(tuple5)
    
    
    
    # 删除元组
    tuple6 = (1,2,3)
    del tuple6
    # print(tuple6)
    
    
    
    
    # 元组的操作
    t7 = (1,2,3)
    t8 = (4,5,6)
    print(t7 + t8)
    t9 = t7 + t8
    print(t9)
    
    
    # 元组的重复
    t9 = (1,2,3)
    print(t9 * 3)
    
    
    
    # 判断元素是否在元组中
    t1 = (1,2,3)
    print(1 in t1)
    
    
    # 元组的截取
    # 格式:元组名[开始下标:结束下标]
    # 从开始下标开始截取,截取到结束下标之前
    t12 = (1,2,3,4,5,6,7,8,9)
    print(t12[2:7])
    print(t12[2:])
    print(t12[:7])
    
    
    
    
    # 二维元组: 元素为一维元组的元组
    t13 = ((1,2,3),(4,5,6),(7,8,9))
    print(t13[1][1])
    
    
    
    
    # 元组的方法
    # len()  返回元组中元素的个数
    t14 = (1,2,3,4,5)
    print(len(t14))
    
    
    # max()   返回元组中最大值
    # min()   返回元组中最小值
    print(min((1,2,3,4,5)))
    print(max((1,2,4,32,6)))
    
    
    
    
    # 将列表转成元组
    list = [1,2,3,4]
    t15 = tuple(list)
    print(t15)
    
    
    # 元组的遍历
    for i in (1,2,3,4,5):
        print(i)
    
    
    
    
    
    
  • 相关阅读:
    [面试题]什么是面向对象编程
    面向对象编程的新手理解
    Object of type type is not JSON serializable
    STL---map
    STL---llist
    Div标签使用inline-block有间距
    STL---vector
    KMP算法
    算法06
    算法05
  • 原文地址:https://www.cnblogs.com/dggsec/p/9131683.html
Copyright © 2011-2022 走看看