摘要：
博客迁移至 "www.hyrepo.com" 阅读全文
摘要：
题意 Implement pow(x, n). 求X的N次方。 解法 用正常的办法来做是会超时的，因为可能有21亿次方的情况，所以需要优化一下。这里用到了 算法，简单来说就是将指数分解成二进制的形式，比如X的7次方，就可以表示成 ，这里将7分解成了 的形式，这样做之后，乘法就只需要进行三次，所以要做 阅读全文
摘要：
题意 Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each 阅读全文
摘要：
题意 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 rep 阅读全文
摘要：
题意 The count and say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, ... 1 is read off as "one 1" or 11. 11 is rea 阅读全文
摘要：
题意 Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in 阅读全文
摘要：
题意 Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the 阅读全文
摘要：
题意 Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not pos 阅读全文
摘要：
题意 Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 将K个排好序的链表合并成一个 解法 和之前合并两个有序链表那题不同，那题用的是两个指针来分别记录 阅读全文
摘要：
题意 Given n pairs of parentheses, write a function to generate all combinations of well formed parentheses. For example, given n = 3, a solution set is 阅读全文