dongxieaitonglao的博客

原创 2020/2/27

class Solution: def removeNthFromEnd(self,head,n) if head.next==None: return None deep=0 head_temp=head while head_temp: head_temp=head_temp...

原创 20202/2/24leetcode

class Solution: def threeSumCloset(self,nums): n=len(nums) if n==3: return sum(nums) minDiff=float("inf") closesSum=0 nums.sort for i i...

原创 2020/2/26leetcode_backtrace

class Solution: def letterCombination(self,digits): if not digits: return [] phone = {'2': ['a', 'b', 'c'], '3': ['d', 'e', 'f'], '4': ['g', 'h', 'i'], ...

原创 2020/2/25 leetcode11

class Solution: def threeSum(self,nums): n=len(nums) res=[] if not nums or n<3: return [] nums.sort() res=[] for i in range(n): if(nums[i]>0): ...

原创 2020/2/16leetcode

class Solution: def intToRoman(self,num:int): hashmap={1000:"M",900:"CM",500:"D",400:"CD",100:"C",90:"XC",50:"L",40:"XL",10:"X",9:"IX",5:"V",4:"IV",1:"I"} s="" for k in ha...

原创 2020/2/18leetcode09

class Solution: def maxArea(self,height:List[int])->int: i,j,res=0,len(height)-1,0 while i<j: if height[i]<height[j]: res=max(res,height[i]*(j...

原创 leetcode8

def isMatch(text,pattern): if not pattern: return not text first_match=bool(text) and pattern[0] in {text[0],"."} if len(pattern)>=2 and patttern[1]=="*": return isMatch(text,p...

原创 2020/2/11http——protocol

from socket import *def handle(connfd): print("Request from",connfd.getpeername()) request=connfd.recv(4096) if not request: return request_line=request.splitlines()[0].decode() ...

原创 2020/2/10leetcode06

class Solution:def myAtoi(self,str:str)->int: numdic={"0":0,"1":1,"2":2,"3":3,"4":4,"5":5,"6":6,"7":7,"8":8,"9":9} i=0 while i<len(str) and str[i]==" ": i+=1 if i>le...

原创 2020/1/22leetcode05

def reverse_force(self,x:int)->int: if -10<x<10: return x str_x=str(x) if str_x[0]!="-": str_x=str_x[::-1] x=int(str_x) else: str_x=str_x[:0:-...

原创 2020/1/20 leetcode04

def convert(self,s:str,numRows:int) ->str: if numRows<2:return s res=["" for _ in range(numRows)] i,flag=0,-1 for c in s: res[i]+=c if i ==0 or i ==numRows -1:fl...

原创 2020/2/9网络编程udp,server and client

udp:server.pyfrom socket import *sockfd=socket(AF_INET,SOCK_DGRAM)server_addr=("0.0.0.0",8888)sockfd.bind(server_addr)while True: data,addr=sockfd.recvfrom(1024) print("收到的消息",data.decod...

原创 2020/2/7 leetcode03

思路：其实就是一个队列,比如例题中的 abcabcbb，进入这个队列（窗口）为 abc 满足题目要求，当再进入 a，队列变成了 abca，这时候不满足要求。所以，我们要移动这个队列！如何移动？我们只要把队列的左边的元素移出就行了，直到满足题目要求！一直维持这样的队列，找出队列出现最长的长度时候，求出解！代码：...

原创 2020/2/8 网络编程基础TCP_SERVER ANDCLIENT

#tcp_serverimport socket#sockfd=socket.socket(socket.AF_INET,socket.SOCK_STREAM)#sockfd.bind(("0.0.0.0",8888))#sockfd.listen(5)print("waiting for connect..")connfd,addr=sockfd.accept()#data...

原创 2020/1/31leetcode02

def addTwoNumbers(self,l1,l2): a,b,p,carry=l1,l2,None,0 while a or b: val=(a.val if a else 0)+(b.val if b else 0)+carry carry,val=val/10 if val>=10 else 0,val%10 p,p.val=a if a...

原创 2020/2/2算法基础，字节串

原创 2020/2/6数据结构二叉树

class TreeNode: def __init__(self,data=None,left=None,right=None): self.data=data self.left=left self.right=rightclass Bitree: def __init__(self,root=None): ...

原创 2020/2/5树的定义及二叉树遍历先、中、后根遍历及递归思想

树的定义

原创 2020/2/1 leetcode_01

def twoSum(nums,target): lens=len(nums) j=-1 for i in range(lens): if (target.count(target-nums[i]==1)&(target-nums[i]==nums[i])): continue else: ...

原创 2020/2/3 数据结构：顺序队列

顺序队列class QueueError(Exception): passclass SQueue: def __init__(self): self._elems=[] def is_empty(self): return self._elems==[] def enqueue(self,elem): self....

原创 2020/2/4栈的链式存储

栈的链式存储#一侧操作的列表class StackError(Exception): passclass Node(object): def __init__(self,val,next=None): self.val=val self.next=nextclass LStack: def __init__(self): ...