str = "www.dataCASTLE.com"
print(str.upper())# 把所有字符中的小寫字母轉(zhuǎn)換成大寫字母
print(str.lower())# 把所有字符中的大寫字母轉(zhuǎn)換成小寫字母
print(str.capitalize())# 把第一個(gè)字母轉(zhuǎn)化為大寫字母，其余小寫
print(str.title())# 把每個(gè)單詞的第一個(gè)字母轉(zhuǎn)化為大寫，其余小寫 
WWW.DATACASTLE.COM
www.datacastle.com
Www.datacastle.com
Www.Datacastle.Com

s="hGdssWW678qqfdDDD777f8888sD8FJJss jjYYhVV #sh&" 
def fn(x):
  if x.is lower():
    return x.upper()
  elif x.is upper():
    return x.lower()
  else:
    return x
result=''.join([fn(r) for r in list(s)])
print(result)
HgDSSww678QQFDddd777F8888Sd8fjjSS JJyyHvv #SH&

with open('D:
.txt','r') as f:
  txt=f.readlines()
  txt.insert(4,txt[1])#第二行插入第五行的位置
  del(txt[1])#刪除原來的第二行
  print(txt)
1  A  一 
3  C  三 
4  D  四 
2  B  二 
5  E  五 
6  F  六

matrix = [[1, 1, 1, 1],
         [2, 2, 2, 2],
         [3, 3, 3, 3],]

trans = []
for i in range(4):
  trans.append([row[i] for row in matrix])

print('', trans)
 [[1, 2, 3], 
 [1, 2, 3], 
 [1, 2, 3], 
 [1, 2, 3]]

def quickSort(arg):
  if(arg==[]):
     return []
  return quickSort([i for i in arg[1:] if i<=arg[0]])+[arg[0]]+quickSort([i for i in arg[1:] if i>arg[0]])
print quickSort([11,22,8,23,7,33,13,28,66,777])
[7, 8, 11, 13, 22, 23, 28, 33, 66, 777]

def quicksort(array, left, right):
  #建立遞歸終止條件
  if left >= right:
    return
  low = left#low為序列左邊要移動(dòng)的游標(biāo)
  high = right#high為序列右邊要移動(dòng)的游標(biāo)
  key = array[low]#將左邊的數(shù)設(shè)為基準(zhǔn)元素

  while left < right:
    # 當(dāng)left與right未重合，并且比基準(zhǔn)元素要大，就將游標(biāo)向左移動(dòng)
    while left < right and array[right] > key:
      right -= 1
    # 如果比基準(zhǔn)元素小，就跳出循環(huán)，并且把其放在基準(zhǔn)元素左邊
    array[left] = array[right]

    # 當(dāng)low與last未重合，并且比基準(zhǔn)元素要小，就將游標(biāo)向右移動(dòng)
    while left < right and array[left] <= key:
      left += 1
    # 如果比基準(zhǔn)元素大，就跳出循環(huán)，并且把其放在基準(zhǔn)元素右邊
    array[right] = array[left]

  # 當(dāng)low與last相等，就是基準(zhǔn)元素的排序位置
  array[right] = key

  # 對(duì)排序好的元素左右兩邊的序列進(jìn)行遞歸
  quicksort(array, low, left - 1)
  quicksort(array, left + 1, high)

array = [11,22,8,23,7,33,13,28,66,777]
print("Quick Sort: ")
quicksort(array,0,len(array)-1)
print(array)
[7, 8, 11, 13, 22, 23, 28, 33, 66, 777]

def quicksort(array, l, r):
  if l < r:
    q = partition(array, l, r)
    quick_sort(array, l, q - 1)
    quick_sort(array, q + 1, r)

def partition(array, l, r):
  x = array[r]
  i = l - 1
  for j in range(l, r):
    if array[j] <= x:
      i += 1
      array[i], array[j] = array[j], array[i]
  array[i + 1], array[r] = array[r], array[i+1]
  return i + 1
array = [11,22,8,23,7,33,13,28,66,777]
print("Quick Sort: ")
quicksort(array,0,len(array)-1)
print(array)
[7, 8, 11, 13, 22, 23, 28, 33, 66, 777]

a = [11,22,8,23,7,33,13,28,66,777]
b=sorted(a)
print(b)
print(a)

[7, 8, 11, 13, 22, 23, 28, 33, 66, 777]
[11, 22, 8, 23, 7, 33, 13, 28, 66, 777]

# format格式化對(duì)齊
def f1():  
  with open("D:
.txt","r") as f:
    for s in f:
      l=s.rsplit ()
      #左對(duì)齊，填充符號(hào)自定
      t='{0:<5} {1:<7} {2}'.format(l[0],l[1],l[2])  
      print(str(t))
f1()

111   ABC     西瓜
22222 AABBC   水蜜桃
3333  CSDDGFF 香蕉
44    QQQSED  波羅蜜

#just對(duì)齊
r=''
def f2():
  f=open("D:
.txt","r")
  for s in f:
    l=s.rsplit() #通過指定分隔符對(duì)字符串進(jìn)行切片
    print(l[0].ljust(5," "),l[1].ljust(7," "),l[2])
f2()

111   ABC     西瓜
22222 AABBC   水蜜桃
3333  CSDDGFF 香蕉
44    QQQSED  波羅蜜

#正則表達(dá)式
a="aA1一bB2二cC3三dD4四eE5五fF6六gG7七h(yuǎn)H8八iI9九"
import re
reg=["[a-z]","[A-Z]","d","[^da-zA-Z]"]
#compile和findall一起使用，返回一個(gè)列表
for s in reg:  
  rega=re.compile(s)
  s=re.findall(rega,a)
  print("".join(s))

abcdefghi
ABCDEFGHI
123456789
一二三四五六七八九

#string方法
a="aA1一bB2二cC3三dD4四eE5五fF6六gG7七h(yuǎn)H8八iI9九"
import string
ta=tb=tc=td=''
la=string.ascii_lowercase#la為小寫字母
ua=string.ascii_uppercase#ua為大寫字母
nb=string.digits#nb為0~9的數(shù)字
ub="一二三四五六七八九"

#分別從a中找出小寫、大寫字母、數(shù)字并進(jìn)行分行輸出
for s in a:
  if s in la:
    ta=ta+s
  if s in ua:
    tb=tb+s
  if s in nb:
    tc=tc+s
  if s in ub:
    td=td+s
print(ta)
print(tb)
print(tc)
print(td)

abcdefghi
ABCDEFGHI
123456789
一二三四五六七八九