- 博客(4)
- 收藏
- 关注
RSS订阅原创 NP-8.8
8.8. In the EXACT 4 SAT problem, the input is a set of clauses, each of which is a disjunction of exactly four literals, and such that each variable occurs at most once in each clause. The goal is to
2017-12-31 20:32:38
140
原创 338. Counting Bits
Description: 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 return them as an array. Examp
2017-12-24 20:17:17
133
原创 11. Container With Most Water
Description: Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai)
2017-12-24 18:19:50
137
原创 64. Minimum Path Sum
Description: Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either
2017-12-10 14:28:53
109
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人