- 博客(3)
- 收藏
- 关注
RSS订阅原创 edit distance leetcode
这种字符转换的dp挺经典的class Solution {public: int minDistance(string word1, string word2) { int dp[word1.size()+1][word2.size()+1]; for(int i = 0; i < word1.size()+1; i++) dp[i
2014-11-21 11:25:33
692
原创 N-Queens
敲到n皇后，map一下算法class Solution {public: vector > res; void helper(vector &nums, int index, int n) { if(index == n) { bool flag = true; for(int i = 0; i < n && flag; i++)
2014-11-12 16:17:28
580
转载 permutations
Given a collection of 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], and [3,2,1].函数原型：vect
2014-11-07 11:53:25
556
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人