摘要： 根据like排序取的前91道题目 转载请注明出处 1. "leetcode 461. Hamming Distance" 2. "leetcode 617. Merge Two Binary Trees" 3. "leetcode 338. Counting Bits" 4. "leetcode 4 阅读全文

摘要： MySQL下载地址：http://dev.mysql.com/downloads/mysql/ Windows下安装MySQL 我下的是最新版的MySQL，解压后，目录如下： 1.进入dos的命令行，一定要用administrator进入。 2.进入MySQL的bin目录，输入mysqld –ins 阅读全文

摘要： ``` 有一堆石头，每块石头的重量都是正整数。 每一回合，从中选出任意两块石头，然后将它们一起粉碎。假设石头的重量分别为 x 和 y，且 x & stones) { int sum = 0; for (int i = 0; i 阅读全文

摘要： Given an array A of integers, for each integer A[i] we need to choose either x = K or x = K, and add x to A[i] (only once). After this process, we hav 阅读全文

摘要： Given an array A of integers, for each integer A[i] we may choose any x with K & A, int K) { int a = INT_MAX; int b = INT_MIN; for (int i = 0; i 阅读全文

摘要： Write an iterator that iterates through a run length encoded sequence. The iterator is initialized by RLEIterator(int[] A), where A is a run length en 阅读全文

摘要： Write a class StockSpanner which collects daily price quotes for some stock, and returns the span of that stock's price for the current day. The span 阅读全文

摘要： Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). bfs层序遍历整颗树。 阅读全文

摘要： Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2. You have the following 3 operations permitt 阅读全文

摘要： Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the pers 阅读全文