marstorm08的博客_LeetCode算法题

Divide Two Integers

Divide two integers without using multiplication, division and mod operator. The idea is to use bit operations. The key point is carefully handling corner cases.public int divide(int dividend, i

leetcode

原创 2014-03-13 04:14:09 518 阅读

Jump Game II

Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal is to re

leetcode

原创 2014-01-20 14:24:34 631 阅读

Validate Binary Search Tree

Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's

leetcode

原创 2014-01-20 13:08:41 686 阅读

Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example,Given [0,1,0,2,1,0,1,3,2,1,2,1], retur

java

编程

leetcode

原创 2014-01-09 04:18:55 433 阅读

Populating Next Right Pointers in Each Node II

Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution still work?Note: You may only use constan

java

编程

leetcode

原创 2014-01-08 23:48:03 559 阅读

Search in Rotated Sorted Array

Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array return its inde

java

二分搜索

leetcode

原创 2014-01-07 02:55:10 467 阅读

Palindrome Partitioning

Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab",Return [ ["aa

java

leetcode

原创 2013-12-14 00:58:14 419 阅读

Gas Station

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 ne

java

leetcode

原创 2013-12-13 22:49:43 623 阅读

Insertion Sort List

Sort a linked list using insertion sort.把插入排序应用在linkedlist上面，做一点小小的变动，之前查找到需要改变位置的元素的时候从后往前一步一步挪，因为是singlelinkedlist，则需要从head开始比较，直到找到需要插入的位置。/** * Definition for singly-linked list. * public class

java

leetcode

原创 2013-12-12 23:38:07 370 阅读

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 [3,2,1]. DFS的题，感觉有点像是八皇后问题的变形。程序

java

leetcode

permutations

原创 2013-12-08 23:04:53 363 阅读

Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any

java

leetcode

原创 2013-12-07 00:09:36 450 阅读

Spiral Matrix

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]You should return

java

leetcode

原创 2013-12-05 23:17:12 311 阅读

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

java

leetcode

原创 2013-12-05 22:34:19 390 阅读

Rotate List

Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.1. 首先，需要先遍历一遍拿到

java

leetcode

原创 2013-12-03 23:54:08 434 阅读

Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [2,1,3,4,1,2,1,5,4],the contiguous subarray [4,1,2,1] has the large

java

leetcode

Maximum Subarray

原创 2013-12-03 09:36:19 339 阅读

Merge Sorted Array

Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space to hold additional elements from B. The number of elements initialized in A and

java

leetcode

原创 2013-12-01 23:36:01 256 阅读

Convert Sorted Array to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.一个变形的对数组的二分搜索/** * Definition for binary tree * public class TreeNode { * int val; * TreeNo

java

leetcode

原创 2013-12-01 23:17:23 451 阅读

Remove Element

Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.从头开始遍历，如果

java

leetcode

原创 2013-12-01 22:49:56 330 阅读

Binary Tree Inorder Traversal

二叉树非递归的中序遍历/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution

java

leetcode

原创 2013-12-01 22:17:47 309 阅读

Binary Tree Preorder Traversal

二叉树的非递归前序遍历需要一个栈来作为辅助存储/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public cl

java

leetcode

原创 2013-12-01 22:06:11 298 阅读

Populating Next Right Pointers in Each Node

Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.Initially, all next pointers are set to NULL.Note:You may only use co

java

leetcode

原创 2013-12-01 21:21:15 289 阅读

Unique Binary Search Trees

Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's.public class Solution { public int num

java

Unique

leetcode

原创 2013-11-01 03:12:21 365 阅读

Linked List Cycle

Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?CICT上有差不多的原题， 1. 初始化两个iterator都等于head，设为a，b。2. 每次迭代，a走一步，b走两步。3. 如果a或者b走到null那就说明链表没有环，返回fa

leetcode

原创 2013-11-01 02:55:11 374 阅读

SingleNumber

Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra mem

java

leetcode

SingleNumbe

原创 2013-10-31 11:35:50 320 阅读

Jump Game

Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position. Determine if you a

leetcode

原创 2013-09-18 10:48:46 666 阅读

Longest Substring Without Repeating Characters

题目要求：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", wh

leetcode string

原创 2013-08-04 12:53:12 461 阅读 1点赞

Median of Two Sorted Arrays

There are two sorted arrays A and B 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)).最简单的思路是用归并排序的第二步：merge, 但是这个算法的复杂度是O(

leetcode

原创 2013-08-04 10:12:34 544 阅读 1点赞

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

在云端

Divide Two Integers

Jump Game II

Validate Binary Search Tree

Trapping Rain Water

Populating Next Right Pointers in Each Node II

Search in Rotated Sorted Array

Palindrome Partitioning

Gas Station

Insertion Sort List

Permutations

Minimum Path Sum

Spiral Matrix

Unique Paths

Rotate List

Maximum Subarray

Merge Sorted Array

Convert Sorted Array to Binary Search Tree

Remove Element

Binary Tree Inorder Traversal

Binary Tree Preorder Traversal

Populating Next Right Pointers in Each Node

Unique Binary Search Trees

Linked List Cycle

SingleNumber

Jump Game

Longest Substring Without Repeating Characters

Median of Two Sorted Arrays