匡子语

摘要： 想实现书上倒排索引的例子，但是我不会java想用C++写，如果用hadoop streaming 那么输入必须是标准输入的形式， 那么我怎么获得每个文件的文件名呢？查了一下，还有一种方法叫做hadoop pipes 也是可以用来支持C++的，但是怎么用我还不懂 阅读全文

摘要： 看了几篇博文，感觉还是云里雾里的。http://blog.csdn.net/opennaive/article/details/7514146http://www.aboutyun.com/thread-6723-1-1.htmlhttp://blog.csdn.net/thomas0yang/ar... 阅读全文

摘要： 网上看到的：We want to count all the books in the library. You count up shelf #1, I count up shelf #2. That's map. The more people we get, the faster it goe... 阅读全文

摘要： There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be ... 阅读全文

摘要： Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.思路：我自己的，每次找k个元素的最小的接在答案链表的后面。结果超时了。 ListNode *merge... 阅读全文

摘要： Given an array of sizen, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋times.You may assume that the arr... 阅读全文

摘要： Sort a linked list inO(nlogn) time using constant space complexity.思路：用归并排序。设输入链表为S，则先将其拆分为前半部分链表A，后半部分链表B。注意，要把A链表的末尾置为NULL。即要把链表划分为两个独立的部分，防止后面错乱。#i... 阅读全文

摘要： Given an array withnobjects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, wh... 阅读全文

摘要： Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))... 阅读全文

摘要： The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integernrepresenting the total number... 阅读全文