string字符串转实体类_【Recursion】（6）实战练习：使用递归处理字符串

使用递归清除字符串中的" "和/t

def remove(string):
  # Base Case
  if not string:
      return ""

  # Recursive Case
  if string[0] == "t" or string[0] == " ":
      return remove(string[1:])
  else:
      return string[0] + remove(string[1:])

使用递归清除字符串中的重复字符

def removeDuplicates(string):
    # Base Case1
    if not string:
        return ""

    # Base Case2
    elif len(string) == 1:
        return string

    # Recursive Case1
    elif string[0] == string[1]:
        return removeDuplicates(string[1:])

    # Recursive Case2
    return string[0] + removeDuplicates(string[1:])

使用递归拼接两个字符串并排序

def merge(string1, string2) :
  # Base Case1
  if string1 == "" :
    if string2 == "" : 
      return ""
    return string2

  # Base Case2
  elif string2 == "" :
    return string1

  # Recursive Case1
  elif string1[0] > string2[0] :
      return string2[0] + merge(string1, string2[1:])

  # Recursive Case2
  return string1[0] + merge(string1[1:], string2)

使用递归求字符串的长度

def recursiveLength(testVariable) : 
	# Write your code here
	if testVariable == '':
		return 0
	else:
		return 1 + recursiveLength(testVariable[1:])

使用递归计算字符串中所有数字的和

def sumDigits(testVariable):
  # Write your code here
  # base case
  if testVariable == '': return 0
  else:
    return int(testVariable[0]) + sumDigits(testVariable[1:])

使用递归判断字符转是否为回文

def isPalindrome(testVariable) :
  # Write your code here
  if len(testVariable)<=1:
    return True
  else:
    if testVariable[0] == testVariable[-1]:
      return isPalindrome(testVariable[1:len(testVariable)-1])
    else: return False