leetcode-java

[LeetCode-JAVA] Reverse Linked List I && II

题目I： Reverse a singly linked list   思路：建立三个指针，一个用来维护链表头，另外两个再循环中，维护head的前一位和保存反转的后一位。          逐个反转，首先反转前两个，然后把前两个看成是一个，继续循环反转下去。 代码： public class Solution {
·2015-05-19 20:00

[LeetCode-JAVA] Gray Code

题目： The 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
·2015-05-19 10:00

[LeetCode-JAVA] 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
·2015-05-18 17:00

[LeetCode-JAVA] Remove Duplicates from Sorted List II 优化版

题目： Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example,Given 1->2->3->3->4->4-&
·2015-05-18 16:00

[LeetCode-JAVA] Remove Duplicates from Sorted Array II

题目： Follow up for "Remove Duplicates":What if duplicates are allowed at most twice? For example,Given sorted array nums = [1,1,1,2,2,3], Your function should return le
·2015-05-17 20:00

[LeetCode-JAVA] Simplify Path

Given an absolute path for a file (Unix-style), simplify it. For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => &quo
·2015-05-15 10:00

[LeetCode-JAVA] Permutations

题目：Given a collection of numbers, return all possible permutations. For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and 
·2015-04-30 15:00

leetcode-java题解（每天更新）

说明：选用java，重在体会，性能不是最优。欢迎转载：http://www.ming-yue.cn/leetcode-java-solutions/。先给出一个leetcode的已有答案，为什么上来直接给出答案，因为这个好多答案写的都非常简洁，不太易懂，还是建议先自己做，答案只是参考http://www.ninechapter.com/solutions/。1，https://leetcode.c
韩来明·2015-03-09 11:00
上一页 1 2 3 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他