Veritas_des_Liberty

2019年2月15日

摘要： Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: Note: Approach #1: My code. [C++] Appro 阅读全文

posted @ 2019-02-15 21:59 Veritas_des_Liberty 阅读(247) 评论(0) 推荐(0) 编辑

221. Maximal Square

摘要： Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area. Example: Approach #1: DP. [C++] Ana 阅读全文

posted @ 2019-02-15 21:49 Veritas_des_Liberty 阅读(214) 评论(0) 推荐(0) 编辑

213. House Robber II

摘要： You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are ar 阅读全文

posted @ 2019-02-15 20:23 Veritas_des_Liberty 阅读(225) 评论(0) 推荐(0) 编辑

198. House Robber

摘要： You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文

posted @ 2019-02-15 20:05 Veritas_des_Liberty 阅读(206) 评论(0) 推荐(0) 编辑

2019年2月14日

152. Maximum Product Subarray

摘要： Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. Example 1: E 阅读全文

posted @ 2019-02-14 23:34 Veritas_des_Liberty 阅读(187) 评论(0) 推荐(0) 编辑

2019年2月12日

139. Word Break

摘要： Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequ 阅读全文

posted @ 2019-02-12 23:31 Veritas_des_Liberty 阅读(237) 评论(0) 推荐(0) 编辑

132. Palindrome Partitioning II

摘要： Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning 阅读全文

posted @ 2019-02-12 22:48 Veritas_des_Liberty 阅读(247) 评论(0) 推荐(0) 编辑

120. Triangle

摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo 阅读全文

posted @ 2019-02-12 22:16 Veritas_des_Liberty 阅读(201) 评论(0) 推荐(0) 编辑

2019年2月11日

115. Distinct Subsequences

摘要： Given a string S and a string T, count the number of distinct subsequences of S which equals T. A subsequence of a string is a new string which is for 阅读全文

posted @ 2019-02-11 22:40 Veritas_des_Liberty 阅读(166) 评论(0) 推荐(0) 编辑

97. Interleaving String

摘要： Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. Example 1: Example 2: Approach #1: DP. [C++] Analysis: status: match[s1L 阅读全文

posted @ 2019-02-11 22:13 Veritas_des_Liberty 阅读(227) 评论(0) 推荐(0) 编辑

Veritas des Liberty

公告