懒猫欣 - 博客园

2013年10月6日

摘要： Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram. Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3].The largest rectangle is shown in the shaded area, which ha 阅读全文

posted @ 2013-10-06 02:04 懒猫欣阅读(161) 评论(0) 推荐(0)

LeetCode-Word Break

摘要： 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 "l 阅读全文

posted @ 2013-10-06 00:40 懒猫欣阅读(283) 评论(0) 推荐(0)

2013年10月5日

LeetCode-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 [1,2,3,6,9,8,7,4,5].class Solution {public: vector spiralOrder(vector > &matrix) { // No... 阅读全文

posted @ 2013-10-05 23:11 懒猫欣阅读(164) 评论(0) 推荐(0)

LeetCode-Spiral Matrix II

摘要： Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order. For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5 ]]n,n-1,n-1,n-2,n-2......,2,2,1,1class Solution {public: vector > generateMatrix(int n) { // ... 阅读全文

posted @ 2013-10-05 22:55 懒猫欣阅读(140) 评论(0) 推荐(0)

LeetCode-Binary Tree Zigzag Level Order Traversal

摘要： Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20 / \ 15 7 return its zigzag level order traversal as:[ ... 阅读全文

posted @ 2013-10-05 22:37 懒猫欣阅读(212) 评论(0) 推荐(0)

LeetCode-Multiply Strings

摘要： Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.class Solution {public: void Plus(string& a,string& b,string& temp){ int small=min(a.length(),b.length()); bool flag=false; ... 阅读全文

posted @ 2013-10-05 21:58 懒猫欣阅读(161) 评论(0) 推荐(0)

LeetCode-Copy List with Random Pointer

摘要： A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.class Solution {public: RandomListNode *copyRandomList(RandomListNode *head) { // Note: The Solution object is instantiated only... 阅读全文

posted @ 2013-10-05 19:23 懒猫欣阅读(328) 评论(0) 推荐(0)

LeetCode-Pascal's Triangle II

摘要： Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use only O(k) extra space?class Solution {public: vector getRow(int rowIndex) { // Note: The Solution object is instantiated only once and is r... 阅读全文

posted @ 2013-10-05 18:46 懒猫欣阅读(119) 评论(0) 推荐(0)

LeetCode-Pascal's Triangle

摘要： Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]class Solution {public: vector > generate(int numRows) { // Note: The Solution object is instantiated only once and is reused by each... 阅读全文

posted @ 2013-10-05 18:35 懒猫欣阅读(111) 评论(0) 推荐(0)

LeetCode-Search a 2D Matrix

摘要： Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each row is greater than the last integer of the previous row.For example,Consider the following matrix:[ [1, .. 阅读全文

posted @ 2013-10-05 18:27 懒猫欣阅读(173) 评论(0) 推荐(0)

公告