zoukankan      html  css  js  c++  java
  • python——os.path.join()

    python路径拼接os.path.join()函数的用法

     

    os.path.join()函数:连接两个或更多的路径名组件

                             1.如果各组件名首字母不包含’/’,则函数会自动加上

             2.如果有一个组件是一个绝对路径,则在它之前的所有组件均会被舍弃

             3.如果最后一个组件为空,则生成的路径以一个’/’分隔符结尾

    Demo1

    import os

    Path1 = 'home'
    Path2 = 'develop'
    Path3 = 'code'

    Path10 = Path1 + Path2 + Path3
    Path20 = os.path.join(Path1,Path2,Path3)
    print ('Path10 = ',Path10)
    print ('Path20 = ',Path20)

    输出

    Path10 = homedevelopcode
    Path20 = homedevelopcode

    --------------------------------------------------------------

    Demo2

    import os

    Path1 = '/home'
    Path2 = 'develop'
    Path3 = 'code'

    Path10 = Path1 + Path2 + Path3
    Path20 = os.path.join(Path1,Path2,Path3)
    print ('Path10 = ',Path10)
    print ('Path20 = ',Path20) 
    输出

    Path10 = /homedevelopcode
    Path20 = /homedevelopcode

    --------------------------------------------------------------

    Demo3

    import os

    Path1 = 'home'
    Path2 = '/develop'
    Path3 = 'code'

    Path10 = Path1 + Path2 + Path3
    Path20 = os.path.join(Path1,Path2,Path3)
    print ('Path10 = ',Path10)
    print ('Path20 = ',Path20) 

    输出

    Path10 = home/developcode
    Path20 = /developcode

    --------------------------------------------------------------

    Demo4

    import os

    Path1 = 'home'
    Path2 = 'develop'
    Path3 = '/code'

    Path10 = Path1 + Path2 + Path3
    Path20 = os.path.join(Path1,Path2,Path3)
    print ('Path10 = ',Path10)
    print ('Path20 = ',Path20 )

    输出

    Path10 = homedevelop/code
    Path20 = /code

  • 相关阅读:
    18.9.22 noip模拟赛
    POJ 2299 Ultra-QuickSort
    美团2018年CodeM大赛-初赛B轮 B 配送(最短路)
    Wannafly挑战赛18 E 极差(线段树、单调栈)
    Foj 2299 Prefix(AC自动机、DP)
    求独立矩形个数
    Zoj 3777 Problem Arrangement
    Luogu 2444 [POI2000]病毒 & Zoj 3784
    [ZJOI2007]Hide 捉迷藏
    双联通分量学习笔记
  • 原文地址:https://www.cnblogs.com/1792353277lay/p/12092865.html
Copyright © 2011-2022 走看看