博客园  :: 首页  :: 新随笔  :: 联系 ::  :: 管理


摘要:分析 难度 易 来源 https://leetcode.com/problems/maximum-subarray/description/ 题目 Given an integer array nums, find the contiguous subarray (containing at lea 阅读全文
posted @ 2018-10-17 16:30 flowingfog 阅读(142) 评论(0) 推荐(0) 编辑


摘要:分析 难度 易 来源 https://leetcode.com/problems/count-and-say/description/ 题目 The count-and-say sequence is the sequence of integers with the first five term 阅读全文
posted @ 2018-10-16 19:22 flowingfog 阅读(85) 评论(0) 推荐(0) 编辑


摘要:分析 难度 易 来源 https://leetcode.com/problems/search-insert-position/description/ 题目 Given a sorted array and a target value, return the index if the targe 阅读全文
posted @ 2018-10-15 21:02 flowingfog 阅读(189) 评论(0) 推荐(0) 编辑


摘要:分析 难度 易 来源 https://leetcode.com/problems/remove-element/description/ 题目 Given an array nums and a value val, remove all instances of that value in-pla 阅读全文
posted @ 2018-10-14 20:24 flowingfog 阅读(123) 评论(0) 推荐(0) 编辑

摘要:分析 难度:易 题目 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 list 阅读全文
posted @ 2018-10-14 18:48 flowingfog 阅读(101) 评论(0) 推荐(0) 编辑


摘要:Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Exampl 阅读全文
posted @ 2018-10-13 11:26 flowingfog 阅读(98) 评论(0) 推荐(0) 编辑

摘要:Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: No 阅读全文
posted @ 2018-10-13 10:53 flowingfog 阅读(82) 评论(0) 推荐(0) 编辑


摘要:Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, two is written as II in Roman numeral, just two one's 阅读全文
posted @ 2018-10-12 00:11 flowingfog 阅读(69) 评论(0) 推荐(0) 编辑


摘要:Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Example 1: Example 2: Example 3: 阅读全文
posted @ 2018-10-11 19:45 flowingfog 阅读(85) 评论(0) 推荐(0) 编辑


摘要:Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 20750 Accepted: 11563 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 20750 Acce 阅读全文
posted @ 2018-10-10 13:49 flowingfog 阅读(144) 评论(0) 推荐(0) 编辑