marstorm08的博客_数据库,网页&设计,机器学习

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 624 阅读

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 312 阅读

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 392 阅读

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 337 阅读

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 331 阅读

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 300 阅读

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 阅读

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

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

51CTO博客

在云端

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