- 博客(5)
- 收藏
- 关注
RSS订阅原创 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 find
2017-12-31 20:32:47
179
原创 Rotate Image -Leetcode
You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Note:You have to rotate the image in-place, which means you have to modify the input 2D matr
2017-12-18 15:57:17
196
原创 Permutations II -Leetcode
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[ [1,1,2], [1,2,1], [2,1
2017-12-18 15:19:03
185
原创 Permutations -Leetcode
Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1
2017-12-17 23:09:05
214
原创 Multiply Strings
Given two non-negative integers num1 and num2 represented as strings, return the product of num1 andnum2.Note:The length of both num1 and num2 is Both num1 and num2 contains only digits0
2017-12-10 23:06:08
172
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人