摘要： Referred from http://blog.csdn.net/yapian8/article/details/28240973 分治算法 一、基本概念 在计算机科学中，分治法是一种很重要的算法。字面上的解释是“分而治之”，就是把一个复杂的问题分成两个或更多的相同或相似的子问题，再把子问题分成 阅读全文

摘要： Given string A representative a positive integer which has N digits, remove any k digits of the number, the remaining digits are arranged according to 阅读全文

摘要： Given a list of non negative integers, arrange them such that they form the largest number. Notice The result may be very large, so you need to return 阅读全文

摘要： Given n pieces of wood with length L[i] (integer array). Cut them into small pieces to guarantee you could have equal or more than k pieces with the s 阅读全文

摘要： Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two n 阅读全文

摘要： Given two strings, find the longest common substring. Return the length of it. Notice The characters in substring should occur continuously in origina 阅读全文

摘要： Given an array of integers, find a contiguous subarray which has the largest sum. Notice The subarray should contain at least one number. Example Give 阅读全文

摘要： 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 阅读全文

摘要： Convert a binary search tree to doubly linked list with in-order traversal. Have you met this question in a real interview? Yes Convert a binary searc 阅读全文

摘要： Calculate the an % b where a, b and n are all 32bit integers. Analyse: divide and conquer. Be aware of overflow. Runtime: 12ms 阅读全文