LeetCode
liuhmmjj
对计算机编程很有兴趣
展开
-
Valid Palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is no原创 2015-03-16 17:00:33 · 780 阅读 · 0 评论 -
Merge Intervals
Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].» Solve this problem区间合并 和 求最长区间 一样,关键在于原创 2015-03-16 18:38:24 · 728 阅读 · 0 评论 -
Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of原创 2015-03-16 16:28:10 · 847 阅读 · 1 评论 -
Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additio原创 2015-07-19 12:30:56 · 885 阅读 · 0 评论 -
把数组排成最大的数
问题描述:输入一个正整数数组,把数组里的所有数字拼接起来排成一个数,打印能拼接出的所有数字中最大的一个。例如输入数组{17,9,94,6},则打印出994617.思路:使用字符串来处理。把m和n拼接成的mn和nm按照字符串大小的比较规则来处理即可。如果mn 代码:package interview.sort;import java.util.Arrays原创 2016-09-14 21:51:46 · 6756 阅读 · 1 评论