2018年11月18日
Weekly Contest 111-------->943. Find the Shortest Superstring(can't understand)
摘要： Given an array A of strings, find any smallest string that contains each string in A as a substring. We may assume that no string in A is substring of 阅读全文
posted @ 2018-11-18 21:48 Veritas_des_Liberty 阅读(285) 评论(0) 推荐(0)
Weekly Contest 111-------->942. DI String Match
摘要： Given a string S that only contains "I" (increase) or "D" (decrease), let N = S.length. Return any permutation A of [0, 1, ..., N] such that for all i 阅读全文
posted @ 2018-11-18 20:51 Veritas_des_Liberty 阅读(250) 评论(0) 推荐(0)
Binary Tree Traversal
摘要： Preorder: Approach #1: Recurisive. Approach #2: Iteratively.[Java] Approach #3: Morris Traversal.[C++] Using Morris Traversal can don't use recurisive 阅读全文
posted @ 2018-11-18 18:20 Veritas_des_Liberty 阅读(233) 评论(0) 推荐(0)
Weekly Contest 111-------->944. Delete Columns to Make Sorted
摘要： We are given an array A of N lowercase letter strings, all of the same length. Now, we may choose any set of deletion indices, and for each string, we 阅读全文
posted @ 2018-11-18 12:30 Veritas_des_Liberty 阅读(286) 评论(0) 推荐(0)
Weekly Contest 111-------->941. Valid Mountain Array(max_element)
摘要： Given an array A of integers, return true if and only if it is a valid mountain array. Recall that A is a mountain array if and only if: A.length >= 3 阅读全文
posted @ 2018-11-18 12:29 Veritas_des_Liberty 阅读(182) 评论(0) 推荐(0)