![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
剑指offer
from 26/12/2020
JimmyFun
suck it up
展开
-
JZ32 map + sort
class Solution: def PrintMinNumber(self, numbers): # yx < xy 降序 def cmp(x,y): if x+y > y+x: return 1 elif x+y < y+x: return -1 else: return 0..原创 2021-01-08 12:01:38 · 75 阅读 · 0 评论 -
JZ31 1~n 中1的个数
个位、十位、百位。。。divide into high/cur/lowidea fromhttps://leetcode-cn.com/problems/1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof/solution/mian-shi-ti-43-1n-zheng-shu-zhong-1-chu-xian-de-2/原创 2021-01-07 21:18:01 · 86 阅读 · 0 评论 -
JZ23 二叉搜索树BST 后序序列合法
BST的后序序列的合法: 对于一个序列S,最后一个元素是x (root),如果去掉最后一个元素的序列为T,那么T满足:T可以分成两段,前一段(左子树)小于x,后一段(右子树)大于x,且这两段(子树)都是合法的后序序列。...原创 2021-01-05 12:40:28 · 89 阅读 · 0 评论 -
JZ21 压栈弹栈
python2:list==[]instead ofnot list(python3)core code: j =0 for i in pushV: stack.append(i) while stack and stack[-1] == popV[j]: stack.pop() j +=1原创 2021-01-05 00:56:03 · 60 阅读 · 0 评论 -
JZ4 重建二叉树
前序、中序:root节点在前、中遍历树的结构一般用递归:重建左右子树1.根据前序遍历获得根节点2.根据中序遍历获取左右子树节点范围# -*- coding:utf-8 -*-# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: # 返回构造的...原创 2020-12-28 18:25:59 · 143 阅读 · 0 评论 -
JZ3 从尾到头打印链表
1. 最初打算一行解决问题(“ str[::-1] ”,结果发现输入是一个集合(╯°Д°)╯( ┻━┻2. 参考了别人的方法, 定义个链表类, 用insert在list头插入class ListNode: def __init__(self,x): self.val = x self.next = Noneclass Solution: def printListFromTailToHead(self, listNode): ..原创 2020-12-27 11:28:50 · 77 阅读 · 0 评论