zoukankan      html  css  js  c++  java
  • python文件操作

    #a 追加
    #w 只写(如果没有文件,就会新建)
    #r 以只读模式打开文件,并将文件指针指向文件头;如果文件不存在会报错
    #r+ 读写,追加读
    #w+ 写读
    #a+追加读
    #rb 二进制文件
    # f = open("yesterday2",'r+', encoding="utf-8",) #文件句柄
    
    #for i in range(5):
    #   print(f.readline())
    
    # for index, line in enumerate(f.readlines()):    全部读取到内存,效率低,占内存
    #     if index == 9:
    #         print("---------")
    #         continue
    #
    #     print(line.strip())
    
    
    # count = 0
    # for line in f:                                 #读取下一行之前删除前一行,效率高
    #     if count == 9:
    #         print("分割线")
    #
    #     print(line.strip())
    #     count += 1
    
    # print(f.read(5))                    #读五个字符
    # print(f.tell())                     #查看文件句柄位置,按字符计数
    # f.seek(0)                           #回到文件某个地方
    # print(f.encoding)                   #打印文件编码
    # f.name                              #打印文件名字
    # f.seekable()                        #是否可以移动光标指针
    # f.readable()                        #判断文件是否可读
    # f.writable()                        #判断文件是否可写
    # f.flush()                           #强制将缓存立即刷新到磁盘上
    
    # import sys,time
    # for i in range(50):
    #     sys.stdout.write("#")
    #     sys.stdout.flush()
    #     time.sleep(0.1)
    
    #f.truncate(10)   #从头开始截断10个字符
    
    
    # f.readline()
    # print(f.tell())
    # f.seek(2)
    # print(f.tell())
    
    #文件修改的方式:将文件读取到内存或打开文件,写到新文件
    
    #文件替换
    # f = open("yesterday", "r", encoding="utf-8")
    #
    # f_new = open("yesterday2", "w", encoding="utf-8")
    #
    # for line in f:
    #     if "肆意的快乐" in line:
    #         line = line.replace("我", "template")
    #     f_new.write(line)
    # f.close()
    # f_new.close()
    
    # with open('log', 'r') as f1,
    #      open('log2') as f2:
    #     pass                                              #自动关闭文件
    
    # with open("yesterday", "r", encoding="utf-8") as f:
    #     print(f.readline())

    文件编码:

  • 相关阅读:
    CF110A Nearly Lucky Number
    Max Sum Plus Plus HDU – 1024
    洛谷 p1003 铺地毯
    poj-1226
    Where is the Marble? UVA – 10474
    Read N Characters Given Read4
    Guess Number Higher or Lower && 九章二分法模板
    Intersection of Two Arrays II
    Reverse Vowels of a String
    Meeting Rooms
  • 原文地址:https://www.cnblogs.com/Template/p/9439867.html
Copyright © 2011-2022 走看看