码迷,mamicode.com
首页 >  
搜索关键字:elements    ( 4737个结果
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.思路:使用两个指针分别以1、2的速度遍历链表,以定位出链表的中点,进而将链表分割成...
分类:其他好文   时间:2014-08-17 02:21:36    阅读次数:246
用 Java 抓取优酷、土豆等视频
1. [代码][JavaScript]代码 import org.jsoup.Jsoup;import org.jsoup.nodes.Document;import org.jsoup.nodes.Element;import org.jsoup.select.Elements;/*** 视频工具...
分类:编程语言   时间:2014-08-16 17:05:51    阅读次数:269
[leetcode]Convert Sorted List to Binary Search Tree
Convert Sorted List to Binary Search TreeGiven a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST....
分类:其他好文   时间:2014-08-16 12:19:20    阅读次数:227
LeetCode——Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements fro...
分类:其他好文   时间:2014-08-16 11:12:43    阅读次数:317
23种设计模式
23种设计模式设计模式- 可复用面向对象软件的基础Design Patterns- Elements of Reusable Object-Oriented Software一、前言 使用设计模式的根本原因是为了代码复用,增加可维护性。 设计模式是前辈们在做各种优化时的运用总结,其实本质上是没有.....
分类:其他好文   时间:2014-08-15 23:40:19    阅读次数:224
每日算法之四十一:Spiral Matrix II (螺旋矩阵)
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order. For example, Given n = 3, You should return the following matrix: [ [ 1, 2, 3 ], [ 8, 9, 4 ], [...
分类:其他好文   时间:2014-08-15 22:37:39    阅读次数:274
Subsets II
Given a collection of integers that might contain duplicates,S, return all possible subsets.Note:Elements in a subset must be in non-descending order....
分类:其他好文   时间:2014-08-15 21:08:29    阅读次数:212
leetcode 之 Recover Binary Search Tree
Recover Binary Search Tree Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Note: A solution using O(n) space is pretty s...
分类:其他好文   时间:2014-08-15 19:39:39    阅读次数:222
LeetCode (1) Merge Sorted Array
题目: Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space to hold additional elements from B. The number of elements initia...
分类:其他好文   时间:2014-08-15 18:00:09    阅读次数:194
[LeetCode] Subsets (bfs的vector实现)
Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not c...
分类:其他好文   时间:2014-08-15 17:18:39    阅读次数:177
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!