半日闲的博客

Given 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 of every node never diffe

Given an array of strings, return all groups of strings that are anagrams. 注意 All inputs will be in lower-case 样例 Given a string list: ["lint","intl","inlt","code"] return ["l

For given numbers a and b in function aplusb, return the sum of them. 注意 You don't need to parse the input and output. Just calculate and return. 样例 If a=1 and b=2 return 3 挑战

Given a binary tree, return the inorder traversal of its nodes' values. 样例 Given binary tree {1,#,2,3}, 1 \ 2 / 3   return [1,3,2]. 挑战 Can you do it with

Binary search is a famous question in algorithm. For a given sorted array (ascending order) and a target number, find the first index of this number in O(log n) time complexity. If the target nu

Given n items with size A[i], an integer m denotes the size of a backpack. How full you can fill this backpack?  注意 You can not divide any item into small pieces. 样例 If we have 4 items

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list. 解题思路： 思路一：创建链表拷贝，同时使用一个Map存

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled uniquely. We use # as a separator for ea

Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. 注意 You may n

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be chosen from C unlimited numb

Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target. Note Elements i

【书本上的算法往往讲得非常复杂，我和我的朋友计划用一些简单通俗的例子来描述算法的流程】 匈牙利算法是由匈牙利数学家Edmonds于1965年提出，因而得名。匈牙利算法是基于Hall定理中充分性证明的思想，它是部图匹配最常见的算法，该算法的核心就是寻找增广路径，它是一种用增广路径求二分图最大匹配的算法。 -------等等，看得头大？那么请看下面的版本： 通

转自：http://blog.codinglabs.org/articles/how-web-analytics-data-collection-system-work.html 网站数据统计分析工具是网站站长和运营人员经常使用的一种工具，比较常用的有谷歌分析、百度统计和腾讯分析等等。所有这些统计分析工具的第一步都是网站访问数据的收集。目前主流的数据收集方式基本都是基于javas