ffgw
  • 首页
  • 归档
  • 分类
  • 标签
  • 友链
  • 关于
  • 首页
  • 归档
  • 分类
  • 标签
  • 友链
  • 关于
  • leetcode 22 Generat Parentheses

    Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n ...
     2018-03-12  
    • leetcode 
    阅读全文 
  • leetcode 162 Find Peak Element

    A peak element is an element that is greater than its neighbors. Given an input array where num[i] ≠ num[i+1], find a peak el...
     2018-03-12  
    • leetcode 
    阅读全文 
  • leetcode 287 Find the Duplicate Number

    Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one dupl...
     2018-03-12  
    • leetcode 
    阅读全文 
  • leetcode 238 Product of Array Except Self

    Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all ...
     2018-03-12  
    • leetcode 
    阅读全文 
  • leetcode 48. Rotate Image

    You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Note:You have to rotate t...
     2018-03-11  
    • leetcode 
    阅读全文 
  • leetcode 90 Subsets II

    Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The so...
     2018-03-11  
    • leetcode 
    阅读全文 
  • leetcode 228. Summary Ranges

    Given a sorted integer array without duplicates, return the summary of its ranges. Example 1: 123Input: [0,1,2,4,5,7]Output: ...
     2018-03-11  
    • leetcode 
    阅读全文 
  • leetcode 216 Combination Sum III

    Find all possible combinations of *k* numbers that add up to a number *n*, given that only numbers from 1 to 9 can be used an...
     2018-03-11  
    • leetcode 
    阅读全文 
  • leetcode 209 Minimum Size Subarray Sum

    Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the...
     2018-03-08  
    • leetcode 
    阅读全文 
  • leetcode 152&153 Find Minimum in Rotated Sorted Array

    Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might bec...
     2018-03-08  
    • leetcode 
    阅读全文 
上一页 下一页
© 2020 -  2021  z
由 Hexo 驱动 | 主题 Keep v3.4.3