2020年1月30日
1302. Deepest Leaves Sum
摘要： 1302. Deepest Leaves Sum Given a binary tree, return the sum of values of its deepest leaves. Example 1: Input: root = [1,2,3,4,5,null,6,7,null,null,n 阅读全文
posted @ 2020-01-30 12:20 Schwifty 阅读(199) 评论(0) 推荐(0)
1335. Minimum Difficulty of a Job Schedule
摘要： You want to schedule a list of jobs in d days. Jobs are dependent (i.e To work on the i-th job, you have to finish all the jobs j where 0 <= j < i). Y 阅读全文
posted @ 2020-01-30 11:38 Schwifty 阅读(731) 评论(0) 推荐(0)
1328. Break a Palindrome
摘要： Given a palindromic string palindrome, replace exactly one character by any lowercase English letter so that the string becomes the lexicographically 阅读全文
posted @ 2020-01-30 02:34 Schwifty 阅读(259) 评论(0) 推荐(0)