weixin_45405128的博客

# Definition for a binary tree node.# class TreeNode:# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclass S...

class Solution: def largestRectangleArea(self, heights: List[int]) -> int: stack = [(0, -1)]#dummy variable, (0.-1) o represens dummy initial height, -1 represents dummy intial positio...

https://www.youtube.com/watch?v=MiqoA-yF-0Mclass Solution: def minDistance(self, word1: str, word2: str) -> int: if word1==word2: return 0 dp=[] n=len(w...

class Solution: def change(self, amount: int, coins: List[int]) -> int: m=len(coins)+1 n=amount+1 dp=[[0]*n for i in range(m)] dp[0][0]=1 for i in range...

题目：A 国的手机号码由且仅由 N 位十进制数字(0-9)组成。一个手机号码中有至少 K 位数字相同则被定义为靓号。A 国的手机号可以有前导零，比如 000123456 是一个合法的手机号。小多想花钱将自己的手机号码修改为一个靓号。修改号码中的一个数字需要花费的金额为新数字与旧数字之间的差值。比如将 1 修改为 6 或 6 修改为 1 都需要花 5 块钱。给出小多现在的手机号码，问将其修...

题目：n个长度为m的字符串，每个字符串由m个大写字母组成。任选第i和第j个字符串，并交换长度为k的前缀，可以在交换后的基础上进行任意次这样的操作。请问一共可以生成多少个不同的字符串，包括原串本身。样例输入：2 3ABCDEF输出：8暴力求解line1=list(map(int,input().split()))n,m=line1[0],line1[1]li...

Function compile()# Module Regular Expression is imported using __import__(). import re # compile() creates regular expression character class [a-e], # which is equivalent to [abcde]. # class ...

while True: try: s=str(input()) if len(s)==8: print(s) elif len(s)<8: while len(s)<8: s=s+'0' print(s) ...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the primality function below.def primality(n): if n==1: return 'Not prime' if n==2: retur...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the flippingBits function below.def flippingBits(n): li=[0]*33 for i in range(1,33): n=n-2**(33...

""" Node is defined asclass node: def __init__(self, data): self.data = data self.left = None self.right = None"""def checknode(node,min,max): if node == None: ...

def reverse(head): left=None right=head while right: tmp=right.next #先保存下一个 right.next=left #换顺序 left=right #进1 right=tmp #进1 return left...

#!/bin/python3import mathimport osimport randomimport reimport sysclass DoublyLinkedListNode: def __init__(self, node_data): self.data = node_data self.next = None ...

#!/bin/python3import mathimport osimport randomimport reimport sysclass SinglyLinkedListNode: def __init__(self, node_data): self.data = node_data self.next = Noneclass ...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the maxSubsetSum function below.def maxSubsetSum(arr): n=len(arr) v = [0] * n for i in range(n): ...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the whatFlavors function below.#naive waydef whatFlavors0(cost, money): n=len(cost) #li=[] for i in ...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the stepPerms function below.def stepPerms0(n): if n==1: return 1 if n==2: return 2 ...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the maxMin function below.def maxMin(k, arr): s=sorted(arr) li=[] for i in range(len(s)-k+1): ...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the getMinimumCost function below.#my own solutiondef getMinimumCost0(k, c): if k>=len(c): retu...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the luckBalance function below.def luckBalance0(k, contests): print(contests) imp=[] score=0 fo...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the minimumAbsoluteDifference function below.def minimumAbsoluteDifference(arr): s=sorted(arr) diff=s[-...

#!/bin/python3'''import mathimport osimport randomimport reimport sys# Complete the countTriplets function below.#naive waydef countTriplets0(arr, r): s=sorted(arr) count=0 n=le...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the freqQuery function below.from collections import defaultdictdef freqQuery(queries): data=defaultdict(...

class Node: def __init__(self, info): self.info = info self.left = None self.right = None self.level = None def __str__(self): return str(sel...

class Node: def __init__(self, info): self.info = info self.left = None self.right = None self.level = None def __str__(self): return str(sel...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the checkMagazine function below.from collections import defaultdictdef checkMagazine(magazine, note): z...

import mathimport osimport randomimport reimport sys# Complete the sherlockAndAnagrams function below.from collections import defaultdictdef get_all_substrings(s):#先提出所有的子集 n=len(s)...

#!/bin/python3'''import mathimport osimport randomimport reimport sys# Complete the activityNotifications function below.#runtime error for some casesdef activityNotifications(expenditure...

1. bisect(list, num, beg, end):- This function returns thepositionin thesortedlist, where the number passed in argument can be placed so as tomaintain the resultant list in sorted order. If the ...

Sample Input5amy 100david 100heraldo 50aakansha 75aleksa 150Sample Outputaleksa 150amy 100david 100aakansha 75heraldo 50from functools import cmp_to_keyclass Player: de...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the maximumToys function below.def maximumToys(prices, k): p=sorted(prices) ####直接用sorted(),如果用自己写的算法，runti...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the countSwaps function below.def countSwaps(a): count=0 for i in range(n): for j in range(n-1-i)...

#!/bin/python3import mathimport osimport randomimport reimport sys'''# Complete the substrCount function below.def substrCount(n, s): #每个单独字符 result=n #连续两个，三个,,,n个字符相同 f...

#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the isValid function below.def isValid(s): zd={} for c in s: if c not in zd.keys(): ...

Method 1: Using Python set:listChar = ['z','z','z','z'] if(len(set(listChar))==1): print "All elements in list are same"else: print "All elements in list are not same"Method 2: Using Pytho...

Shashank非常喜欢字符串，特别是那些连续字符都是不一样的字符串。比如：他喜欢,但他不喜欢。给定一个字符串，该字符串只可能由字母和组成。Shashank想把这个字符串转变成他喜欢的字符串，在转变的过程中，他允许删除字符串中的某些字符。 你的任务就是找出最少需要删除几个字符，才能把给定的字符串转变成Shashank喜欢的字符串。样例输入：5AAAABBBBBABABABABBA...

Alice is taking a cryptography class and findinganagramsto be very useful. We consider two strings to be anagrams of each other if the first string's letters can be rearranged to form the second str...

Multiple Regression in Pythonfrom sklearn import linear_modelx = [[5, 7], [6, 6], [7, 4], [8, 5], [9, 6]]y = [10, 20, 60, 40, 50]lm = linear_model.LinearRegression()lm.fit(x, y)a = lm.interc...

# This Python program must be run with # Python 3 as it won't work with 2.7. # ends the output with a <space> print("Welcome to" , end = ' ') print("GeeksforGeeks", end = ' ') Welcome ...

# Python code to demonstrate the working of # zip() # initializing lists name = [ "Manjeet", "Nikhil", "Shambhavi", "Astha" ] roll_no = [ 4, 1, 3, 2 ] marks = [ 40, 50, 60, 70 ] # using zip()...