Wednesday, October 28, 2020

L 1135. Connecting Cities With Minimum Cost ----M ~~~~~练习MST的Kruskal实现

›
There are  N  cities numbered from 1 to  N . You are given  connections , where each  connections[i] = [city1, city2, cost]  represents the ...
Tuesday, October 27, 2020

272. Closest Binary Search Tree Value II -----------H ~~~~~！！！！！！！！！

›
Given a non-empty binary search tree and a target value, find  k  values in the BST that are closest to the target. Note: Given target value...

L 311. Sparse Matrix Multiplication ---------M

›
  Given two   sparse matrices   A   and   B , return the result of   AB . You may assume that  A 's column number is equal to  B 's ...

L 379. Design Phone Directory ---------M

›
Design a Phone Directory which supports the following operations:   get : Provide a number which is not assigned to anyone. check : Check if...

1585. Check If String Is Transformable With Substring Sort Operations ------ H ~~~

›
  Given two strings  s   and   t , you want to transform string  s   into string  t   using the following operation any number of times: Cho...
Saturday, October 24, 2020

L 333. Largest BST Subtree ------M

›
  Given the root of a binary tree, find the largest subtree, which is also a Binary Search Tree (BST), where the largest means subtree has t...

467. Unique Substrings in Wraparound String ------M ~~~~~~

›
  Consider the string   s   to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so   s   will look like this: ...