- 博客(13)
- 收藏
- 关注
RSS订阅原创 [leetcode]Longest Valid Parentheses
题目介绍： Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. For "(()", the longest valid parentheses substring
2016-02-25 14:52:48
290
原创 [LeetCode]Gray Code
题目描述： he gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n representing the total number of bits in the code, print the se
2015-12-08 15:45:20
374
原创 [leetcode]Maximum Gap
题目描述如下： Given an unsorted array, find the maximum difference between the successive elements in its sorted form. Try to solve it in linear time/space. Return 0 if the array contains less th
2015-06-24 21:37:23
414
原创 [LeetCode]Dungeon Game
题目描述如下： he demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was
2015-06-24 21:30:10
245
原创 [LeetCode]Largest Number
题目描述： Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330. Note: The resul
2015-05-19 22:22:18
241
原创 [LeetCode]Repeated DNA Sequences
题目描述： All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.
2015-05-19 21:34:39
256
原创 阿里巴巴java研发工程师面试经历分享
本人近期经历了阿里巴巴的面试，也接触了不同的面试官，说实话不同的面试官的面试风格是很不相同的，接下来就把自己在面试中被问到的题目描述一下： 首先，一面。经过多次面试后总结到所有的面试开头都会让你进行一个简单的自我介绍。我认为这个自我介绍大家一定要精心准备一下，在自我介绍的过程中要向面试官讲明自己的优势，引导面试官去问一些你认为自己掌握的比较好的东西。一面中面试官首先问了一下我的项目相关的东西，首
2015-05-11 18:18:42
3044
1
原创 [Leetcode]Triangle
题目描述：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the following triangle [ [2], [3,4],
2015-05-11 18:03:27
274
原创 [LeetCode]Sort List
题目描述如下： Sort a linked list in O(n log n) time using constant space complexity. 思路分析： 本题目实现对链表的排序，并且时间复杂度为O(n log n)，因此，就可以选择归并排序、快速排序或者是堆排序，但是快排和堆排序都需要随机访问链表中的某些位置，因此，对于链表不是很合适，于是最终采用归并排序的思
2015-04-26 14:05:22
304
原创 [leetCode]Remove Nth Node From End of List
题目描述如下： Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from
2015-04-24 21:02:38
264
原创 [LeetCode] Unique Paths and Unique Paths II
Unique Paths题目描述： A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. The robot
2015-04-22 17:53:13
260
原创 [leetCode]79(Word Search)
题目如下： Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or
2015-04-21 20:47:52
374
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人