码迷,mamicode.com
首页 >  
搜索关键字:lintcode    ( 1584个结果
[Lintcode]2. Trailing Zeros
"2. Trailing Zeros" 本题难度: Easy Topic: Math&Bit Manipulation Description Write an algorithm which computes the number of trailing zeros in n factorial. ...
分类:其他好文   时间:2019-02-10 09:38:59    阅读次数:165
[Leetcode]81. Search in Rotated Sorted Array II
"81. Search in Rotated Sorted Array II" 本题难度: Medium Topic: Binary Search 类似 "[Lintcode]62. Search in Rotated Sorted Array/[Leetcode]33. Search in Rot ...
分类:其他好文   时间:2019-02-10 09:35:44    阅读次数:188
[Lintcode]181. Flip Bits
"181. Flip Bits" 本题难度: Easy Topic: Math&Bit Manipulation Description Determine the number of bits required to flip if you want to convert integer n to ...
分类:其他好文   时间:2019-02-10 09:33:33    阅读次数:225
[Lintcode]62. Search in Rotated Sorted Array/[Leetcode]33. Search in Rotated Sorted Array
"[Lintcode]62. Search in Rotated Sorted Array" / "[Leetcode]33. Search in Rotated Sorted Array" 本题难度: Medium/Medium Topic: Binary Search Description 6 ...
分类:其他好文   时间:2019-02-10 09:31:29    阅读次数:156
[Lintcode]61. Search for a Range/[Leetcode]34. Find First and Last Position of Element in Sorted Array
"[Lintcode]61. Search for a Range" / "[Leetcode]34. Find First and Last Position of Element in Sorted Array" 本题难度: Medium/Medium Topic: Binary Search ...
分类:其他好文   时间:2019-02-10 09:22:00    阅读次数:143
[Lintcode]183. Wood Cut
"183. Wood Cut" 本题难度: Hard Topic: Binary Search Description Given n pieces of wood with length L[i] (integer array). Cut them into small pieces to gua ...
分类:其他好文   时间:2019-02-10 09:17:21    阅读次数:195
[Lintcode]75. Find Peak Element
"75. Find Peak Element" Description There is an integer array which has the following features: The numbers in adjacent positions are different. A[0] ...
分类:其他好文   时间:2019-02-09 10:45:29    阅读次数:177
[Lintcode]74. First Bad Version/[Leetcode]278. First Bad Version
"[Lintcode]74. First Bad Version" "[Leetcode]278. First Bad Version" 本题难度: [Lintcode]Medium/[Leetcode] Topic: Binary Search Description 我的代码 for Leet ...
分类:其他好文   时间:2019-02-09 10:32:29    阅读次数:220
随手练——LintCode 433 - 小岛数量
LintCode 433: https://www.lintcode.com/problem/number-of-islands/description LintCode 434: https://www.lintcode.com/problem/number-of-islands-ii/descr ...
分类:其他好文   时间:2019-02-08 10:32:02    阅读次数:172
BFS - 20190206
1.二叉树 BFS 2.拓扑排序 重点 BFS 3.棋盘上的宽搜 BFS 图的遍历 层级遍历,由点及面,拓扑排序,简单图的最短路径 如果题目问最短路径:可能是BFS或者DP, 最长路径:DFS queue 的数组实现 1.二叉树的BFS https://www.lintcode.com/proble ...
分类:其他好文   时间:2019-02-07 09:36:35    阅读次数:178
1584条   上一页 1 ... 9 10 11 12 13 ... 159 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!