miahhrgbfcyur的博客

import numpy as npimport matplotlib.pyplot as plt# 两点距离def distance(e1, e2): return np.sqrt((e1[0]-e2[0])**2+(e1[1]-e2[1])**2)# 集合中心def means(arr): return np.array([np.mean([e[0] for e in arr]), np.mean([e[1] for e in arr])])# arr中距离a最远的元素

import requestsdef re(): url = 'http://shuyantech.com/api/entitylinking/cutsegment?q=' word = '打球的李娜和唱歌的李娜不是同一个人' url = url + word r = requests.get(url) print(r.text)if __name__ == "__main__": count = 0 while(True):

https://www.xz577.com/j/129.html

https://www.jianshu.com/p/c70474e1db0a

leal和mov的用法：https://blog.csdn.net/farmwang/article/details/75103220

题目要求：https://leetcode-cn.com/problems/smallest-string-with-swaps/class Solution: def smallestStringWithSwaps(self, s: str, pairs: List[List[int]]) -> str: p = {i:i for i in range(len(...

题目要求：https://leetcode-cn.com/problems/number-of-islands/class Solution: def numIslands(self, grid: List[List[str]]) -> int: if not grid: return 0 row = len(grid) col =...

题目要求：https://leetcode-cn.com/problems/surrounded-regions/class Solution: def solve(self, board: List[List[str]]) -> None: """ Do not return anything, modify board in-place ins...

class Solution: def longestConsecutive(self, nums: List[int]) -> int: if not nums: return 0 nums.sort() longest_streak = 1 current_streak = 1 ...

题目要求：https://leetcode-cn.com/problems/divisor-game/思路：如果N是奇数，因为奇数的所有因数都是奇数，因此 N 进行一次 N-x 的操作结果一定是偶数，所以如果 a 拿到了一个奇数，那么轮到 b 的时候，b拿到的肯定是偶数，这个时候 b 只要进行 -1， 还给 a 一个奇数，那么这样子b就会一直拿到偶数，到最后b一定会拿到最小偶数2，a就输了。...

conda install plotly

题目要求：https://leetcode-cn.com/problems/min-cost-climbing-stairs/class Solution: def minCostClimbingStairs(self, cost: List[int]) -> int: if len(cost) == 0: return 0 ...

a_list.index(‘a’) //返回a在列表中每一次出现的位置，默认搜索整个列表a_list.index(‘a’,0,3) //返回a在指定切片内第一次出现的位置题目要求：https://leetcode-cn.com/problems/is-subsequence/class Solution: def isSubsequence(self, s: str, t: str...

https://blog.csdn.net/Acecai01/article/details/80248139

Result_final_1 : 第一行result_final_2: 第二行(下同）result_3: 第3到10行result_4: 第11到20 行result_5 ：第21到30行result_6: 31-407: 41-508: 51-60

https://blog.csdn.net/wsLJQian/article/details/81210867

= 0： 灰度图0：三通道彩色图<0:原图，带alpha通道

import cv2import numpy as npimg1 = cv2.imread('left.png',1)img1 = cv2.resize(img1, (797,1212))dst1 = cv2.cvtColor(img1,cv2.COLOR_BGR2GRAY)cv2.imwrite('l.png',dst1)img1 = cv2.imread('left.png',1...

import cv2import numpy as npimport csvimport pandas as pdl = []lena = cv2.imread('shicha.png',0) # 读取和代码处于同一目录下的 lena.pngfor i in range(0, 797): for j in range(0, 1212): if lena[i, ...

法一：f = open("result_final_7.txt","r") #设置文件对象for i in range(5): print(f.readline().strip())

题目要求：https://leetcode-cn.com/problems/range-sum-query-immutable/class NumArray: def __init__(self, nums: List[int]): self.dp = nums[:] # self.dp[i]存储0~i的子序列和 fo...

题目要求：https://leetcode-cn.com/problems/house-robber/class Solution: def rob(self, nums: List[int]) -> int: if not nums: return 0 if len(nums) == 1: retu...

题目要求：https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/class Solution: def maxProfit(self, prices: List[int]) -> int: if not prices: return 0 dp = [...

题目要求：https://leetcode-cn.com/problems/climbing-stairs/class Solution: def climbStairs(self, n: int) -> int: if n == 1: return 1 if n == 2: return 2 ...

题目要求：https://leetcode-cn.com/problems/maximum-subarray/弄一个数组，dp[i]存到当前位置结束时最大的前缀和。class Solution: def maxSubArray(self, nums: List[int]) -> int: if not nums: return 0 ...

题目要求：https://leetcode-cn.com/problems/count-of-smaller-numbers-after-self/python列表insert的操作：https://www.iplaypy.com/jinjie/list-insert.htmlpython内置函数binect的用法：https://www.cnblogs.com/skydesign/ar...

题目要求：https://leetcode-cn.com/problems/largest-number/python中map函数的用法：https://www.runoob.com/python/python-func-map.htmlpython中lstrip和rstrip的用法：https://blog.csdn.net/csdn15698845876/article/detail...

题目要求：https://leetcode-cn.com/problems/reverse-words-in-a-string/split()当不带参数时以空格进行分割（不管几个空格全部砍掉），当代参数时，以该参数进行分割。python 字符串（str）和列表（list）的互相转换：https://blog.csdn.net/roytao2/article/details/534333...

题目要求：https://leetcode-cn.com/problems/maximum-length-of-pair-chain/思路：很简单的贪心class Solution: def findLongestChain(self, pairs: List[List[int]]) -> int: pairs.sort(key=lambda x: x[1])...

题目要求：https://leetcode-cn.com/problems/different-ways-to-add-parentheses/思路：分治法，递归def diffWaysToCompute(input): # 如果只有数字，直接返回 if input.isdigit(): return [int(input)] ...

coefficient

题目要求：https://leetcode-cn.com/problems/trapping-rain-water/看到的一个大佬思路，实在是太有意思了！class Solution(object): def trap(self, height): """ :type height: List[int] :rtype: int ...

题目要求：https://leetcode-cn.com/problems/jump-game-ii/

题目要求：https://leetcode-cn.com/problems/rotate-list/

题目要求：https://leetcode-cn.com/problems/minimum-window-substring/思路：滑动窗口

题目要求：https://leetcode-cn.com/problems/search-in-rotated-sorted-array-ii/

题目要求：https://leetcode-cn.com/problems/maximal-rectangle/思路：https://blog.csdn.net/u014626513/article/details/81381948

题目要求：https://leetcode-cn.com/problems/largest-rectangle-in-histogram/思路：https://blog.csdn.net/qq_17550379/article/details/85093224

题目要求：https://leetcode-cn.com/problems/valid-number/

题目要求：https://leetcode-cn.com/problems/unique-binary-search-trees-ii/comments/