自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(30)
  • 资源 (29)
  • 收藏
  • 关注

原创 LeetCode --- 110. Balanced Binary Tree

题目链接:Balanced Binary TreeGiven a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees

2015-04-23 10:19:17 1002

原创 LeetCode --- 109. 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.这道题的要求是将有序链表转化成高度平衡的二叉搜索树(BST)。1. 利

2015-04-17 16:48:22 2127

原创 LeetCode --- 108. Convert Sorted Array to Binary Search Tree

题目链接:Convert Sorted Array to Binary Search TreeGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.这道题的要求是将有序数组转化成高度平衡的二叉搜索树(BST)。由于数组有序,因此相当于二叉搜索树

2015-04-17 16:47:29 979

原创 LeetCode --- 107. Binary Tree Level Order Traversal II

题目链接:Binary Tree Level Order Traversal IIGiven a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exam

2015-04-17 16:46:33 2758

原创 LeetCode --- 106. Construct Binary Tree from Inorder and Postorder Traversal

题目链接:Construct Binary Tree from Inorder and Postorder TraversalGiven inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in th

2015-04-17 16:44:25 774

原创 LeetCode --- 105. Construct Binary Tree from Preorder and Inorder Traversal

题目链接:Construct Binary Tree from Preorder and Inorder TraversalGiven preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the

2015-04-16 09:13:20 854

原创 LeetCode --- 104. Maximum Depth of Binary Tree

题目链接:Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.这道题

2015-04-16 09:12:17 1081

原创 LeetCode --- 103. Binary Tree Zigzag Level Order Traversal

题目链接:Binary Tree Zigzag Level Order TraversalGiven a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and a

2015-04-16 09:11:31 979

原创 LeetCode --- 102. Binary Tree Level Order Traversal

题目链接:Binary Tree Level Order TraversalGiven a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#

2015-04-16 08:57:30 949

原创 LeetCode --- 101. Symmetric Tree

题目链接:Symmetric TreeGiven a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \ 3

2015-04-16 08:55:14 896

原创 LeetCode --- 100. Same Tree

题目链接:Same TreeGiven two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

2015-04-14 19:54:07 930

原创 LeetCode --- 99. Recover Binary Search Tree

题目链接:Recover Binary Search TreeTwo 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 stra

2015-04-14 19:52:24 771

原创 LeetCode --- 98. Validate Binary Search Tree

题目链接:Validate Binary Search TreeGiven a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with

2015-04-14 19:51:33 814

原创 LeetCode --- 97. Interleaving String

题目链接:Interleaving StringGiven s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.When

2015-04-14 19:50:56 879

原创 LeetCode --- 96. Unique Binary Search Trees

题目链接:Unique Binary Search TreesGiven n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1

2015-04-14 19:49:55 842

原创 LeetCode --- 95. Unique Binary Search Trees II

题目链接:Unique Binary Search Trees IIGiven n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique B

2015-04-09 10:53:49 1017

原创 LeetCode --- 94. Binary Tree Inorder Traversal

题目链接:Binary Tree Inorder TraversalGiven a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3 return

2015-04-09 10:52:13 760

原创 LeetCode --- 93. Restore IP Addresses

题目链接:Restore IP AddressesGiven a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "25

2015-04-09 10:51:20 1345

原创 LeetCode --- 92. Reverse Linked List II

题目链接:Reverse Linked List IIReverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note:

2015-04-09 10:50:21 645

原创 LeetCode --- 91. Decode Ways

题目链接:Decode WaysA message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits,

2015-04-09 10:49:48 657

原创 LeetCode --- 90. Subsets II

题目链接:Subsets IIGiven a collection of integers that might contain duplicates, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not

2015-04-07 21:57:42 671

原创 LeetCode --- 89. Gray Code

题目链接:Gray CodeThe gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print th

2015-04-07 21:55:12 3488

原创 LeetCode --- 88. Merge Sorted Array

题目链接:Merge Sorted ArrayGiven 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 ad

2015-04-07 21:53:14 624

原创 LeetCode --- 87. Scramble String

题目链接:Scramble StringGiven a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "great":

2015-04-07 21:52:53 2412

原创 LeetCode --- 86. Partition List

题目链接:Partition ListGiven a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of t

2015-04-07 21:50:51 642

原创 LeetCode --- 85. Maximal Rectangle

题目链接:Maximal RectangleGiven a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.这道题的要求是在0-1矩阵中找出面积最大的全1矩阵。1. 基于Largest Rectangle in H

2015-04-03 17:09:12 3401

原创 LeetCode --- 84. Largest Rectangle in Histogram

题目链接:Largest Rectangle in HistogramGiven n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.

2015-04-03 17:07:41 3068

原创 LeetCode --- 83. Remove Duplicates from Sorted List

题目链接:Remove Duplicates from Sorted ListGiven a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, r

2015-04-03 17:06:50 1143

原创 LeetCode --- 82. Remove Duplicates from Sorted List II

题目链接:Remove Duplicates from Sorted List IIGiven a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example,Given 1->2-

2015-04-03 17:05:11 820

原创 LeetCode --- 81. Search in Rotated Sorted Array II

题目链接:Search in Rotated Sorted Array IIFollow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to

2015-04-03 17:03:46 1191

LeetCode book——CleanCodeHandbook_v1.0.1

LeetCode book——CleanCodeHandbook_v1.0.1

2014-12-22

Codeblocks 12.11 汉化

Codeblocks 12.11 汉化包,这是真正的12.11的汉化,网上现在所谓的12.11汉化包基本上都是10.05的汉化。 这是真正的12.11的汉化。 把解压后的locale文件夹考到codeblocks/share/codeblocks下, 然后在codeblocks里找到settings->environment settings->view->Internationalization选择chinese

2013-12-21

2013中国大数据技术大会PPT——Big Data in Cloud

【大数据架构与系统】VMware主管工程师堵俊平分享了大数据5点趋势:Hadoop 2.0和YARN在大数据生态系统中扮演资源管理的核心角色;MR不够好,Tez,Spark可能是替代者;HDFS努力支持更多的业务场景;更多的基于Hadoop的SQL引擎,如Drill、 Impala、Stinger;企业级服务,安全、HA、QoS等。

2013-12-13

2013中国大数据技术大会PPT——中国移劢大数据应用实践

【智能交通与大数据技术峰会】中国移动研究院专家,中国移动通信研究院云计算系统部大数据产品开发室技术经理徐萌表示移动互联网用户流量激增,手机数据化、宽带化趋势明显,亟需深挖大数据价值。移动的大云实验室在BC-Hadoop上在做搭建开源站点和开源合作方面的工作。

2013-12-12

2013中国大数据技术大会PPT——腾讯大规模Hadoop集群实践

【大数据架构与系统】腾讯数据中心资深专家翟艳堂分享了腾讯建立大规模Hadoop集群的过程,首先要解决单点问题,将JobTracker分散化,做NameNode高可用。在业务选型方面,选择了成熟度更高的Facebook开源的Corona。

2013-12-12

2013中国大数据技术大会PPT——阿里搜索流计算技术

【大数据技术】阿里搜索事业部高级技术专家王峰介绍了一淘全网商品搜索系统架构、全网商品离线处理流程。本次大会是一淘第一次从基本概念、拓扑结构、消息管理、进度管理、编程接口等方面对外来介绍iSteam的计算模型。

2013-12-12

2013中国大数据技术大会PPT——阿里大数据应用平台

【大数据应用】阿里巴巴数据平台架构师刘昌钰,讲述了阿里大数据应用平台的业务流程:数据导入、数据开发、数据生产、数据回流、元数据中心、数据质量中心。阿里每天要处理的数据非常惊人,仅在日志中心,日采集40TB数据,峰值1GB/s。

2013-12-12

2013中国大数据技术大会PPT

【大数据架构与系统】VMware主管工程师堵俊平分享了大数据5点趋势:Hadoop 2.0和YARN在大数据生态系统中扮演资源管理的核心角色;MR不够好,Tez,Spark可能是替代者;HDFS努力支持更多的业务场景;更多的基于Hadoop的SQL引擎,如Drill、 Impala、Stinger;企业级服务,安全、HA、QoS等。

2013-12-12

2013中国大数据技术大会PPT——360超大规模HBASE集群的改进

【大数据技术主题论坛】奇虎360技术经理赵健博介绍目前360搜索、安全、监控等业务都使用了HBase集群,同时重点介绍了奇虎360近一年来结合业务对HBase作出的改进,如针对集群大、Region多致使启动时间过长进行的优化,同时还分享了专属MetaServer、Scan、保护模式、索引加载等方面的调优。

2013-12-12

VMsvga2 v1.2.3

VMWARE FOR MAC DRIVER VMsvga2 v1.2.3!Mac OS X 的显卡驱动,完美支持Lion! 支持Lion系统,有1366*768的分辨率,很适合笔记本用户使用!

2011-11-20

J2EE_Tutorial_中文版

或许你已经非常熟悉Java程序开发,但是现在,你应该进入更高一个层次,使用Java2平台企业版(J2EE)来创建企业级应用程序。《The J2EETM Tutorial 中文版》以丰富的实例提供独一无二的技术指导,对于每一位在J2EE平台上开发和部署应用程序的开发人员来说,都是一本案头必备的参考手册。   《The J2EETM Tutorial 中文版》的作者是Sun Microsystem公司Java开发小组资深的开发人员,与另一部取得空前成功的《The JavaTM Tutorial》一样,建立了与读者之间最为有效的交互途径。同时,在本书的编写过程中,也综合了大量来自于最终用户和系统设计师们的建议与反馈,保证了《The J2EETM Tutorial 中文版》能真正提供有价值的技术指导。你会发现书中使用了许多构思精巧的实例程序(包括源码)来描述J2EE关键的概念。此外,简明扼要的文字说明也有助于你快速掌握J2EE平台的多项技术,包括:   ☆ Enterprise JavaBean   ☆ Java Servlet   ☆ JavaServer Pages   ☆ Java Message Service (JMS,Java消息服务)   ☆ Java Naming and Directory Interface (JNDI,Java名字与目录接口)   ☆ XML   ☆ J2EE Connector Architecture (J2EE连接器架构)   ☆ JavaMail   ☆ JDBC   当你准备创建自己的大型企业级应用系统时,希望求助于无以伦比的技术指导、知识和经验时,你会发现在《The J2EETM Tutorial 中文版》一书中你能找到所有的一切。   Stephanie Bodoff, Dale Green, Kim Haase, 和Eric Jendrock是Sun Microsystem公司的专职作家,他们与Java开发人员团体(JDC)的Monica Pawlan一起编写了J2EE平台的联机文档。Beth Stearns是Computer Ease出版社的总裁。

2011-07-14

java EE 6 api

java EE 6 api 最新版! 欢迎下载! 英文chm版

2011-07-07

SpeedCubingTimer002

一个好用的魔方计时工具,免安装!很好用!

2010-11-12

SPEEDCUBINGTIMER

一个好用的魔方计时工具,免安装!很好用!

2010-11-12

PLL-Harris Chan

PLL-Harris Chan-三叶虫整理!分享一下!

2010-11-12

PLL-Breandan Vallance-

PLL-Breandan Vallance-三叶虫整理!分享一下!

2010-11-12

OLL - Harris Chan 2

Harris Chan 的 OLL 公式 , 很全的!

2010-11-12

OLL - Harris Chan

Harris Chan 的 OLL 公式 , 很全的!

2010-11-12

cfop 魔方 掌中宝

cfop 魔方 掌中宝!精心整理的,很适合收藏,基本包含OLL和PLL的所有公式!

2010-11-12

CFOP学习者快速掌握角先法

经常练习CFOP的朋友,让你的手指稍稍放松一下吧,来看看角先法。角先的优点是公式少毕竟观察比CFOP简单,不失为一种很好的复原方法。

2010-11-12

CFOP 精选顺手公式 三叶虫

精选顺手公式,多用对称,减少公式记忆量!三叶虫

2010-11-12

CFOP分阶段学习教程

CFOP法共分四步: (1)在底层架好十字(CROSS) (2)完成前两层(F2L) (3)顶面颜色统一(OLL) (4)完成顶层(PLL)

2010-11-12

Red Hat Linux6.0实用教程

新发行的红帽6.0,很实用的教程!全面系统地介绍了Red Hat Linxu 6.0

2010-11-12

CFOP 快速 顺手魔方教程

一个魔方简化公式,极其顺手,适合初学者,也能快速提速!

2010-07-02

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除