【第三题】字符串"ABCDEF",根据步长左旋
方法一:(利用字符串切片)
# -*- coding:utf-8 -*- str="ABCDEF" step=3 def leftReverse(str,step): if (step <= 0 or step > len(str)): return return str[step:]+str[:step]

【第三题】字符串"ABCDEF",根据步长左旋方法一:(利用字符串切片)
# -*- coding:utf-8 -*- str="ABCDEF" step=3 def leftReverse(str,step): if (step <= 0 or step > len(str)): return return str[step:]+str[:step]
|