python如何从字符串中筛选出包含词最多的那个字符串呢！ Python新手求助，如何查找一个包含指定字符的字符串
\u5982\u4f55\u7528python\u627e\u51fa\u5b57\u7b26\u4e32\u4e2d\u51fa\u73b0\u6700\u591a\u7684\u5b57\u7b26for index in range\uff08len\uff08inputstr\uff09\uff09\uff1a
if inputstr [index] in dict:
Dict[inputstr[index]] +=1
Else:
Dict[inputstr[index]] =1
\u7136\u540e\u5bf9\u8fd9\u4e2a\u5b57\u5178\u7528key\u6392\u5e8f\u5c31\u51fa\u6765\u4e86\u3002
sorted(dict.items(),key = lambda x:x[1],reverse = True)
\u7b2c\u4e00\u4e2a\u5c31\u662f\u4e86\u3002
l = ['132','135','141','121','241377','1111322']for i in l: if i[:2] == '13': print i
代码如下，仅供参考：
text = """
abcdefg
abcmndy
abcynis
"""
# 需要检测的词
word = ['a', 'b', 'c', 'm', 'n', 'y']
text = text.strip().splitlines()
count = []
for i in text:
x = list(map(i.count, word))
count.append(sum(x))
maxWord = count.index(max(count))
print("包检测词最多的字符串是:{0} 有{1}个".format(text[maxWord], count[maxWord]))
输出：
绛旓細棣栧厛鎴戜滑鍏堟潵鐪嬩竴涓嬪浣曟煡鎵句竴涓瓧绗︿覆涓槸鍚︽湁鏌愬瓧姣嶏紝鐢╢ind鍑芥暟鍗冲彲锛屽涓嬪浘鎵绀猴紝浼氳繑鍥炲瓧姣嶇殑浣嶇疆 find鍑芥暟杩樺彲浠ユ寚瀹氫粠鍝釜鍦版柟杩涜鏌ユ壘锛屽涓嬪浘鎵绀猴紝鏍囪瘑浠庝綅缃1澶勫紑濮嬫煡鎵 瀵逛簬find涓病鎵惧埌鐨勫畠浼氳繑鍥炰竴涓-1锛屽涓嬪浘鎵绀 闄や簡find鍑芥暟杩樻湁涓涓猧ndex鍑芥暟锛屽涓嬪浘鎵绀猴紝鐢ㄦ硶鍜宖ind宸笉澶 涓嶄竴...
绛旓細print(a)
绛旓細鏂规硶涓锛氫娇鐢ㄥ瓧绗︿覆鐨勭储寮銆侾ython涓殑瀛楃涓插彲浠ラ氳繃绱㈠紩鐩存帴璁块棶鐗瑰畾鐨勫瓧绗︺傜储寮曚粠0寮濮嬨備緥濡傦紝瑕佷粠瀛楃涓蹭腑鎻愬彇绗3涓瓧绗︼紝鍙互浣跨敤瀛楃涓插彉閲忓悕鍚庣殑绱㈠紩鍊糩2]锛屽洜涓篜ython鐨勭储寮曟槸浠0寮濮嬬殑銆傛柟娉曚簩锛氫娇鐢ㄥ瓧绗︿覆鐨刦ind鏂规硶銆傝鏂规硶鍙互鏌ユ壘鎸囧畾瀛楃鎴栧瓙瀛楃涓插湪瀛楃涓蹭腑鐨勪綅缃紝骞惰繑鍥炲叾璧峰绱㈠紩銆...
绛旓細text = """abcdefgabcmndyabcynis"""# 闇瑕佹娴嬬殑璇峸ord = ['a', 'b', 'c', 'm', 'n', 'y']text = text.strip().splitlines()count = []for i in text:x = list(map(i.count, word))count.append(sum(x))maxWord = count.index(max(count))print("鍖呮娴嬭瘝鏈澶氱殑瀛楃...
绛旓細import rea = input('input your string:\n')at = re.sub('[^\d\+]', '', a)try: print('result:{}={}'.format(at, eval(at)))except: print('result: error')
绛旓細search()鍜宮atch()锛岀敤璧锋潵鏇寸伒娲 import re str = "Welcome to my world. I have 12 apples."if re.search(r"world", str).group() != "" :print("match! ")str = "abcABC"if re.match(r"[a-zA-Z]+", str):print("match! ", re.search(r"[A-Z]+", str).group())el...
绛旓細1. isalpha鍑芥暟浠嬬粛锛歩salpha鏄Python涓鐨勪竴涓瓧绗︿覆鏂规硶锛岀敤浜庢鏌ュ瓧绗︿覆鏄惁鍙寘鍚瓧姣嶃傚鏋瀛楃涓蹭腑鍖呭惈闈炲瓧姣嶅瓧绗︼紝鍒欒繑鍥濬alse锛涘鏋滃瓧绗︿覆涓彧鍖呭惈瀛楁瘝锛屽垯杩斿洖True銆2. 鍒ゆ柇瀛楃涓蹭腑鏄惁鍖呭惈瀛楁瘝鐨勬濊矾锛氳鍒ゆ柇瀛楃涓蹭腑鏄惁鍖呭惈瀛楁瘝锛屽彲浠ラ亶鍘嗗瓧绗︿覆涓殑姣忎釜瀛楃锛屽姣忎釜瀛楃璋冪敤isalpha鍑芥暟杩涜妫鏌ャ
绛旓細if index == -1:break count += 1 s = s[index+len(c):]return count def g(s, c):cs = ""while True:cs += c count = f(s, cs)if count > 0:print count, cs else:break a="123456789011112221111111122211111111"g(a, "1")缁撴灉:21 1 10 11 5 111 5 1111 2 11111 2 ...
绛旓細鏂规硶涓锛氬熀纭瀛楀吀娉曪紙鍥涜浠ｇ爜锛夐鍏堬紝鎴戜滑浠庡熀纭寮濮嬶紝浣跨敤瀛楀吀鏉ュ瓨鍌ㄥ瓧绗﹀強鍏跺嚭鐜版鏁帮細```pythonL = input() # 杈撳叆涓涓瀛楃涓counts = {} # 鍒濆鍖栦竴涓┖瀛楀吀for word in L: if word in counts: counts[word] += 1 else: counts[word] = 1for i, count in counts.it...
绛旓細def findstr(rlist, onestr): found = [] for element in rlist: if onestr in element: found.append(element) return found 鍙傛暟rlist灏辨槸浣犵殑[132,135,xxx], onestr灏辨槸13.
