hechenghai

First Missing Positive My Submissions Question Total Accepted: 51712 Total Submissions: 224707 Difficulty: Hard Given an unsorted integer array, find the first missing positive int

题目为： Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 使用动态规划，可以将时间

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S I

Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the entire inp

Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers. Have you thought about this? Here are some good questions to ask before c

Determine whether an integer is a palindrome. Do this without extra space. public class Solution { public boolean isPalindrome(int x) { if(x<0)return false; int a = 1; int b = x;

Search Insert Position My Submissions Question Total Accepted: 79962 Total Submissions: 222866 Difficulty: Medium Given a sorted array and a target value, return the index if the t

4Sum My Submissions Question  Solution  Total Accepted: 50999 Total Submissions: 230927 Difficulty: Medium Given an array S of n integers, are there elements a, b, c, and d in S s

Roman to Integer My Submissions Question  Solution  Total Accepted: 56002 Total Submissions: 159037 Difficulty: Easy Given a roman numeral, convert it to an integer. Input is gua

Container With Most Water Total Accepted: 52276 Total Submissions: 163550 Difficulty: Medium Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinat

Integer to Roman My Submissions Question  Solution  Total Accepted: 44525 Total Submissions: 127649 Difficulty: Medium Given an integer, convert it to a roman numeral. Input is g

Longest Common Prefix My Submissions Question  Solution  Total Accepted: 68487 Total Submissions: 264798 Difficulty: Easy Write a function to find the longest common prefix string

There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 这个题目实际上就是先用快速排序进行合并，然后求中间

Substring with Concatenation of All Words My Submissions Question Total Accepted: 42899 Total Submissions: 215720 Difficulty: Hard You are given a string, s, and a list of words, w

转载地址：http://www.cnblogs.com/felixfang/p/3708999.html 开篇 通常的匹配分为两类，一种是正则表达式匹配，pattern包含一些关键字，比如'*'的用法是紧跟在pattern的某个字符后，表示这个字符可以出现任意多次(包括0次)。 另一种是通配符匹配，我们在操作系统里搜索文件的时候，用的就是这种匹配。比如 "*.pdf"，'

转载地址：http://blog.csdn.net/fengbingyang/article/details/12236121 实现浮点类型的幂运算，函数原型为: double pow(double x, int n) 下面介绍一下解决该问题的几种方法以及要注意的地方： 1)最直观容易想到的方法就是用递归方法求n个x的乘积，注意考虑n的正负号，时间复杂度为O(n)

Decode Ways My Submissions Question Total Accepted: 55371 Total Submissions: 330911 Difficulty: Medium A message containing letters from A-Z is being encoded to numbers using the

Jump Game II My Submissions Question Total Accepted: 52353 Total Submissions: 213392 Difficulty: Hard Given an array of non-negative integers, you are initially positioned at the f

Search in Rotated Sorted Array My Submissions Question Total Accepted: 76870 Total Submissions: 264831 Difficulty: Hard Suppose a sorted array is rotated at some pivot unknown to y

Search for a Range My Submissions Question Total Accepted: 62397 Total Submissions: 225032 Difficulty: Medium Given a sorted array of integers, find the starting and ending positio

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 is trying to reach the

转载地址：http://www.letiantian.me/2014-10-22-mahout-naive-bayes-newsgroups/ mahout版本是0.9；hadoop版本是1.2.1。 下载数据集20 newsgroups dataset，解压后得到20news-bydate目录： $ cp -R 20news-bydate/*/* 2

Search in Rotated Sorted Array II My Submissions Question Total Accepted: 50992 Total Submissions: 162671 Difficulty: Medium Follow up for "Search in Rotated Sorted Array": What i

Largest Rectangle in Histogram My Submissions Question Total Accepted: 49964 Total Submissions: 215334 Difficulty: Hard Given n non-negative integers representing the histogram

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled uniquely. We use # as a separator for each

https://oj.leetcode.com/problems/reorder-list/

点https://oj.leetcode.com/problems/binary-tree-postorder-traversal/接

https://oj.leetcode.com/problems/linked-list-cycle-ii/接

https://oj.leetcode.com/problems/word-break/

https://oj.leetcode.com/problems/binary-tree-preorder-traversal/

https://oj.leetcode.com/problems/linked-list-cycle/

https://oj.leetcode.com/problems/word-break-ii/ zh

https://oj.leetcode.com/problems/copy-list-with-random-pointer/

public class Solution { public int singleNumber(int [] A){ Arrays.sort(A); int n = A.length; for(int i=0;i<n-1;i+=3){ if(!(A[i]==A[i+1]&&A[i+1]==A[i+2])){ if(A[i]==A[i+1]){ return A

public class Solution { public int singleNumber(int [] A){ Arrays.sort(A); int n = A.length; for(int i=0;i<n-1;i+=2){ if(A[i]!=A[i+1]){ return A[i]; } } return A[n-1]; } }

https://oj.leetcode.com/problems/candy/

点击打开链接

Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s. For example, given s = "aab", Retu

There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to

https://oj.leetcode.com/problems/palindrome-partitioning/ Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome parti