摘要：
［抄题］： Given a string S of digits, such as S = "123456579", we can split it into a Fibonacci-like sequence [123, 456, 579]. Formally, a Fibonacci-like 阅读全文
posted @ 2018-08-28 20:46
苗妙苗
阅读(403)
评论(0)
推荐(0)
摘要：
［抄题］： Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The 阅读全文
posted @ 2018-08-28 04:33
苗妙苗
阅读(531)
评论(0)
推荐(0)
摘要：
［抄题］： We have some permutation A of [0, 1, ..., N - 1], where N is the length of A. The number of (global) inversions is the number of i < j with 0 <= 阅读全文
posted @ 2018-08-28 04:19
苗妙苗
阅读(230)
评论(0)
推荐(0)
浙公网安备 33010602011771号