日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問(wèn) 生活随笔!

生活随笔

當(dāng)前位置: 首頁(yè) > 编程语言 > python >内容正文

python

LeetCode1079题:活字印刷——Python递归与迭代解法

發(fā)布時(shí)間:2024/3/12 python 24 豆豆
生活随笔 收集整理的這篇文章主要介紹了 LeetCode1079题:活字印刷——Python递归与迭代解法 小編覺(jué)得挺不錯(cuò)的,現(xiàn)在分享給大家,幫大家做個(gè)參考.

1. LeetCode1079題:活字印刷

你有一套活字字模 tiles,其中每個(gè)字模上都刻有一個(gè)字母 tiles[i]。返回你可以印出的非空字母序列的數(shù)目。

注意:本題中,每個(gè)活字字模只能使用一次。

示例 1:
輸入:“AAB”
輸出:8
解釋:可能的序列為 “A”, “B”, “AA”, “AB”, “BA”, “AAB”, “ABA”, “BAA”。

示例 2:
輸入:“AAABBC”
輸出:188

提示:
1 <= tiles.length <= 7
tiles 由大寫(xiě)英文字母組成

2. 求字母序列數(shù)目的Python代碼

2.1 遞歸
def numTilePossibilities(tiles):result = 0for i in set(tiles):result += 1 + numTilePossibilities(tiles.replace(i, '', 1))return resultprint(numTilePossibilities('AAB')) print(numTilePossibilities('AABC')) print(numTilePossibilities('AAABBC'))

實(shí)驗(yàn)結(jié)果:
8
34
188

代碼解讀:
函數(shù)numTilePossibilities是一個(gè)遞歸函數(shù),參數(shù)tiles代表活字字模上的字母組成的字符串,返回值result代表使用tiles中的字母能夠排列出多少種字符串。

遞歸子問(wèn)題:從tiles中拿出1個(gè)字母i后,使用剩余字母能夠排列出多少種字符串。該問(wèn)題在代碼中表達(dá)為:numTilePossibilities(tiles.replace(i, '', 1))。

若剩余字母排列出的字符串都加一個(gè)前綴i,即可得到一批新的字符串。由此可得,以字母i為前綴的字符串(包括字母i本身)共有1 + numTilePossibilities(tiles.replace(i, '', 1))種。

通過(guò)for i in set(tiles):遍歷tiles去重后的字母集合,并使用result累計(jì)以不同字母為前綴的字符串的總數(shù)。

2.2 迭代
def numTilePossibilities(tiles):result = 0stack = [tiles]while stack:tiles = stack.pop()for i in set(tiles):result += 1stack.append(tiles.replace(i, '', 1))return resultprint(numTilePossibilities('AAB')) print(numTilePossibilities('AABC')) print(numTilePossibilities('AAABBC'))

實(shí)驗(yàn)結(jié)果:
8
34
188

3. 求字母序列的Python代碼

3.1 遞歸

遞歸代碼對(duì)解空間樹(shù)的搜索是深度優(yōu)先搜索(depth first search, dfs)。

def numTilePossibilities(tiles):result = []def dfs(tiles, prefix):for i in sorted(set(tiles)):result.append(prefix+i)dfs(tiles.replace(i, '', 1), prefix+i)dfs(tiles, '')return resultprint(numTilePossibilities('AAB')) print(numTilePossibilities('AABC'))

實(shí)驗(yàn)結(jié)果:
[‘A’, ‘AA’, ‘AAB’, ‘AB’, ‘ABA’, ‘B’, ‘BA’, ‘BAA’]
[‘A’, ‘AA’, ‘AAB’, ‘AABC’, ‘AAC’, ‘AACB’, ‘AB’, ‘ABA’, ‘ABAC’, ‘ABC’, ‘ABCA’, ‘AC’, ‘ACA’, ‘ACAB’, ‘ACB’, ‘ACBA’, ‘B’, ‘BA’, ‘BAA’, ‘BAAC’, ‘BAC’, ‘BACA’, ‘BC’, ‘BCA’, ‘BCAA’, ‘C’, ‘CA’, ‘CAA’, ‘CAAB’, ‘CAB’, ‘CABA’, ‘CB’, ‘CBA’, ‘CBAA’]

3.2 迭代(棧,深度優(yōu)先搜索)

本迭代代碼通過(guò)實(shí)現(xiàn)了對(duì)解空間樹(shù)的深度優(yōu)先搜索

def numTilePossibilities(tiles):result = []stack = [(tiles, '')]while stack:tiles, prefix = stack.pop()result.append(prefix)for i in sorted(set(tiles), reverse=True):stack.append((tiles.replace(i, '', 1), prefix+i))return result[1:]print(numTilePossibilities('AAB')) print(numTilePossibilities('AABC'))

實(shí)驗(yàn)結(jié)果:
[‘A’, ‘AA’, ‘AAB’, ‘AB’, ‘ABA’, ‘B’, ‘BA’, ‘BAA’]
[‘A’, ‘AA’, ‘AAB’, ‘AABC’, ‘AAC’, ‘AACB’, ‘AB’, ‘ABA’, ‘ABAC’, ‘ABC’, ‘ABCA’, ‘AC’, ‘ACA’, ‘ACAB’, ‘ACB’, ‘ACBA’, ‘B’, ‘BA’, ‘BAA’, ‘BAAC’, ‘BAC’, ‘BACA’, ‘BC’, ‘BCA’, ‘BCAA’, ‘C’, ‘CA’, ‘CAA’, ‘CAAB’, ‘CAB’, ‘CABA’, ‘CB’, ‘CBA’, ‘CBAA’]

3.3 迭代(棧)
def numTilePossibilities(tiles):result = []stack = [(tiles, '')]while stack:tiles, prefix = stack.pop()for i in sorted(set(tiles)):result.append(prefix+i)stack.append((tiles.replace(i, '', 1), prefix+i))return resultprint(numTilePossibilities('AAB')) print(numTilePossibilities('AABC'))

實(shí)驗(yàn)結(jié)果:
[‘A’, ‘B’, ‘BA’, ‘BAA’, ‘AA’, ‘AB’, ‘ABA’, ‘AAB’]
[‘A’, ‘B’, ‘C’, ‘CA’, ‘CB’, ‘CBA’, ‘CBAA’, ‘CAA’, ‘CAB’, ‘CABA’, ‘CAAB’, ‘BA’, ‘BC’, ‘BCA’, ‘BCAA’, ‘BAA’, ‘BAC’, ‘BACA’, ‘BAAC’, ‘AA’, ‘AB’, ‘AC’, ‘ACA’, ‘ACB’, ‘ACBA’, ‘ACAB’, ‘ABA’, ‘ABC’, ‘ABCA’, ‘ABAC’, ‘AAB’, ‘AAC’, ‘AACB’, ‘AABC’]

3.4 迭代(隊(duì)列)

本迭代代碼通過(guò)隊(duì)列實(shí)現(xiàn)了對(duì)解空間樹(shù)的廣度優(yōu)先搜索(breadth first search, bfs)。

def numTilePossibilities(tiles):result = []queue = [(tiles, '')]while queue:tiles, prefix = queue.pop(0)for i in sorted(set(tiles)):result.append(prefix+i)queue.append((tiles.replace(i, '', 1), prefix+i))return resultprint(numTilePossibilities('AAB')) print(numTilePossibilities('AABC'))

實(shí)驗(yàn)結(jié)果:
[‘A’, ‘B’, ‘AA’, ‘AB’, ‘BA’, ‘AAB’, ‘ABA’, ‘BAA’]
[‘A’, ‘B’, ‘C’, ‘AA’, ‘AB’, ‘AC’, ‘BA’, ‘BC’, ‘CA’, ‘CB’, ‘AAB’, ‘AAC’, ‘ABA’, ‘ABC’, ‘ACA’, ‘ACB’, ‘BAA’, ‘BAC’, ‘BCA’, ‘CAA’, ‘CAB’, ‘CBA’, ‘AABC’, ‘AACB’, ‘ABAC’, ‘ABCA’, ‘ACAB’, ‘ACBA’, ‘BAAC’, ‘BACA’, ‘BCAA’, ‘CAAB’, ‘CABA’, ‘CBAA’]

總結(jié)

以上是生活随笔為你收集整理的LeetCode1079题:活字印刷——Python递归与迭代解法的全部?jī)?nèi)容,希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò),歡迎將生活随笔推薦給好友。