摘要：
There are N network nodes, labelled 1 to N. Given times, a list of travel times as directed edges times[i] = (u, v, w), where u is the source node, v 阅读全文
posted @ 2020-01-31 10:05
Schwifty
阅读(135)
评论(0)
推荐(0)
摘要：
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)
摘要：
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)
摘要：
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)
摘要：
Given the array restaurants where restaurants[i] = [idi, ratingi, veganFriendlyi, pricei, distancei]. You have to filter the restaurants using three f 阅读全文
posted @ 2020-01-29 14:28
Schwifty
阅读(190)
评论(0)
推荐(0)
摘要：
Given a string s consisting only of letters 'a' and 'b'. In a single step you can remove one palindromic subsequence from s. Return the minimum number 阅读全文
posted @ 2020-01-29 11:01
Schwifty
阅读(360)
评论(0)
推荐(0)
摘要：
Given an array of integers arr, replace each element with its rank. The rank represents how large the element is. The rank has the following rules: Ra 阅读全文
posted @ 2020-01-29 08:56
Schwifty
阅读(343)
评论(0)
推荐(0)
摘要：
Given a m * n matrix mat of integers, sort it diagonally in ascending order from the top-left to the bottom-right then return the sorted array. Exampl 阅读全文
posted @ 2020-01-29 08:20
Schwifty
阅读(337)
评论(0)
推荐(0)
摘要：
Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1. Example 1: Input: 123 Output: " 阅读全文
posted @ 2020-01-29 05:43
Schwifty
阅读(131)
评论(0)
推荐(0)
摘要：
Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defi 阅读全文
posted @ 2020-01-24 10:34
Schwifty
阅读(120)
评论(0)
推荐(0)
浙公网安备 33010602011771号