随笔分类 -  ~~Leetcode~~

上一页 1 2 3 4 5 6 7 下一页
Leetcode Restore IP Addresses
摘要：Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given"25525511135",return["255.2... 阅读全文
posted @ 2014-06-23 18:14 OpenSoucre 阅读(132) 评论(0) 推荐(0)
Leetcode Reverse Linked List II
摘要：Reverse a linked list from positionmton. Do it in-place and in one-pass.For example:Given1->2->3->4->5->NULL,m= 2 andn= 4,return1->4->3->2->5->NULL.No... 阅读全文
posted @ 2014-06-23 17:16 OpenSoucre 阅读(139) 评论(0) 推荐(0)
Leetcode 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 (size that is greater or equal... 阅读全文
posted @ 2014-06-23 17:02 OpenSoucre 阅读(115) 评论(0) 推荐(0)
Leetcode Convert Sorted List to Binary Search Tree
摘要：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.TreeNode *createSearchTree(ListNode *&hea... 阅读全文
posted @ 2014-06-23 16:06 OpenSoucre 阅读(167) 评论(0) 推荐(0)
Leetcode Convert Sorted Array to Binary Search Tree
摘要：Given an array where elements are sorted in ascending order, convert it to a height balanced BST.TreeNode *createSearchTree(vector& num, int left , in... 阅读全文
posted @ 2014-06-23 15:26 OpenSoucre 阅读(151) 评论(0) 推荐(0)
Leetcode 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 n... 阅读全文
posted @ 2014-06-23 14:48 OpenSoucre 阅读(123) 评论(0) 推荐(0)
Leetcode Binary Tree Level Order Traversal II
摘要：Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa... 阅读全文
posted @ 2014-06-23 14:11 OpenSoucre 阅读(130) 评论(0) 推荐(0)
Leetcode Binary Tree Zigzag Level Order Traversal
摘要：Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al... 阅读全文
posted @ 2014-06-23 14:06 OpenSoucre 阅读(153) 评论(0) 推荐(0)
Leetcode Binary Tree Level Order Traversal
摘要：Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2... 阅读全文
posted @ 2014-06-23 13:55 OpenSoucre 阅读(161) 评论(0) 推荐(0)
Leetcode Symmetric Tree
摘要：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ... 阅读全文
posted @ 2014-06-23 12:25 OpenSoucre 阅读(142) 评论(0) 推荐(0)
Leetcode Same Tree
摘要：Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical an... 阅读全文
posted @ 2014-06-23 12:19 OpenSoucre 阅读(111) 评论(0) 推荐(0)
Leetcode Unique Paths
摘要：A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ... 阅读全文
posted @ 2014-06-23 12:03 OpenSoucre 阅读(130) 评论(0) 推荐(0)
Leetcode Maximum Depth of Binary Tree
摘要：Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le... 阅读全文
posted @ 2014-06-22 23:21 OpenSoucre 阅读(132) 评论(0) 推荐(0)
Leetcode Minimum Path Sum
摘要：Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:Yo... 阅读全文
posted @ 2014-06-22 22:49 OpenSoucre 阅读(437) 评论(0) 推荐(0)
Leetcode Merge Two Sorted Lists
摘要：Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.简单的链表合并题L... 阅读全文
posted @ 2014-06-22 22:25 OpenSoucre 阅读(131) 评论(0) 推荐(0)
Leetcode Climbing Stairs
摘要：You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb... 阅读全文
posted @ 2014-06-22 22:14 OpenSoucre 阅读(132) 评论(0) 推荐(0)
Leetcode Triangle
摘要：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the fol... 阅读全文
posted @ 2014-06-22 21:35 OpenSoucre 阅读(306) 评论(0) 推荐(0)
leetcode Pascal's Triangle II
摘要：Given an indexk, return thekthrow of the Pascal's triangle.For example, givenk= 3,Return[1,3,3,1].Note:Could you optimize your algorithm to use onlyO(... 阅读全文
posted @ 2014-06-22 20:28 OpenSoucre 阅读(513) 评论(0) 推荐(0)
Leetcode Pascal's Triangle
摘要：GivennumRows, generate the firstnumRowsof Pascal's triangle.For example, givennumRows= 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]... 阅读全文
posted @ 2014-06-22 20:01 OpenSoucre 阅读(130) 评论(0) 推荐(0)
leetcode Subsets
摘要：Given a set of distinct integers,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not co... 阅读全文
posted @ 2014-06-21 22:17 OpenSoucre 阅读(180) 评论(0) 推荐(0)

上一页 1 2 3 4 5 6 7 下一页