zoukankan      html  css  js  c++  java
  • day3 python全栈学习笔记


    #作业回顾
    s = 11 s1 = s.bit_length() print(s1) s = bool() print(s) s = 'bhsdjshfa' s3 = s[2::-2] print(s3) a = 'abisdugs' for i in a : print(i)
    #字符串的拼接可以通过+实现
    s = 's132jsdihfsd' s1 = s[1]+s[3]+s[2] print(s1) a = 'abisdugs'
    #while 实现遍历
    s = 's132jsdihfsd' index = 0 while 1: print(s[index]) index += 1 if index == len(s): break
    #输入个位数+个位数 实现求和(包括一个字符串转换)
    content = input('>>>').strip() index = content.find("+") a = int(content[0:index]) b = int(content[index:]) c = a + b print(c)
    # 求和对单个或多个数字进行求和。
    content = input(">>>").strip()
    col1 = content.split('+')
    
    sum = 0
    for i in col1:
        sum += int(i)
    print(sum)
    
    
    #用户输入一系列数字字母,输出数字个数
    text = input('>>>')
    count = 0
    for i in text:
        if i.isdigit():
            count += 1
    print(count)
    
    
    #等级信赖员工名字,按q输入。
    li = [1,'a','b',2,3,'a']
    
    while 1:
        username = input('>>>')
        if username.strip().upper() == 'Q':
            break
        else:
            li.append(username)
    print(li)
    #对列表进行增删改查

    增加 指定位置 li.insert(
    4,'lskud h') print(li) li.extend('二哥') li.extend([1,2,34,5]) print(li) li = [1,'a','b',2,3,'a'] li.pop(1) name = li.pop() print(name,li) 删 li.remove('a') print(li) # li.clear() print(li) del li[2:] #切片删除 print(li) # li[0] = '男爵' print(li) li[0:2]='yuandsaa' print(li) # for i in li : print(i) l = len(li) print(l) s = li.count('d') print(s) print(li.index('d')) 排序 li = [1,324,6,5,765,342,3] #sort()正向排序 li.sort() print(li) #倒序 li.sort(reverse=True) print(li) #反转 li.reverse() print(li)
  • 相关阅读:
    0593. Valid Square (M)
    0832. Flipping an Image (E)
    1026. Maximum Difference Between Node and Ancestor (M)
    0563. Binary Tree Tilt (E)
    0445. Add Two Numbers II (M)
    1283. Find the Smallest Divisor Given a Threshold (M)
    C Primer Plus note9
    C Primer Plus note8
    C Primer Plus note7
    C Primer Plus note6
  • 原文地址:https://www.cnblogs.com/laomaohai/p/10041528.html
Copyright © 2011-2022 走看看