seyjs - 博客园

2019年8月19日

摘要：题目如下： Given a string date representing a Gregorian calendar date formatted as YYYY-MM-DD, return the day number of the year. Example 1: Example 2: Exa 阅读全文

posted @ 2019-08-19 13:44 seyjs 阅读(388) 评论(0) 推荐(0)

【leetcode】1160. Find Words That Can Be Formed by Characters

摘要：题目如下： You are given an array of strings words and a string chars. A string is good if it can be formed by characters from chars (each character can on 阅读全文

posted @ 2019-08-19 13:41 seyjs 阅读(609) 评论(0) 推荐(0)

【leetcode】1161. Maximum Level Sum of a Binary Tree

摘要：题目如下： Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on. Return the smallest level X such that th 阅读全文

posted @ 2019-08-19 13:39 seyjs 阅读(401) 评论(0) 推荐(0)

【leetcode】1162. As Far from Land as Possible

摘要：题目如下： Given an N x N grid containing only values 0 and 1, where 0 represents water and 1 represents land, find a water cell such that its distance to 阅读全文

posted @ 2019-08-19 13:36 seyjs 阅读(701) 评论(3) 推荐(0)

【leetcode】1163. Last Substring in Lexicographical Order

摘要：题目如下： Given a string s, return the last substring of s in lexicographical order. Example 1: Example 2: Note: 解题思路：我的方法是找出s中的最大字符max_char，然后以max_char为分阅读全文

posted @ 2019-08-19 13:34 seyjs 阅读(758) 评论(0) 推荐(0)

2019年8月6日

【leetcode】1143. Longest Common Subsequence

摘要：题目如下： Given two strings text1 and text2, return the length of their longest common subsequence. A subsequence of a string is a new string generated fr 阅读全文

posted @ 2019-08-06 13:33 seyjs 阅读(415) 评论(0) 推荐(0)

2019年8月5日

【leetcode】1147. Longest Chunked Palindrome Decomposition

摘要：题目如下： Return the largest possible k such that there exists a_1, a_2, ..., a_k such that: Each a_i is a non-empty string; Their concatenation a_1 + a_2 阅读全文

posted @ 2019-08-05 16:32 seyjs 阅读(479) 评论(0) 推荐(0)

【leetcode】1146. Snapshot Array

摘要：题目如下： Implement a SnapshotArray that supports the following interface: SnapshotArray(int length) initializes an array-like data structure with the giv 阅读全文

posted @ 2019-08-05 16:02 seyjs 阅读(627) 评论(0) 推荐(0)

【leetcode】1138. Alphabet Board Path

摘要：题目如下： On an alphabet board, we start at position (0, 0), corresponding to character board[0][0]. Here, board = ["abcde", "fghij", "klmno", "pqrst", "u 阅读全文

posted @ 2019-08-05 15:32 seyjs 阅读(554) 评论(0) 推荐(0)

【leetcode】1137. N-th Tribonacci Number

摘要：题目如下： The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2for n >= 0. Given n, return the value of Tn 阅读全文

posted @ 2019-08-05 11:46 seyjs 阅读(293) 评论(0) 推荐(0)

公告