ffgw
  • 首页
  • 归档
  • 分类
  • 标签
  • 友链
  • 关于
  • 首页
  • 归档
  • 分类
  • 标签
  • 友链
  • 关于
  • leetcode 152 Maximun Product Subarray

    Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, gi...
     2018-03-07  
    • leetcode 
    阅读全文 
  • leetcode solution 120 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. ...
     2018-03-07  
    • leetcode 
    阅读全文 
  • leetcode solution 106. Construct Binary Tree from Inorder and Postorder Traversal

    Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist ...
     2018-03-07  
    • leetcode 
    阅读全文 
  • leetcode solution 105 Construct Binary Tree from Preorder and Inorder Traversal

    Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist ...
     2018-03-07  
    • leetcode 
    阅读全文 
  • leetcode 79 word search

    Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially ad...
     2018-03-06  
    • leetcode 
    阅读全文 
  • leetcode 78 Subset

    Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain...
     2018-03-05  
    • leetcode 
    阅读全文 
  • leetcode 72 Search 2D Matrix

    Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integer...
     2018-03-05  
    • leetcode 
    阅读全文 
  • leetcode 73 Set Matrix zeros

    Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. Follow up: Did you use extra sp...
     2018-03-05  
    • leetcode 
    阅读全文 
  • leetcode 64 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...
     2018-03-05  
    • leetcode 
    阅读全文 
  • leetcode 39 Combination Sum

    Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where th...
     2018-03-04  
    • leetcode 
    阅读全文 
上一页 下一页
© 2020 -  2021  z
由 Hexo 驱动 | 主题 Keep v3.4.3