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

2019年12月13日

141. Linked List Cycle
摘要: Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked list, we use an integer pos which represents the posi 阅读全文
posted @ 2019-12-13 13:01 lychnis 阅读(157) 评论(0) 推荐(0)
 
139. Word Break
摘要: Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequ 阅读全文
posted @ 2019-12-13 12:39 lychnis 阅读(97) 评论(0) 推荐(0)
 
 

2019年12月12日

617. Merge Two Binary Trees
摘要: Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are n 阅读全文
posted @ 2019-12-12 22:38 lychnis 阅读(180) 评论(0) 推荐(0)
 
739. Daily Temperatures
摘要: Given a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warme 阅读全文
posted @ 2019-12-12 21:46 lychnis 阅读(230) 评论(0) 推荐(0)
 
 

2019年12月7日

671. Second Minimum Node In a Binary Tree
摘要: Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. 阅读全文
posted @ 2019-12-07 19:35 lychnis 阅读(222) 评论(0) 推荐(0)
 
 

2019年12月5日

945. Minimum Increment to Make Array Unique
摘要: 945. Minimum Increment to Make Array Unique Medium 25111FavoriteShare 945. Minimum Increment to Make Array Unique Medium 25111FavoriteShare Medium Giv 阅读全文
posted @ 2019-12-05 23:03 lychnis 阅读(122) 评论(0) 推荐(0)
 
 

2019年12月2日

1016. Binary String With Substrings Representing 1 To N
摘要: Given a binary string S (a string consisting only of '0' and '1's) and a positive integer N, return true if and only if for every integer X from 1 to 阅读全文
posted @ 2019-12-02 23:13 lychnis 阅读(109) 评论(0) 推荐(0)
 
 

2019年12月1日

315. Count of Smaller Numbers After Self
摘要: You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smal 阅读全文
posted @ 2019-12-01 22:54 lychnis 阅读(155) 评论(0) 推荐(0)
 
 

2019年11月30日

429. N-ary Tree Level Order Traversal
摘要: Given an n-ary tree, return the level order traversal of its nodes' values. Nary-Tree input serialization is represented in their level order traversa 阅读全文
posted @ 2019-11-30 23:28 lychnis 阅读(113) 评论(0) 推荐(0)
 
590. N-ary Tree Postorder Traversal
摘要: Given an n-ary tree, return the postorder traversal of its nodes' values. Nary-Tree input serialization is represented in their level order traversal, 阅读全文
posted @ 2019-11-30 23:21 lychnis 阅读(160) 评论(0) 推荐(0)
 
 
下一页

公告


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