摘要: 首先需要保证hadoop已经在电脑上安装。然后接下来只需要下载hhase配置就行了。 Step1: 下载hbase http://archive.apache.org/dist/hbase/1.2.6/ 选择hbase-1.2.6-bin.tar.gz Step2: 解压hbase到指定目录 Ste 阅读全文
posted @ 2018-07-08 12:21 一片叶子啊 阅读(1220) 评论(0) 推荐(0) 编辑
摘要: Give a string s, count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in th 阅读全文
posted @ 2017-12-27 18:37 一片叶子啊 阅读(216) 评论(0) 推荐(0) 编辑
摘要: Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array. Example 1: Note: Answer: 这里应用BFS的解法。网上还有一种 阅读全文
posted @ 2017-12-27 16:21 一片叶子啊 阅读(123) 评论(0) 推荐(0) 编辑
摘要: Invert a binary tree. to Solution: 阅读全文
posted @ 2017-09-11 14:55 一片叶子啊 阅读(101) 评论(0) 推荐(0) 编辑
摘要: Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might 阅读全文
posted @ 2017-09-11 14:05 一片叶子啊 阅读(136) 评论(0) 推荐(0) 编辑
摘要: Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of th 阅读全文
posted @ 2017-09-11 13:35 一片叶子啊 阅读(165) 评论(0) 推荐(0) 编辑
摘要: Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the or 阅读全文
posted @ 2017-09-08 17:28 一片叶子啊 阅读(121) 评论(0) 推荐(0) 编辑
摘要: Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are n 阅读全文
posted @ 2017-09-08 17:26 一片叶子啊 阅读(126) 评论(0) 推荐(0) 编辑
摘要: MDN上解释的很清楚, https://developer.mozilla.org/zh-CN/docs/Web/JavaScript/Reference/Global_Objects/Array/Reduce 这儿再记录一下: 定义: reduce() 方法对累加器和数组中的每个元素 (从左到右) 阅读全文
posted @ 2017-08-30 16:35 一片叶子啊 阅读(4670) 评论(0) 推荐(0) 编辑
摘要: 以下讨论的属性无论大小,收缩或者伸展,均是按照flex conntainer的主轴方向说的。 flex-grow: 是否允许flex item在多余空间内伸展。默认为0, 即不允许伸展。 flex-shrink: 是否允许flex item在flex container宽度收缩时自动收缩。默认为1, 阅读全文
posted @ 2017-06-19 16:54 一片叶子啊 阅读(122) 评论(0) 推荐(0) 编辑