绿树荫

摘要： Implement regular expression matching with support for'.'and'*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The... 阅读全文

摘要： Determine whether an integer is a palindrome. Do this without extra space.思路：将原数字从各位数字开始拆分成两部分，最终比较两个数字的大小即可。public boolean isPalindromeII(int x) { ... 阅读全文

摘要： Implementatoito convert a string to an integer.Hint:Carefully consider all possible input cases. If you want a challenge, please do not see below and ... 阅读全文

摘要： Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa... 阅读全文

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

摘要： Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes... 阅读全文

摘要： There areNgas stations along a circular route, where the amount of gas at stationiisgas[i].You have a car with an unlimited gas tank and it costscost[... 阅读全文

摘要： Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as00000010100101000001111010011100), return ... 阅读全文

摘要： 基本思想：将两个（或两个以上）有序表合并成一个新的有序表，即把待排序序列分为若干个子序列，每个子序列是有序的。然后再把有序子序列合并为整体有序序列。算法分析：时间复杂度：各种情况下都是O(nlgn)空间复杂度：需要一个辅助向量来暂存两有序子文件归并的结果，故其辅助空间复杂度为O(n)稳定性：稳定Ja... 阅读全文

摘要： 基本思想：通过一趟排序将待排序记录分割成独立的两部分，其中一部分记录的关键字均比另一部分关键字小，则分别对这两部分继续进行排序，直到整个序列有序。算法分析：时间复杂度：O(nlgn)(平均)，O(nlgn)(最好)，O(n^2)(最坏)空间复杂度：O(nlgn)稳定性：不稳定Java实现： 1 im... 阅读全文