• 博客园logo
  • 会员
  • 众包
  • 新闻
  • 博问
  • 闪存
  • 赞助商
  • HarmonyOS
  • Chat2DB
    • 搜索
      所有博客
    • 搜索
      当前博客
  • 写随笔 我的博客 短消息 简洁模式
    用户头像
    我的博客 我的园子 账号设置 会员中心 简洁模式 ... 退出登录
    注册 登录
lychnis
博客园 | 首页 | 新随笔 | 新文章 | 联系 | 订阅 订阅 | 管理
上一页 1 2 3 4 5 6 7 ··· 9 下一页

2019年11月3日

56. Merge Intervals
摘要: Given a collection of intervals, merge all overlapping intervals. Example 1: Example 2: NOTE: input types have been changed on April 15, 2019. Please 阅读全文
posted @ 2019-11-03 20:55 lychnis 阅读(115) 评论(0) 推荐(0)
 
55. Jump Game
摘要: Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
posted @ 2019-11-03 17:07 lychnis 阅读(110) 评论(0) 推荐(0)
 
34. Find First and Last Position of Element in Sorted Array
摘要: Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime com 阅读全文
posted @ 2019-11-03 16:45 lychnis 阅读(114) 评论(0) 推荐(0)
 
33. Search 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 become [4,5,6,7,0,1,2]). Y 阅读全文
posted @ 2019-11-03 16:00 lychnis 阅读(98) 评论(0) 推荐(0)
 
3. Longest Substring Without Repeating Characters
摘要: Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer 阅读全文
posted @ 2019-11-03 11:56 lychnis 阅读(92) 评论(0) 推荐(0)
 
2. Add Two Numbers
摘要: You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contai 阅读全文
posted @ 2019-11-03 11:22 lychnis 阅读(113) 评论(0) 推荐(0)
 
 

2019年10月29日

89. Gray Code
摘要: The gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n representing the total num 阅读全文
posted @ 2019-10-29 22:59 lychnis 阅读(97) 评论(0) 推荐(0)
 
 

2019年10月28日

22. Generate Parentheses
摘要: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: [ 阅读全文
posted @ 2019-10-28 23:09 lychnis 阅读(114) 评论(0) 推荐(0)
 
 

2019年10月27日

11. Container With Most Water
摘要: Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endp 阅读全文
posted @ 2019-10-27 22:21 lychnis 阅读(106) 评论(0) 推荐(0)
 
50. Pow(x, n)
摘要: 50. Pow(x, n) Medium 10082426FavoriteShare 50. Pow(x, n) Medium 10082426FavoriteShare Medium Implement pow(x, n), which calculates x raised to the pow 阅读全文
posted @ 2019-10-27 21:50 lychnis 阅读(131) 评论(0) 推荐(0)
 
 
上一页 1 2 3 4 5 6 7 ··· 9 下一页

公告


博客园  ©  2004-2025
浙公网安备 33010602011771号 浙ICP备2021040463号-3