\u6570\u503c\u7684\u6574\u6570\u6b21\u65b9<\/p>\n<\/li>\n
\u6574\u6570\u4e2d1\u51fa\u73b0\u7684\u6b21\u6570（\u6574\u6570\u7684\u8303\u56f4\u4e3a1～n）<\/p>\n<\/li>\n
\u4e11\u6570<\/p>\n<\/li>\n
\u548c\u4e3aS\u7684\u8fde\u7eed\u6b63\u6570\u5e8f\u5217(\u6ed1\u52a8\u7a97\u53e3\u601d\u60f3)<\/p>\n<\/li>\n
\u548c\u4e3aS\u7684\u4e24\u4e2a\u6570\u5b57(\u53cc\u6307\u9488\u601d\u60f3)<\/p>\n<\/li>\n
\u6784\u5efa\u4e58\u79ef\u6570\u7ec4<\/p>\n<\/li>\n
\u6570\u636e\u6d41\u4e2d\u7684\u4e2d\u4f4d\u6570<\/p>\n<\/li>\n
\u6251\u514b\u724c\u987a\u5b50<\/p>\n<\/li>\n
\u9898\u76ee\u63cf\u8ff0：\u7ed9\u5b9a\u4e00\u4e2adouble\u7c7b\u578b\u7684\u6d6e\u70b9\u6570base\u548cint\u7c7b\u578b\u7684\u6574\u6570exponent，\u6c42base\u7684exponent\u6b21\u65b9\u3002\u4fdd\u8bc1base\u548cexponent\u4e0d\u540c\u65f6\u4e3a0\u3002<\/p>\n
\u601d\u8def：\u5224\u65adexponent\u7684\u5947\u5076\u6027\u3002\u76f8\u6bd4\u4e8e\u76f4\u63a5\u6309\u7167\u5faa\u73af\u6b21\u6570，\u76f8\u4e58exponent\u6b21，\u91c7\u7528res*=res\u7684\u65b9\u5f0f\u53ef\u4ee5\u5b9e\u73b0O(logn)\u6b21\u7684\u76f8\u4e58\u3002<\/p>\n
# -*- coding:utf-8 -*-
\nclass Solution:
\n def Power(self, base, exponent):
\n # write code here
\n res=base
\n flag=1
\n if exponent<0:
\n exponent*=-1
\n flag=-1
\n elif exponent==0:
\n return 1
\n while True:
\n if exponent%2==1:
\n if exponent==1:
\n res*=base
\n break
\n res*=res
\n exponent=exponent\/\/2
\n else:
\n if exponent==1:
\n res=res
\n break
\n res*=res
\n exponent=exponent\/\/2
\n return res if flag==1 else 1\/res<\/p>\n
\u9898\u76ee\u63cf\u8ff0：\u6c42\u51fa1~13\u7684\u6574\u6570\u4e2d1\u51fa\u73b0\u7684\u6b21\u6570,\u5e76\u7b97\u51fa100~1300\u7684\u6574\u6570\u4e2d1\u51fa\u73b0\u7684\u6b21\u6570？\u4e3a\u6b64\u4ed6\u7279\u522b\u6570\u4e86\u4e00\u4e0b1~13\u4e2d\u5305\u542b1\u7684\u6570\u5b57\u67091\u300110\u300111\u300112\u300113\u56e0\u6b64\u5171\u51fa\u73b06\u6b21,\u4f46\u662f\u5bf9\u4e8e\u540e\u9762\u95ee\u9898\u4ed6\u5c31\u6ca1\u8f99\u4e86\u3002ACMer\u5e0c\u671b\u4f60\u4eec\u5e2e\u5e2e\u4ed6,\u5e76\u628a\u95ee\u9898\u66f4\u52a0\u666e\u904d\u5316,\u53ef\u4ee5\u5f88\u5feb\u7684\u6c42\u51fa\u4efb\u610f\u975e\u8d1f\u6574\u6570\u533a\u95f4\u4e2d1\u51fa\u73b0\u7684\u6b21\u6570（\u4ece1 \u5230 n \u4e2d1\u51fa\u73b0\u7684\u6b21\u6570）\u3002<\/p>\n
\u601d\u8def：\u9010\u4e2a\u627e\u5230\u6570\u5b57\u6240\u5305\u542b\u76841\u7684\u4e2a\u6570\u3002<\/p>\n
# -*- coding:utf-8 -*-
\nclass Solution:
\n def NumberOf1Between1AndN_Solution(self, n):
\n # write code here
\n """
\n \u65b9\u6cd51：\u53c2\u8003
\nhttps:\/\/www.nowcoder.com\/profile\/4321749\/codeBookDetail?submissionId=12566515
\n \u7684\u8bb2\u89e3
\n res = 0
\n i = 1 # \u4e2a\u4f4d\u5f00\u59cb
\n while n \/\/ i != 0:
\n high = n\/\/(i*10) # \u9ad8\u4f4d\u6570
\n current = (n\/\/i) % 10 # \u7b2ci\u4f4d\u6570
\n low = n – (n\/\/i) * i # \u4f4e\u4f4d\u6570
\n if current == 0:
\n res += high * i
\n elif current == 1:
\n res += high * i + low + 1
\n else:
\n res += (high+1) * i
\n i *= 10
\n return res
\n """
\n """
\n #\u65b9\u6cd52
\n #\u4ee51~13\u4e3a\u4f8b：
\n res=0
\n tmp=n
\n base=1
\n while tmp:
\n last=tmp%10
\n tmp=tmp\/10
\n #\u52a0\u4e0a\u4e24\u4f4d\u6570\u4e2d\u7684\u53cc11\u7684\u8fd9\u4e00\u79cd\u60c5\u51b5
\n res+=tmp*base
\n #\u52a0\u4e0a\u4e24\u4f4d\u6570\u7684\u5176\u5b83\u60c5\u51b5
\n if last==1:
\n res+=n%base+1
\n #\u52a0\u4e0a\u4e2a\u4f4d\u7684"1"\u8fd9\u4e00\u79cd\u60c5\u51b5
\n elif last>1:
\n res+=base
\n base*=10
\n return res
\n """
\n counts = 0
\n if n < 1: return 0
\n for i in range(1, n+1):
\n num = i
\n while num>0:
\n if num%10 ==1:
\n counts = counts + 1
\n num = num\/10
\n return counts<\/p>\n
\u9898\u76ee\u63cf\u8ff0：\u628a\u53ea\u5305\u542b\u8d28\u56e0\u5b502\u30013\u548c5\u7684\u6570\u79f0\u4f5c\u4e11\u6570（Ugly Number）\u3002\u4f8b\u59826\u30018\u90fd\u662f\u4e11\u6570，\u4f4614\u4e0d\u662f，\u56e0\u4e3a\u5b83\u5305\u542b\u8d28\u56e0\u5b507\u3002 \u4e60\u60ef\u4e0a\u6211\u4eec\u628a1\u5f53\u505a\u662f\u7b2c\u4e00\u4e2a\u4e11\u6570\u3002\u6c42\u6309\u4ece\u5c0f\u5230\u5927\u7684\u987a\u5e8f\u7684\u7b2cN\u4e2a\u4e11\u6570\u3002<\/p>\n
\u601d\u8def：\u4fdd\u8bc1\u76f8\u4e58\u7684\u6570\u4e2d\u53ea\u67092\u30013\u30015，\u800c\u4e14\u662f\u6309\u7167\u7531\u5c0f\u5230\u5927\u7684\u987a\u5e8f\u4e00\u6b21\u5f97\u5230\u4e11\u6570，\u5217\u8868\u4e2d\u7684\u6700\u540e\u4e00\u4e2a\u6570\u503c\u5c31\u662f\u7b2cN\u4e2a\u4e11\u6570\u3002<\/p>\n
# -*- coding:utf-8 -*-
\nclass Solution:
\n def GetUglyNumber_Solution(self, index):
\n # write code here
\n if index <= 1: return index
\n #\u7b2c\u4e00\u4e2a\u4e11\u6570\u662f1
\n res = [1] * index
\n i2, i3, i5 = 0, 0, 0
\n #\u627e\u5230\u7b2c2\u4e2a\u5230\u7b2cindex\u4e2a\u4e11\u6570
\n #\u5728for\u7684\u6bcf\u4e00\u6b21\u5faa\u73af\u4e2d\u80af\u5b9a\u53ef\u4ee5\u627e\u5230\u4e00\u4e2a\u4e11\u6570，\u4e14\u662f\u7531\u5c0f\u5230\u5927\u6700\u5c0f\u7684\u4e00\u4e2a
\n for i in range(1, index):
\n res[i] = min(res[i2]*2, min(res[i3]*3, res[i5]*5))
\n if res[i] == res[i2]*2: i2 += 1
\n if res[i] == res[i3]*3: i3 += 1
\n if res[i] == res[i5]*5: i5 += 1
\n return res[-1]<\/p>\n
\u9898\u76ee\u63cf\u8ff0：\u5c0f\u660e\u5f88\u559c\u6b22\u6570\u5b66,\u6709\u4e00\u5929\u4ed6\u5728\u505a\u6570\u5b66\u4f5c\u4e1a\u65f6,\u8981\u6c42\u8ba1\u7b97\u51fa9~16\u7684\u548c,\u4ed6\u9a6c\u4e0a\u5c31\u5199\u51fa\u4e86\u6b63\u786e\u7b54\u6848\u662f100\u3002\u4f46\u662f\u4ed6\u5e76\u4e0d\u6ee1\u8db3\u4e8e\u6b64,\u4ed6\u5728\u60f3\u7a76\u7adf\u6709\u591a\u5c11\u79cd\u8fde\u7eed\u7684\u6b63\u6570\u5e8f\u5217\u7684\u548c\u4e3a100(\u81f3\u5c11\u5305\u62ec\u4e24\u4e2a\u6570)\u3002\u6ca1\u591a\u4e45,\u4ed6\u5c31\u5f97\u5230\u53e6\u4e00\u7ec4\u8fde\u7eed\u6b63\u6570\u548c\u4e3a100\u7684\u5e8f\u5217:18,19,20,21,22\u3002\u73b0\u5728\u628a\u95ee\u9898\u4ea4\u7ed9\u4f60,\u4f60\u80fd\u4e0d\u80fd\u4e5f\u5f88\u5feb\u7684\u627e\u51fa\u6240\u6709\u548c\u4e3aS\u7684\u8fde\u7eed\u6b63\u6570\u5e8f\u5217? Good Luck!\u8981\u6c42：\u8f93\u51fa\u6240\u6709\u548c\u4e3aS\u7684\u8fde\u7eed\u6b63\u6570\u5e8f\u5217\u3002\u5e8f\u5217\u5185\u6309\u7167\u4ece\u5c0f\u81f3\u5927\u7684\u987a\u5e8f，\u5e8f\u5217\u95f4\u6309\u7167\u5f00\u59cb\u6570\u5b57\u4ece\u5c0f\u5230\u5927\u7684\u987a\u5e8f\u3002 \u601d\u8def：\u6ed1\u52a8\u7a97\u53e3\u5b9e\u73b0，\u6ce8\u610f\u9898\u4e2d\u662f\u8fde\u7eed\u7684\u6b63\u6570\u5e8f\u5217，\u5982\u679c\u662f\u8d1f\u6570\u7684\u8bdd\u5c31\u4e0d\u9002\u5408\u4e86（\u56e0\u4e3a\u4e2d\u95f4\u4f1a\u5220\u9664\u6389\u6700\u5c0f\u7684\u8ff0，\u4f46\u662f\u5bf9\u4e8e\u6709\u8d1f\u6570\u7684\u60c5\u51b5，\u5220\u9664\u8d1f\u6570\u4e4b\u540e\u4f1a\u66f4\u5927\u800c\u975e\u66f4\u5c0f）<\/p>\n
# -*- coding:utf-8 -*-
\nclass Solution:
\n def FindContinuousSequence(self, tsum):
\n # write code here
\n res = []
\n windows = []
\n sum = 0
\n for t in range(1, tsum):
\n windows.append(t)
\n sum += t
\n #\u589e\u52a0\u5927\u7684\u6570\u503c，\u5220\u9664\u5c0f\u7684\u6570\u503c，\u5f97\u5230\u8fde\u7eed\u7684\u6b63\u6570\u5e8f\u5217
\n while sum > tsum:
\n sum -= windows.pop(0)
\n if sum == tsum:
\n res.append(windows[:])
\n return res <\/p>\n
\u9898\u76ee\u63cf\u8ff0：\u8f93\u5165\u4e00\u4e2a\u9012\u589e\u6392\u5e8f\u7684\u6570\u7ec4\u548c\u4e00\u4e2a\u6570\u5b57S，\u5728\u6570\u7ec4\u4e2d\u67e5\u627e\u4e24\u4e2a\u6570，\u4f7f\u5f97\u4ed6\u4eec\u7684\u548c\u6b63\u597d\u662fS，\u5982\u679c\u6709\u591a\u5bf9\u6570\u5b57\u7684\u548c\u7b49\u4e8eS，\u8f93\u51fa\u4e24\u4e2a\u6570\u7684\u4e58\u79ef\u6700\u5c0f\u7684\u3002<\/p>\n
\u601d\u8def：\u548c\u76f4\u63a5\u627e\u5230\u548c\u4e3aS\u7684\u4e24\u4e2a\u6570\u5b57（\u5728Leetcode\u4e2d\u5c31\u6709\u8fd9\u6837\u7684\u9898\u76ee，\u5bf9\u5e94\u4e8e\u5176\u4e2d\u7684\u7b2c1\u9053\u9898）\u4e0d\u540c，\u8fd9\u91cc\u8fd8\u589e\u52a0\u4e86\u9650\u5236\u6761\u4ef6：\u4e58\u79ef\u6700\u5c0f\u3002<\/p>\n
# -*- coding:utf-8 -*-
\nclass Solution:
\n def FindNumbersWithSum(self, array, tsum):
\n # write code here
\n if not array: return []
\n lp = 0
\n rp = len(array) – 1
\n res = [array[-1]] * 2
\n #\u627e\u5230\u6ee1\u8db3\u4e24\u6570\u4e4b\u548c\u7b49\u4e8etmp\u7684\u6570\u7ec4\u7684\u4e0b\u6807lp\u548crp，\u5728\u591a\u7ec4\u4e2d\u627e\u5230\u4e58\u79ef\u6700\u5c0f\u7684\u90a3\u7ec4
\n #\u5982\u679c\u6ca1\u6709\u627e\u5230\u7684\u8bdd，\u8fd4\u56de[]
\n while lp < rp:
\n tmp = array[lp] + array[rp]
\n if tmp > tsum:
\n rp -= 1
\n elif tmp < tsum:
\n lp += 1
\n else:
\n if array[lp] * array[rp] < res[0] * res[1]:
\n res[0], res[1] = array[lp], array[rp]
\n lp += 1
\n rp -= 1
\n return res if res[0] + res[1] == tsum else []<\/p>\n
\u9898\u76ee\u63cf\u8ff0：\u7ed9\u5b9a\u4e00\u4e2a\u6570\u7ec4A[0,1,…,n-1],\u8bf7\u6784\u5efa\u4e00\u4e2a\u6570\u7ec4B[0,1,…,n-1],\u5176\u4e2dB\u4e2d\u7684\u5143\u7d20B[i]=A[0]*A[1]*…*A[i-1]*A[i+1]*…*A[n-1]\u3002\u4e0d\u80fd\u4f7f\u7528\u9664\u6cd5\u3002<\/p>\n
\u601d\u8def：\u5148\u5b8c\u6210A[0]*A[1]*…*A[i-1]\u8fd9\u4e00\u90e8\u5206，\u518d\u5b8c\u6210A[i+1]*…*A[n-1]\u8fd9\u4e00\u90e8\u5206\u3002<\/p>\n
# -*- coding:utf-8 -*-
\nclass Solution:
\n def multiply(self, A):
\n # write code here
\n B = [1] * len(A)
\n temp = 1
\n #\u5148\u5f97\u51faB[n-2]=A[0]*A[1]*…*A[n-3]
\n for i in range(1, len(A)):
\n temp *= A[i-1]
\n B[i] *= temp
\n temp = 1
\n #\u518d\u6c42\u51faB[n-2]=A[0]*A[1]*…*A[n-3]\u00d7A[n-1]
\n #for\u5faa\u73af\u8981\u4ecen-2\u5f00\u59cb，\u4f7f\u5f97\u6570\u7ec4B\u521a\u597d\u6ca1\u6709\u4e0b\u6807\u662fn-2\u7684\u5143\u7d20
\n for i in range(len(A)-2, -1, -1):
\n temp *= A[i+1]
\n B[i] *= temp
\n return B<\/p>\n
\u9898\u76ee\u63cf\u8ff0：\u5982\u4f55\u5f97\u5230\u4e00\u4e2a\u6570\u636e\u6d41\u4e2d\u7684\u4e2d\u4f4d\u6570？\u5982\u679c\u4ece\u6570\u636e\u6d41\u4e2d\u8bfb\u51fa\u5947\u6570\u4e2a\u6570\u503c，\u90a3\u4e48\u4e2d\u4f4d\u6570\u5c31\u662f\u6240\u6709\u6570\u503c\u6392\u5e8f\u4e4b\u540e\u4f4d\u4e8e\u4e2d\u95f4\u7684\u6570\u503c\u3002\u5982\u679c\u4ece\u6570\u636e\u6d41\u4e2d\u8bfb\u51fa\u5076\u6570\u4e2a\u6570\u503c，\u90a3\u4e48\u4e2d\u4f4d\u6570\u5c31\u662f\u6240\u6709\u6570\u503c\u6392\u5e8f\u4e4b\u540e\u4e2d\u95f4\u4e24\u4e2a\u6570\u7684\u5e73\u5747\u503c\u3002\u6211\u4eec\u4f7f\u7528Insert()\u65b9\u6cd5\u8bfb\u53d6\u6570\u636e\u6d41，\u4f7f\u7528GetMedian()\u65b9\u6cd5\u83b7\u53d6\u5f53\u524d\u8bfb\u53d6\u6570\u636e\u7684\u4e2d\u4f4d\u6570\u3002<\/p>\n
\u601d\u8def：\u8fb9\u8bfb\u5165\u6570\u636e\u8fb9\u6392\u5e8f，\u6ce8\u610f\u5947\u5076\u60c5\u51b5\u4e0b\u7684\u7ed3\u679c\u7684\u5dee\u5f02\u3002<\/p>\n
# -*- coding:utf-8 -*-
\nclass Solution:
\n def __init__(self):
\n self.sortedList = []
\n def Insert(self, num):
\n # write code here
\n n = len(self.sortedList)
\n self.sortedList.append(num)
\n #\u7531\u5c0f\u5230\u5927\u6392\u5e8f
\n while n != 0:
\n if self.sortedList[n] < self.sortedList[n-1]:
\n self.sortedList[n], self.sortedList[n-1] = self.sortedList[n-1], self.sortedList[n]
\n else:
\n break
\n n -= 1
\n if n == 0:
\n self.sortedList[n] = num<\/p>\n
def GetMedian(self, x):
\n # write code here
\n n = len(self.sortedList)
\n #\u5947\u5076\u5224\u65ad
\n if n % 2 == 0:
\n return (self.sortedList[n\/\/2]+self.sortedList[n\/\/2-1]) \/ 2.0
\n else:
\n return self.sortedList[n\/\/2]<\/p>\n
\u9898\u76ee\u63cf\u8ff0：LL\u4eca\u5929\u5fc3\u60c5\u7279\u522b\u597d,\u56e0\u4e3a\u4ed6\u53bb\u4e70\u4e86\u4e00\u526f\u6251\u514b\u724c,\u53d1\u73b0\u91cc\u9762\u5c45\u7136\u67092\u4e2a\u5927\u738b,2\u4e2a\u5c0f\u738b(\u4e00\u526f\u724c\u539f\u672c\u662f54\u5f20^_^)…\u4ed6\u968f\u673a\u4ece\u4e2d\u62bd\u51fa\u4e865\u5f20\u724c,\u60f3\u6d4b\u6d4b\u81ea\u5df1\u7684\u624b\u6c14,\u770b\u770b\u80fd\u4e0d\u80fd\u62bd\u5230\u987a\u5b50,\u5982\u679c\u62bd\u5230\u7684\u8bdd,\u4ed6\u51b3\u5b9a\u53bb\u4e70\u4f53\u80b2\u5f69\u7968,\u563f\u563f！！\u201c\u7ea2\u5fc3A,\u9ed1\u68433,\u5c0f\u738b,\u5927\u738b,\u65b9\u72475\u201d,\u201cOh My God!\u201d\u4e0d\u662f\u987a\u5b50…..LL\u4e0d\u9ad8\u5174\u4e86,\u4ed6\u60f3\u4e86\u60f3,\u51b3\u5b9a\u5927\\\\\u5c0f \u738b\u53ef\u4ee5\u770b\u6210\u4efb\u4f55\u6570\u5b57,\u5e76\u4e14A\u770b\u4f5c1,J\u4e3a11,Q\u4e3a12,K\u4e3a13\u3002\u4e0a\u9762\u76845\u5f20\u724c\u5c31\u53ef\u4ee5\u53d8\u6210\u201c1,2,3,4,5\u201d(\u5927\u5c0f\u738b\u5206\u522b\u770b\u4f5c2\u548c4),\u201cSo Lucky!\u201d\u3002LL\u51b3\u5b9a\u53bb\u4e70\u4f53\u80b2\u5f69\u7968\u5566\u3002 \u73b0\u5728,\u8981\u6c42\u4f60\u4f7f\u7528\u8fd9\u5e45\u724c\u6a21\u62df\u4e0a\u9762\u7684\u8fc7\u7a0b,\u7136\u540e\u544a\u8bc9\u6211\u4eecLL\u7684\u8fd0\u6c14\u5982\u4f55， \u5982\u679c\u724c\u80fd\u7ec4\u6210\u987a\u5b50\u5c31\u8f93\u51fatrue，\u5426\u5219\u5c31\u8f93\u51fafalse\u3002\u4e3a\u4e86\u65b9\u4fbf\u8d77\u89c1,\u4f60\u53ef\u4ee5\u8ba4\u4e3a\u5927\u5c0f\u738b\u662f0\u3002<\/p>\n
\u601d\u8def：\u9996\u5148，\u786e\u5b9a\u201c\u5927\u5c0f\u738b\u201d\u7684\u4e2a\u6570\u3002\u7136\u540e，\u6392\u9664\u7ec4\u6210\u7684\u724c\u4e2d\u6709\u76f8\u540c\u7684\u5927\u5c0f\u7684\u724c\u7684\u60c5\u51b5\u3002\u6700\u540e，\u770b\u7eaf\u6570\u5b57\u724c\u4e4b\u95f4\u8981\u7ec4\u6210"\u8fde\u7eed\u503c"\u6240\u9700\u8981\u7684\u201c\u5927\u5c0f\u738b\u201d\u7684\u5f20\u6570，\u5c0f\u4e8e\u7b49\u4e8e\u4e4b\u524d\u7edf\u8ba1\u5f97\u5230\u7684\u201c\u5927\u5c0f\u738b\u201d\u7684\u4e2a\u6570\u5219\u8bf4\u660e\u53ef\u4ee5\u7ec4\u6210\u201c\u987a\u5b50\u201d\u3002<\/p>\n
# -*- coding:utf-8 -*-
\nclass Solution:
\n def IsContinuous(self, numbers):
\n # write code here
\n if not numbers: return 0
\n numbers.sort()
\n cnt = 0
\n jokers = 0
\n pre = None
\n for i in range(len(numbers)):
\n #\u5f97\u5230\u5927\u5c0f\u738b\u7684\u4e2a\u6570
\n if numbers[i] == 0:
\n jokers += 1
\n else:
\n #\u8d4b\u7ed9pre\u4e00\u4e2a\u521d\u503c
\n if pre is None:
\n pre = numbers[i]
\n else:
\n #\u6709\u91cd\u590d\u6570\u5b57\u7684\u8bdd，\u80af\u5b9a\u4e0d\u662f\u987a\u5b50
\n if pre == numbers[i]: return 0
\n #\u7d2f\u52a0\u627e\u5230\u8981\u4fdd\u8bc1\u662f\u8fde\u7eed\u6570\u5b57，\u5219\u6570\u5b57\u4e4b\u95f4\u76f8\u9694\u7684\u7f3a\u5931\u6570\u5b57\u7684\u4e2a\u6570
\n cnt += numbers[i] – pre – 1
\n pre = numbers[i]
\n cnt -= jokers
\n #cnt <= 0\u8868\u793a\u5927\u5c0f\u738b\u7684\u4e2a\u6570\u662f\u8db3\u591f\u8865\u4e0a\u7f3a\u5931\u6570\u5b57\u7684\u4e2a\u6570\u7684
\n return cnt <= 0<\/p>\n
\u4eb2\u7231\u7684\u8bfb\u8005\u670b\u53cb：\u611f\u8c22\u60a8\u5728\u7e41\u5fd9\u4e2d\u9a7b\u8db3\u9605\u8bfb\u672c\u671f\u5185\u5bb9！\u60a8\u7684\u5230\u6765\u662f\u5bf9\u6211\u4eec\u6700\u5927\u7684\u652f\u6301\u2764\ufe0f<\/p>\n
\u6b63\u5982\u53e4\u8bed\u6240\u8a00："\u5f53\u5c40\u8005\u8ff7，\u65c1\u89c2\u8005\u6e05"\u3002\u60a8\u72ec\u5230\u7684\u89c1\u89e3\u4e0e\u5ba2\u89c2\u8bc4\u4ef7，\u6070\u4f3c\u4e00\u76cf\u660e\u706f💡，\u80fd\u5e2e\u52a9\u6211\u4eec\u7167\u4eae\u5185\u5bb9\u76f2\u533a，\u8ba9\u672a\u6765\u7684\u521b\u4f5c\u66f4\u52a0\u8d34\u8fd1\u60a8\u7684\u9700\u6c42\u3002<\/p>\n
\u82e5\u6b64\u6587\u7ed9\u60a8\u5e26\u6765\u542f\u53d1\u6216\u6536\u83b7，\u4e0d\u59a8\u901a\u8fc7\u4ee5\u4e0b\u65b9\u5f0f\u4e3a\u5f7c\u6b64\u642d\u5efa\u4e00\u5ea7\u6865\u6881： \u2728 \u70b9\u51fb\u53f3\u4e0a\u89d2\u3010\u70b9\u8d5e\u3011<\/span>\u56fe\u6807，\u8ba9\u597d\u5185\u5bb9\u88ab\u66f4\u591a\u4eba\u770b\u89c1 \u2728 \u6ed1\u52a8\u5c4f\u5e55\u3010\u6536\u85cf\u3011<\/span>\u672c\u7bc7，\u4fbf\u4e8e\u968f\u65f6\u67e5\u9605\u56de\u5473 \u2728 \u5728\u8bc4\u8bba<\/span>\u533a\u7559\u4e0b\u60a8\u7684\u771f\u77e5\u707c\u89c1，\u8ba9\u6211\u4eec\u5171\u540c\u78b0\u649e\u601d\u7ef4\u7684\u706b\u82b1<\/p>\n \u6211\u59cb\u7ec8\u79c9\u6301\u5320\u5fc3\u7cbe\u795e，\u4ee5\u952e\u76d8\u4e3a\u7281\u94e7\u6df1\u8015\u77e5\u8bc6\u6c83\u571f💻，\u7528\u6bcf\u4e00\u6b21\u6572\u51fb\u4f20\u9012\u4e13\u4e1a\u4ef7\u503c，\u4e0d\u65ad\u4f18\u5316\u5185\u5bb9\u5448\u73b0\u5f62\u5f0f，\u529b\u6c42\u4e3a\u60a8\u6253\u9020\u6c89\u6d78\u5f0f\u7684\u9605\u8bfb\u76db\u5bb4📚\u3002<\/p>\n \u6709\u4efb\u4f55\u7591\u95ee\u6216\u5efa\u8bae？\u8bc4\u8bba\u533a\u5c31\u662f\u6211\u4eec\u7684\u8fde\u5fc3\u6865！\u60a8\u7684\u6bcf\u4e00\u6761\u7559\u8a00\u6211\u90fd\u5c06\u8ba4\u771f\u7814\u8bfb，\u5e76\u572824\u5c0f\u65f6\u5185\u56de\u590d\u89e3\u7b54📝\u3002<\/p>\n \u613f\u6211\u4eec\u643a\u624b\u540c\u884c，\u5728\u77e5\u8bc6\u7684\u96e8\u6797\u4e2d\u8301\u58ee\u6210\u957f🌳，\u5171\u4eab\u601d\u60f3\u7efd\u653e\u7684\u7518\u751c\u679c\u5b9e\u3002\u4e0b\u671f\u76f8\u9047\u65f6，\u671f\u5f85\u770b\u5230\u60a8\u667a\u6167\u7684\u8bc4\u8bba\u4e0e\u95ea\u4eae\u7684\u70b9\u8d5e\u8eab\u5f71\u2728！<\/p>\n \u4e07\u5206\u611f\u8c22🙏🙏\u60a8\u7684\u70b9\u8d5e👍👍\u3001\u6536\u85cf\u2b50🌟\u3001\u8bc4\u8bba💬🗯\ufe0f\u3001\u5173\u6ce8\u2764\ufe0f💚～<\/span><\/p>\n \u81ea\u6211\u4ecb\u7ecd：\u4e00\u7ebf\u4e92\u8054\u7f51\u5927\u5382\u8d44\u6df1\u7b97\u6cd5\u7814\u53d1（\u5de5\u4f5c6\u5e74+），4\u5e74\u4ee5\u4e0a\u62db\u8058\u9762\u8bd5\u5b98\u7ecf\u9a8c（\u4e00\u4e8c\u9762\u9762\u8bd5\u5b98，\u9762\u8bd5\u5019\u9009\u4eba400+），\u6df1\u8c19\u5c97\u4f4d\u4e13\u4e1a\u77e5\u8bc6\u3001\u6280\u80fd\u96f7\u8fbe\u56fe，\u5df2\u7d2f\u8ba1\u8f85\u5bfc15+\u6c42\u804c\u8005\u987a\u5229\u5165\u804c\u5927\u4e2d\u578b\u4e92\u8054\u7f51\u516c\u53f8\u3002\u719f\u7ec3\u638c\u63e1\u5927\u6a21\u578b\u3001NLP\u3001\u641c\u7d22\u3001\u63a8\u8350\u3001\u6570\u636e\u6316\u6398\u7b97\u6cd5\u548c\u4f18\u5316，\u63d0\u4f9b\u9762\u8bd5\u8f85\u5bfc\u3001\u4e13\u4e1a\u77e5\u8bc6\u5165\u95e8\u5230\u8fdb\u9636\u8f85\u5bfc\u7b49\u5b9a\u5236\u5316\u9700\u6c42\u7b49\u670d\u52a1，\u52a9\u529b\u60a8\u987a\u5229\u5b8c\u6210\u5b66\u4e60\u548c\u6c42\u804c\u4e4b\u65c5（\u6709\u9700\u8981\u8005\u53ef\u79c1\u4fe1\u8054\u7cfb）\u00a0<\/p>\n \u53cb\u53cb\u4eec，\u81ea\u5df1\u7684\u77e5\u4e4e\u8d26\u53f7\u4e3a\u201c\u5feb\u4e50\u661f\u7403\u201d<\/span>，\u5b9a\u671f\u66f4\u65b0\u6280\u672f\u6587\u7ae0，\u656c\u8bf7\u5173\u6ce8！\u00a0\u00a0\u00a0\u00a0\u00a0<\/p>\n","protected":false},"excerpt":{"rendered":" \u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb366\u6b21\uff0c\u70b9\u8d5e2\u6b21\uff0c\u6536\u85cf6\u6b21\u3002\u672c\u6587\u6574\u7406\u4e868\u4e2a\u7b97\u6cd5\u9898\u76ee\u7684Python\u5b9e\u73b0\u4ee3\u7801\u53ca\u89e3\u9898\u601d\u8def\uff0c\u5305\u62ec\uff1a\u6570\u503c\u7684\u6574\u6570\u6b21\u65b9\uff08\u5feb\u901f\u5e42\u7b97\u6cd5\uff09\u3001\u6574\u6570\u4e2d1\u51fa\u73b0\u7684\u6b21\u6570\uff08\u9010\u4f4d\u7edf\u8ba1\uff09\u3001\u4e11\u6570\u751f\u6210\uff08\u52a8\u6001\u89c4\u5212\uff09\u3001\u548c\u4e3aS\u7684\u8fde\u7eed\u6b63\u6570\u5e8f\u5217\uff08\u6ed1\u52a8\u7a97\u53e3\uff09\u3001\u548c\u4e3aS\u7684\u4e24\u4e2a\u6570\u5b57\uff08\u53cc\u6307\u9488\uff09\u3001\u6784\u5efa\u4e58\u79ef\u6570\u7ec4\uff08\u524d\u540e\u7f00\u4e58\u79ef\uff09\u3001\u6570\u636e\u6d41\u4e2d\u4f4d\u6570\uff08\u52a8\u6001\u6392\u5e8f\uff09\u548c\u6251\u514b\u724c\u987a\u5b50\u5224\u65ad\uff08\u6392\u5e8f+\u8865\u4f4d\uff09\u3002\u6bcf\u4e2a\u95ee\u9898\u90fd\u63d0\u4f9b\u4e86\u8be6\u7ec6\u7684\u4ee3\u7801\u5b9e\u73b0\u548c\u89e3\u9898\u601d\u8def\u5206\u6790\uff0c\u91cd\u70b9\u8bb2\u89e3\u4e86\u5982\u4f55\u8fd0\u7528\u7279\u5b9a\u7b97\u6cd5\u6280\u5de7\uff08\u5982\u53cc\u6307\u9488\u3001\u6ed1\u52a8\u7a97\u53e3\u7b49\uff09\u9ad8\u6548\u89e3\u51b3\u95ee\u9898\u3002<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[2692,81,3509,427,925],"topic":[],"class_list":["post-47889","post","type-post","status-publish","format-standard","hentry","category-server","tag-leetcode","tag-python","tag-3509","tag-427","tag-925"],"yoast_head":"\n
\n