hcx2013
- 浏览: 88714 次
-
最新评论
-
hcx2013：
mircle 写道Given nums = [1, 2, 1, ...
Single Number III -
mircle：
Given nums = [1, 2, 1, 3, 2, 5， ...
Single Number III -
hcx2013：
恩，可以，代码更简洁
空格替换 -
QuarterLifeForJava：
这样可以吗？
public static void main( ...
空格替换 -
hcx2013：
这个2是指多出2位，按你的理解可以这么改：int len = ...
空格替换
文章列表
Sort a linked list in O(n log n) time using constant space complexity.
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode sortList(ListNode he ...
Insertion Sort List
- 博客分类：
- leetcode
Sort a linked list using insertion sort.
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode insertionSortList(ListNode head) {
if (he ...
Given a binary tree, return the postorder traversal of its nodes' values.
For example:Given binary tree {1,#,2,3},
1
\
2
/
3
return [3,2,1].
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeN ...
Given a binary tree, return the preorder traversal of its nodes' values.
For example:Given binary tree {1,#,2,3},
1
\
2
/
3
return [1,2,3].
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNo ...
Reorder List
- 博客分类：
- leetcode
Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
You must do this in-place without altering the nodes' values.
For example,Given {1,2,3,4}, reorder it to {1,4,2,3}.
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ...
Linked List Cycle II
- 博客分类：
- leetcode
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
pu ...
Linked List Cycle
- 博客分类：
- leetcode
Given a linked list, determine if it has a cycle in it.
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public boolea ...
Word Break II
- 博客分类：
- leetcode
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.
Return all such possible sentences.
For example, givens = "catsanddog",dict = ["cat", "cats", "and", "sand", " ...
Word Break
- 博客分类：
- leetcode
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.
For example, givens = "leetcode",dict = ["leet", "code"].
Return true because "leetcode" can be segmented as &qu ...
Number of Islands
- 博客分类：
- leetcode
Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.
Example 1:
11110110101100000000
Answer: ...
Single Number
- 博客分类：
- leetcode
Given an array of integers, every element appears twice except for one. Find that single one.
public class Solution {
public int singleNumber(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int res = 0;
for (int i = 0; i < n ...
There are N children standing in a line. Each child is assigned a rating value.
You are giving candies to these children subjected to the following requirements:
Each child must have at least one candy.
Children with a higher rating get more candies than their neighbors.
What is the minimum ca ...
Gas Station
- 博客分类：
- leetcode
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 its next station (i+1). You begin the journey with an empty tank at one of the gas stations.
Return the ...
Clone Graph
- 博客分类：
- leetcode
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 node, and , as a separator for node label and each neighbor of the node.
As an example, consider t ...
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",Return 1 since the palindrome partitioning ["aa","b"] could be produced using 1 cu ...