seyjs - 博客园

2020年1月20日

【leetcode】1325. Delete Leaves With a Given Value

摘要：题目如下： Given a binary tree root and an integer target, delete all the leaf nodes with value target. Note that once you delete a leaf node with value ta 阅读全文

posted @ 2020-01-20 14:52 seyjs 阅读(233) 评论(0) 推荐(0) 编辑

【leetcode】1324. Print Words Vertically

摘要：题目如下： Given a string s. Return all the words vertically in the same order in which they appear in s.Words are returned as a list of strings, complete 阅读全文

posted @ 2020-01-20 14:10 seyjs 阅读(484) 评论(0) 推荐(0) 编辑

【leetcode】1323. Maximum 69 Number

摘要：题目如下： Given a positive integer num consisting only of digits 6 and 9. Return the maximum number you can get by changing at most one digit (6 becomes 9 阅读全文

posted @ 2020-01-20 14:04 seyjs 阅读(393) 评论(0) 推荐(0) 编辑

2020年1月17日

【leetcode】1320. Minimum Distance to Type a Word Using Two Fingers

摘要：题目如下： You have a keyboard layout as shown above in the XY plane, where each English uppercase letter is located at some coordinate, for example, the l 阅读全文

posted @ 2020-01-17 11:24 seyjs 阅读(440) 评论(0) 推荐(0) 编辑

【leetcode】1319. Number of Operations to Make Network Connected

摘要：题目如下： There are n computers numbered from 0 to n-1 connected by ethernet cables connections forming a network where connections[i] = [a, b] represents 阅读全文

posted @ 2020-01-17 11:02 seyjs 阅读(535) 评论(0) 推荐(0) 编辑

【leetcode】1318. Minimum Flips to Make a OR b Equal to c

摘要：题目如下： Given 3 positives numbers a, b and c. Return the minimum flips required in some bits of a and b to make ( a OR b == c ). (bitwise OR operation). 阅读全文

posted @ 2020-01-17 10:53 seyjs 阅读(183) 评论(0) 推荐(0) 编辑

【leetcode】1317. Convert Integer to the Sum of Two No-Zero Integers

摘要：题目如下： Given an integer n. No-Zero integer is a positive integer which doesn't contain any 0 in its decimal representation. Return a list of two intege 阅读全文

posted @ 2020-01-17 10:47 seyjs 阅读(240) 评论(0) 推荐(0) 编辑

2020年1月12日

【leetcode】1316. Distinct Echo Substrings

摘要：题目如下： Return the number of distinct non-empty substrings of text that can be written as the concatenation of some string with itself. Example 1: Input 阅读全文

posted @ 2020-01-12 19:44 seyjs 阅读(356) 评论(0) 推荐(0) 编辑

【leetcode】1315. Sum of Nodes with Even-Valued Grandparent

摘要：题目如下： Given a binary tree, return the sum of values of nodes with even-valued grandparent. (A grandparent of a node is the parent of its parent, if it 阅读全文

posted @ 2020-01-12 17:22 seyjs 阅读(456) 评论(0) 推荐(0) 编辑

【leetcode】1314. Matrix Block Sum

摘要：题目如下： Given a m * n matrix mat and an integer K, return a matrix answer where each answer[i][j] is the sum of all elements mat[r][c] for i - K <= r <= 阅读全文

posted @ 2020-01-12 17:13 seyjs 阅读(619) 评论(0) 推荐(0) 编辑

公告