【文件属性】：
文件名称：leetcode招聘-coding-practise:Leetcode、剑指Offer
文件大小：551KB
文件格式：ZIP
更新时间：2021-07-06 17:20:58
系统开源
leetcode
招聘
面向招聘编程
Leetcode、剑指Offer
8.9
goal
LeetCode
2题
【文件预览】：
coding-practise-master
----剑指offer()
--------008-跳台阶.ipynb(1KB)
--------013-调整数组顺序使奇数位于偶数前面.ipynb(2KB)
--------022-从上往下打印二叉树.ipynb(2KB)
--------023-二叉搜索树的后序遍历序列.ipynb(7KB)
--------010-矩形覆盖.ipynb(2KB)
--------025-复杂链表的复制.ipynb(593KB)
--------016-合并两个排序的列表.ipynb(3KB)
--------019-顺时针打印矩阵.ipynb(6KB)
--------024-二叉树中和为某一值的路径.ipynb(2KB)
--------014-链表中倒数第k个节点.ipynb(4KB)
--------003-从头到尾打印链表.ipynb(2KB)
--------020-包含min函数的栈.ipynb(5KB)
--------009-变态跳台阶.ipynb(2KB)
--------007-斐波那契数列.ipynb(2KB)
--------006-旋转数组的最小数字.ipynb(4KB)
--------015-反转链表.ipynb(2KB)
--------017-树的子结构.ipynb(4KB)
--------018-二叉树的镜像.ipynb(3KB)
--------011-二进制中1的个数.ipynb(3KB)
--------021-栈的压入，弹出序列.ipynb(3KB)
----Leetcode()
--------225. Implement Stack using Queues.ipynb(6KB)
--------104. Maximum Depth of Binary Tree.ipynb(3KB)
--------15. 3Sum.ipynb(4KB)
--------50. Pow(x, n).ipynb(3KB)
--------142. Linked List Cycle II.ipynb(38KB)
--------24. Swap Nodes in Pairs.ipynb(3KB)
--------53. Maximum Subarray.ipynb(3KB)
--------152. Maximum Product Subarray.ipynb(6KB)
--------22. Generate Parentheses.ipynb(2KB)
--------141. Linked List Cycle.ipynb(19KB)
--------121. Best Time to Buy and Sell Stock.ipynb(3KB)
--------122. Best Time to Buy and Sell Stock II.ipynb(3KB)
--------1. Two Sum.ipynb(3KB)
--------20. Valid Parentheses.ipynb(3KB)
--------239. Sliding Window Maximum.ipynb(7KB)
--------206. Reverse Linked List.ipynb(1KB)
--------232. Implement Queue using Stacks.ipynb(5KB)
--------21. Merge Two Sorted Lists.ipynb(4KB)
--------70. Climbing Stairs.ipynb(3KB)
--------102. Binary Tree Level Order Traversal.ipynb(4KB)
--------242. Valid Anagram.ipynb(3KB)
--------703. Kth Largest Element in a Stream.ipynb(4KB)
--------111. Minimum Depth of Binary Tree.ipynb(4KB)
--------98. Validate Binary Search Tree.ipynb(6KB)
--------120. Triangle.ipynb(3KB)
--------51. N-Queens.ipynb(21KB)
----README.md(71B)