字符移動(dòng)函數(shù)題目及答案

字符移動(dòng)函數(shù)題目及答案字符移動(dòng)函數(shù)是一種常見的編程任務(wù)，用于在字符串中移動(dòng)字符的位置。以下是一些關(guān)于字符移動(dòng)函數(shù)的題目及答案。題目1：字符串反轉(zhuǎn)題目描述：編寫一個(gè)函數(shù)，實(shí)現(xiàn)字符串的反轉(zhuǎn)。輸入：一個(gè)字符串`s`。輸出：反轉(zhuǎn)后的字符串。示例：輸入：`"hello"`輸出：`"olleh"`答案：```pythondefreverse_string(s):returns[::-1]測(cè)試print(reverse_string("hello"))輸出:"olleh"```題目2：旋轉(zhuǎn)字符串題目描述：給定一個(gè)字符串`s`和一個(gè)整數(shù)`k`，請(qǐng)將字符串`s`向右旋轉(zhuǎn)`k`個(gè)位置。輸入：字符串`s`和整數(shù)`k`。輸出：旋轉(zhuǎn)后的字符串。示例：輸入：`s="hello"`,`k=2`輸出：`"llohe"`答案：```pythondefrotate_string(s,k):n=len(s)k=k%n防止k大于字符串長(zhǎng)度returns[-k:]+s[:-k]測(cè)試print(rotate_string("hello",2))輸出:"llohe"```題目3：字符串的K個(gè)字符題目描述：給定兩個(gè)字符串`s1`和`s2`，以及一個(gè)整數(shù)`k`，從`s1`中找到`k`個(gè)字符，使得這些字符與`s2`中的字符不重復(fù)，返回這些字符。輸入：字符串`s1`和`s2`，整數(shù)`k`。輸出：從`s1`中找到的`k`個(gè)不重復(fù)字符。示例：輸入：`s1="abcde"`,`s2="aeee"`,`k=2`輸出：`"bc"`答案：```pythondeffind_kth_non_duplicated(s1,s2,k):fromcollectionsimportCountercounter=Counter(s2)result=[]forcharins1:ifcharnotincounterorcounter[char]==0:result.append(char)counter[char]=counter.get(char,0)-1iflen(result)==k:return"".join(result)測(cè)試print(find_kth_non_duplicated("abcde","aeee",2))輸出:"bc"```題目4：最小窗口子串題目描述：給定兩個(gè)字符串`s`和`t`，返回`s`中涵蓋`t`所有字符的最小子串。輸入：字符串`s`和`t`。輸出：`s`中的最小窗口子串。示例：輸入：`s="ADOBECODEBANC"`,`t="ABC"`輸出：`"BANC"`答案：```pythondefmin_window(s,t):fromcollectionsimportdefaultdictifnotsornott:return""counter_t=defaultdict(int)forcharint:counter_t[char]+=1required=len(counter_t)counter_s=defaultdict(int)left,right,count,min_len=0,0,0,float("inf")min_window=""whileright<len(s):char=s[right]counter_s[char]+=1ifcharincounter_tandcounter_s[char]==counter_t[char]:count+=1whilecount==requiredandleft<=right:ifright-left+1<min_len:min_len=right-left+1min_window=s[left:right+1]char=s[left]counter_s[char]-=1ifcharincounter_tandcounter_s[char]<counter_t[char]:count-=1left+=1right+=1returnmin_window測(cè)試print(min_window("ADOBECODEBANC","ABC"))輸出:"BANC"```題目5：字符串的排列題目描述：給定兩個(gè)字符串`s1`和`s2`，判斷`s2`是否包含`s1`的排列。輸入：字符串`s1`和`s2`。輸出：如果`s2`包含`s1`的排列，返回`True`；否則返回`False`。示例：輸入：`s1="ab"`,`s2="eidbaooo"`輸出：`True`答案：```pythondefcheck_inclusion(s1,s2):fromcollectionsimportCounteriflen(s2)<len(s1):returnFalsecount_s1=Counter(s1)count_s2=Counter(s2[:len(s1)])ifcount_s1==count_s2:returnTrueforiinrange(len(s1),len(s2)):out_char=s2[i-len(s1)]in_char=s2[i]count_s2[out_char]-=1ifcount_s2[out_char]==0:delcount_s2[out_char]count_s2[in_char]+=1ifcount_s1==count_s2: