zoukankan      html  css  js  c++  java
  • python+selenium+new——读取txt文件,以冒号分隔

    f = open('C:\\Users\\del\\Desktop\\新建文本文档 (4).txt','r')

    date = f.readlines() #读取所有行,得到一个列表
    print(date)

    print(date[0])
    print(date[1])
    print(date[2])
    print(date[3])

    users = []

    for line in date:
    user = line[:-1].split(":")
    users.append(user)

    print(users)

    print(users[0][0])
    print(users[0][1])

    print(users[1][0])
    print(users[1][1])

    print(users[2][0])
    print(users[2][1])

    print(users[3][0])
    print(users[3][1])

    f.close()
    f = open('C:\\Users\\del\\Desktop\\新建文本文档 (4).txt','r')
    
    date = f.readlines()                   #读取所有行,得到一个列表
    print(date)
    
    print(date[0])
    print(date[1])
    print(date[2])
    print(date[3])
    
    users = []
    
    for line in date:
        user = line[:-1].split(":")
        users.append(user)
    
    print(users)
    
    print(users[0][0])
    print(users[0][1])
    
    print(users[1][0])
    print(users[1][1])
    
    print(users[2][0])
    print(users[2][1])
    
    print(users[3][0])
    print(users[3][1])
    
    f.close()

    执行结果:

    [':123\n', 'user:\n', 'error:error\n', 'admin:admin123\n']
    :123

    user:

    error:error

    admin:admin123

    [['', '123'], ['user', ''], ['error', 'error'], ['admin', 'admin123']]

    123
    user

    error
    error
    admin
    admin123

  • 相关阅读:
    Spring+Springmvc+SpringJDBC+freemaker+Logback配置
    POJ1942+找规律
    HDU2955+DP+背包变形
    HDU1201+简单题
    HDU1288+枚举
    面试经验(转)
    HDU1864+dp+类似背包
    PKU1659+havelhakimi定理
    算法复杂度分析(摘)
    HDU3047+并查集
  • 原文地址:https://www.cnblogs.com/xiaobaibailongma/p/12322416.html
Copyright © 2011-2022 走看看