Miss.Zhou

LeetCode

###基本算法(～ o ～)Y(1) .net(1) 2014多校联合(2) acm(12) arcgis(1) bfs(1) c#(1) c++(1) CF(2) codeforces(5) css(1) dp(27) git使用(1) hdu(27) java(1) javascript(4) leetcode (1) lightoj(1) oi(1) php(12) poj(13) poj 搜索算法 acm(1) poj 算法线段树懒惰标记(1) python(2) RMQ(1) socket(1) splay(1) tarjan(3) trie(3) vmware(1) web开发(1) xml(1) —dp(9) —STL(2) ———哈希表(2) ———网络流(1) —二分(2) —图论(7) —字符串(4) —思维题(1) —搜索(7) —数据结构(5) —数论(9) —贪心(4) 三分(1) 二分图(3) 前端(1) 动态规划(1) 匈牙利算法(1) 博弈(1) 压缩(1) 双连通分量(1) 图论(4) 多校(2) 并查集(1) 并查集 poj(1) 并查集几何 hdu(1) 并查集算法(2) 广搜(2) 思维题(1) 拓扑排序(1) 搜素(1) 搜索(1) 操作系统(2) 数据结构(1) 数论算法(3) 最佳二分匹配(1) 最大二分匹配(2) 最小树形图(1) 未归档(397) 杭电(7) 树型dp(2) 模拟(1) 欧拉回路(1) 正则表达式(1) 深搜(1) 深搜 hdu 算法(1) 矩阵(1) 算法(10) 算法并查集(1) 线段树(6) 编程(1) 网络流(4) 计算机基础(4) 设计模式(19) 贪心(1) 随笔(1) 题解(8) 验证码(1)

/ 注册

全部文章 / LeetCode （共47篇）

leetcode 47. Permutations II[排列]

https://leetcode.com/problems/permutations-ii/ Given a collection of numbers that might contain duplicates, return all possible unique permutations. ...

leetcode

2019-07-14

0 711

leetcode 109. Convert Sorted List to Binary Search Tree【给定有序数组构建二叉树】

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced bin...

LeetCode BST

2019-03-11

0 428

leetcode 94. Binary Tree Inorder Traversal中序遍历

我特么要菜哭了这玩意怎么能卡这么久 Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,3,2] Follow up: Recursive solution is trivial, could you...

leetcode 中序遍历

2018-12-17

0 548

leetcode 89. Gray Code【枚举格雷码】

https://leetcode.com/problems/gray-code/description/ The gray code is a binary numeral system where two successive values differ in only one bit. Gi...

leetcode

2018-11-07

0 623

leetcode 82. Remove Duplicates from Sorted List II【删除链表重复字符】

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Example 1: Input: 1...

leetcode 链表

2018-11-05

0 437

leetcode 80. Remove Duplicates from Sorted Array II【c++for循环】

Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length. Do not allocate extr...

2018-11-03

0 462

leetcode 79. Word Search【dfs找方格中出现字符串】

https://leetcode.com/problems/word-search/description/ Given a 2D board and a word, find if the word exists in the grid. The word can be constructed...

leetcode dfs

2018-11-02

0 563

leetcode 75. Sort Colors【荷兰旗问题】

基于快排的思想回忆一下快排的思路：把第一个位置的作为pivot,从右遍历直到发现有比pivot小的，交换；从左遍历，直到发现有比pivot大的，交换注意这里交换的都是当前的low和high，直到low,high相遇，本轮停止如果数字里面只有0,1,2那么显然只需要一次while就可以...

leetcode 快排

2018-11-01

0 547

leetcode 73. Set Matrix Zeroes【设置行列为0】

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place. Example 1: Input: [ [1,1,1], [1,0,1], [1,1,1] ...

leetcode

2018-10-31

0 652

leetcode 71. Simplify Path【文件路径表达式】

Given an absolute path for a file (Unix-style), simplify it. For example,path = "/home/", => "/home"path = "/a/./b/../.....

2018-10-29

0 480