Veritas_des_Liberty

2019年2月16日

摘要： Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum pro 阅读全文

posted @ 2019-02-16 22:24 Veritas_des_Liberty 阅读(196) 评论(0) 推荐(0)

338. Counting Bits

摘要： Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and r 阅读全文

posted @ 2019-02-16 21:47 Veritas_des_Liberty 阅读(192) 评论(0) 推荐(0)

322. Coin Change

摘要： You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you nee 阅读全文

posted @ 2019-02-16 20:51 Veritas_des_Liberty 阅读(305) 评论(0) 推荐(0)

2019年2月15日

304. Range Sum Query 2D - Immutable

摘要： Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2 阅读全文

posted @ 2019-02-15 22:32 Veritas_des_Liberty 阅读(177) 评论(0) 推荐(0)

303. Range Sum Query - Immutable

摘要： 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 阅读(261) 评论(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 阅读(223) 评论(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 阅读(235) 评论(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 阅读(216) 评论(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 阅读(196) 评论(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 阅读(257) 评论(0) 推荐(0)

Veritas des Liberty

公告