Glog

Aka G's Blog


  • 首页

  • 我的 GitBooks

  • 小型问题记录

  • 标签

  • 分类

  • 归档

  • 关于

  • 系分作业

  • 搜索

Leetcode 152. Maximum Product Subarray

发表于 2019-03-07 | 分类于 LeetCode | 评论数: | 阅读次数:

题目Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. Example 1: Input: [2,3,-2,4]Output: 6Explanation: [2,3] has the largest product 6. Example 2: Input: [-2,0,-1]Output: 0Explanation: The result cannot be 2, beca ...

阅读全文 »

Leetcode 264. Ugly Number II

发表于 2019-03-07 | 分类于 LeetCode | 评论数: | 阅读次数:

Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. Example: Input: n = 10Output: 12Explanation: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first 10 ugly numbers. Note: 1 is typically treated as an ugly number. n do ...

阅读全文 »

Leetcode 97. Interleaving String

发表于 2019-03-07 | 分类于 LeetCode | 评论数: | 阅读次数:

Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. Example 1: Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"Output: true Example 2: Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"Output: false 题解使用动态规划求 ...

阅读全文 »

Hello World

发表于 2018-09-21 | 评论数: | 阅读次数:

Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub. Quick StartCreate a new post$ hexo new "My New Post" More info: Writing Run server$ hexo server More info ...

阅读全文 »
123
Glog

Glog

不过是遇山开路,遇水搭桥罢了
24 日志
13 分类
29 标签
GitHub E-Mail
© 2021 Glog
由 Hexo 强力驱动 v3.8.0
|
主题 – NexT.Gemini v7.0.1
|