seyjs - 博客园

2019年6月15日

【leetcode】1038. Binary Search Tree to Greater Sum Tree

摘要：题目如下： Given the root of a binary search tree with distinct values, modify it so that every node has a new value equal to the sum of the values of the 阅读全文

posted @ 2019-06-15 06:18 seyjs 阅读(426) 评论(0) 推荐(0)

【leetcode】1080. Insufficient Nodes in Root to Leaf Paths

摘要：题目如下： Given the root of a binary tree, consider all root to leaf paths: paths from the root to any leaf. (A leaf is a node with no children.) A node i 阅读全文

posted @ 2019-06-15 06:14 seyjs 阅读(507) 评论(0) 推荐(0)

【leetcode】1072. Flip Columns For Maximum Number of Equal Rows

摘要：题目如下： Given a matrix consisting of 0s and 1s, we may choose any number of columns in the matrix and flip every cell in that column. Flipping a cell ch 阅读全文

posted @ 2019-06-15 06:08 seyjs 阅读(434) 评论(0) 推荐(0)

【leetcode】1079. Letter Tile Possibilities

摘要：题目如下： You have a set of tiles, where each tile has one letter tiles[i]printed on it. Return the number of possible non-empty sequences of letters you 阅读全文

posted @ 2019-06-15 06:00 seyjs 阅读(821) 评论(0) 推荐(0)

【leetcode】1081. Smallest Subsequence of Distinct Characters

摘要：题目如下： Return the lexicographically smallest subsequence of text that contains all the distinct characters of text exactly once. Example 1: Example 2: 阅读全文

posted @ 2019-06-15 05:57 seyjs 阅读(435) 评论(0) 推荐(0)

2019年6月11日

【leetcode】1078. Occurrences After Bigram

摘要：题目如下： Given words first and second, consider occurrences in some text of the form "first second third", where second comes immediately after first, an 阅读全文

posted @ 2019-06-11 16:47 seyjs 阅读(406) 评论(0) 推荐(0)

【leetcode】1073. Adding Two Negabinary Numbers

摘要：题目如下： Given two numbers arr1 and arr2 in base -2, return the result of adding them together. Each number is given in array format: as an array of 0s a 阅读全文

posted @ 2019-06-11 16:27 seyjs 阅读(387) 评论(0) 推荐(0)

2019年6月10日

【leetcode】1071. Greatest Common Divisor of Strings

摘要：题目如下： For strings S and T, we say "T divides S" if and only if S = T + ... + T (T concatenated with itself 1 or more times) Return the largest string 阅读全文

posted @ 2019-06-10 09:58 seyjs 阅读(479) 评论(0) 推荐(0)

2019年5月31日

【leetcode】449. Serialize and Deserialize BST

摘要：题目如下： Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffe 阅读全文

posted @ 2019-05-31 16:55 seyjs 阅读(278) 评论(0) 推荐(0)

【leetcode】1039. Minimum Score Triangulation of Polygon

摘要：题目如下： Given N, consider a convex N-sided polygon with vertices labelled A[0], A[i], ..., A[N-1] in clockwise order. Suppose you triangulate the polygo 阅读全文

posted @ 2019-05-31 16:05 seyjs 阅读(362) 评论(0) 推荐(0)

公告