码迷,mamicode.com
首页 >  
搜索关键字:note    ( 7358个结果
Leetcode-Sort List
Sort a linked list in O(n log n) time using constant space complexity.Analsys:We use Merge Sort.NOTE: We should practice other sort algorithm, linke Q...
分类:其他好文   时间:2014-11-27 01:35:39    阅读次数:213
[leetcode]
问题描述: Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [1,3,2]. Note: Recursive solution...
分类:其他好文   时间:2014-11-26 22:39:25    阅读次数:227
javaBean和jsp应用
原网页:http://www.douban.com/note/102320977/JavaBean是一种可复用,跨平台的组件。共有两种JavaBean:一种无用户界面,这种一般用于处理数据运算,操作数据库等。另一种是有用户界面(User Interface)的JavaBean. 在Jsp中一般访问无...
分类:编程语言   时间:2014-11-26 20:54:12    阅读次数:163
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 from ...
分类:其他好文   时间:2014-11-26 16:29:34    阅读次数:164
LeetCode[Array]: Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space? 这个问题比较简单。 v...
分类:其他好文   时间:2014-11-26 14:23:25    阅读次数:245
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 ...
分类:其他好文   时间:2014-11-26 13:58:49    阅读次数:255
Codeforces Round #278 (Div. 2) d
/** ?*?@brief?Codeforces?Round?#278?(Div.?2)?d ?*?@file?d.c ?*?@author?面码 ?*?@created?2014/11/26?10:07 ?*?@edited??2014/11/26?10:07 ?*?@type?dp? ?*?@note ?*?????...
分类:其他好文   时间:2014-11-26 11:43:47    阅读次数:149
Anagrams
Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.参考:http://www.cnblogs.com/AnnieKim/ar...
分类:其他好文   时间:2014-11-26 01:08:54    阅读次数:190
LeetCode[Hash Table]: Anagrams
Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be in lower-case. 思路:对每一个单词的所有字母按照字典顺序排序,排序结果作为key,所有具有相同key的单词组合在一起成为一个Anagram group。最后返回所有的Anag...
分类:其他好文   时间:2014-11-25 23:42:35    阅读次数:195
Spark RDD API详解(一) Map和Reduce
本文由cmd markdown编辑,原始链接:https://www.zybuluo.com/jewes/note/35032RDD是什么?RDD是Spark中的抽象数据结构类型,任何数据在Spark中都被表示为RDD。从编程的角度来看,RDD可以简单看成是一个数组。和普通数组 的区别是,RDD中的...
分类:Windows程序   时间:2014-11-25 22:57:22    阅读次数:328
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!