seyjs - 博客园

2019年4月8日

摘要：题目如下： A query word matches a given pattern if we can insert lowercaseletters to the pattern word so that it equals the query. (We may insert each char 阅读全文

posted @ 2019-04-08 21:53 seyjs 阅读(301) 评论(0) 推荐(0)

【leetcode】1022. Sum of Root To Leaf Binary Numbers

摘要：题目如下： Given a binary tree, each node has value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit. For e 阅读全文

posted @ 2019-04-08 21:48 seyjs 阅读(303) 评论(0) 推荐(0)

【leetcode】1021. Remove Outermost Parentheses

摘要：题目如下： A valid parentheses string is either empty (""), "(" + A + ")", or A + B, where A and B are valid parentheses strings, and + represents string c 阅读全文

posted @ 2019-04-08 21:47 seyjs 阅读(416) 评论(0) 推荐(0)

2019年4月1日

【leetcode】1020. Number of Enclaves

摘要：题目如下： Given a 2D array A, each cell is 0 (representing sea) or 1 (representing land) A move consists of walking from one land square 4-directionally t 阅读全文

posted @ 2019-04-01 15:45 seyjs 阅读(425) 评论(0) 推荐(0)

【leetcode】1019. Next Greater Node In Linked List

摘要：题目如下： We are given a linked list with head as the first node. Let's number the nodes in the list: node_1, node_2, node_3, ... etc. Each node may have 阅读全文

posted @ 2019-04-01 15:42 seyjs 阅读(620) 评论(0) 推荐(0)

【leetcode】1017. Convert to Base -2

摘要：题目如下： Given a number N, return a string consisting of "0"s and "1"s that represents its value in base -2 (negative two). The returned string must have 阅读全文

posted @ 2019-04-01 10:47 seyjs 阅读(548) 评论(0) 推荐(0)

【leetcode】1018. Binary Prefix Divisible By 5

摘要：题目如下： Given an array A of 0s and 1s, consider N_i: the i-th subarray from A[0] to A[i] interpreted as a binary number (from most-significant-bit to le 阅读全文

posted @ 2019-04-01 10:28 seyjs 阅读(463) 评论(0) 推荐(0)

【leetcode】331. Verify Preorder Serialization of a Binary Tree

摘要：题目如下： One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null 阅读全文

posted @ 2019-04-01 10:24 seyjs 阅读(110) 评论(0) 推荐(0)

2019年3月31日

【leetcode】399. Evaluate Division

摘要：题目如下： Equations are given in the format A / B = k, whereA and B are variables represented as strings, and k is a real number (floating point number). 阅读全文

posted @ 2019-03-31 16:56 seyjs 阅读(113) 评论(0) 推荐(0)

2019年3月30日

【leetcode】109. Convert Sorted List to Binary Search Tree

摘要：题目如下： Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balance 阅读全文

posted @ 2019-03-30 09:22 seyjs 阅读(243) 评论(0) 推荐(0)

公告