Veritas_des_Liberty

2018年11月19日

摘要： There is a brick wall in front of you. The wall is rectangular and has several rows of bricks. The bricks have the same height but different width. Yo 阅读全文

posted @ 2018-11-19 18:00 Veritas_des_Liberty 阅读(200) 评论(0) 推荐(0)

535. Encode and Decode TinyURL(rand and srand)

摘要： TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl and it returns a short URL such as http 阅读全文

posted @ 2018-11-19 12:16 Veritas_des_Liberty 阅读(291) 评论(0) 推荐(0)

525. Contiguous Array

摘要： Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1. Example 1: Example 2: Note: The length of the giv 阅读全文

posted @ 2018-11-19 10:41 Veritas_des_Liberty 阅读(218) 评论(0) 推荐(0)

500. Keyboard Row

摘要： Given a List of words, return the words that can be typed using letters of alphabet on only one row's of American keyboard like the image below. Examp 阅读全文

posted @ 2018-11-19 09:11 Veritas_des_Liberty 阅读(200) 评论(0) 推荐(0)

463. Island Perimeter

摘要： You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/ve 阅读全文

posted @ 2018-11-19 08:09 Veritas_des_Liberty 阅读(207) 评论(0) 推荐(0)

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 阅读(180) 评论(0) 推荐(0)

Veritas des Liberty

公告