榜单
服务器优惠
AI论文
IT文库
-
Count 1 in Binary
Count 1 in Binary Question 题解 C++ Java 源码分析 复杂度分析 Reference Count 1 in Binary Question lintcode: (365) Count 1 in Binary Count how many 1 in binary representat... -
Word Break
Word Break World Break II Word Break Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionar... -
Permutations
Permutations Question Problem Statement Example Challenge 题解1 - Recursion(using subsets template) Python C++ Java 源码分析 复杂度分析 题解2 - Recursion Python C++ Java 源码分析 复杂度分... -
Convert Sorted Array to Binary Search Tree
Convert Sorted Array to Binary Search Tree Question 题解 - 折半取中 C++ Java 源码分析 复杂度分析 Reference Convert Sorted Array to Binary Search Tree Question leetcode: Convert Sort... -
Merge k Sorted Lists
Merge k Sorted Lists Question " level="2">题解1 - 选择归并(TLE) C++ 源码分析 复杂度分析 " level="2">题解2 - 迭代调用Merge Two Sorted Lists (TLE) C++ 源码分析 复杂度分析 题解3 - 二分调用Merge Two Sorted L... -
algorithm
数据结构与算法知否知否系列 algorithm Q1: 快排算法复杂度是多少？ Q2: 常见复杂度有哪些？ Reference 数据结构与算法知否知否系列 algorithm 算法解决的是时间、空间上的问题，一般都会谈及复杂度概念，例如 Redis 的 incr 命令，我们都知道它是 O(1) 复杂度，算法就是时间、空间上的一个平衡艺术。... -
搜索二维矩阵
搜索二维矩阵 题目 解题思路 搜索二维矩阵 题目 Leetcode 编写一个高效的算法来搜索 m x n 矩阵 matrix 中的一个目标值 target。该矩阵具有以下特性： 每行的元素从左到右升序排列。 每列的元素从上到下升序排列。 示例: 现有矩阵 matrix 如下： [ [ 1 , 4 , 7 ... -
Maximal Square
Maximal Square Question Problem Statement Example 题解 Java 源码分析 复杂度分析 Follow up Reference Maximal Square Question leetcode: Maximal Square | LeetCode OJ lintcode: M... -
Search in Rotated Sorted Array
Search in Rotated Sorted Array Question Problem Statement Example Challenge 题解 - 找到有序数组 C++ Java 源码分析 复杂度分析 Search in Rotated Sorted Array Question leetcode: Search... -
Serialize and Deserialize Binary Tree
Serialize and Deserialize Binary Tree Serialize and Deserialize Binary Tree Serialization is the process of converting a data structure or object into a sequence of bits so tha...