随笔分类 -  Algorithm

上一页 1 ··· 12 13 14 15 16
classic algorithm, problem
LeetCode Edit Distance
摘要：class Solution {public: int minDistance(string word1, string word2) { const int cols = word1.length() + 1; const int rows = word2.len... 阅读全文
posted @ 2014-03-18 15:36 卖程序的小歪 阅读(244) 评论(0) 推荐(0)
LeetCode CombinationSum II
摘要：class Solution {public: vector > combinationSum2(vector &num, int target) { sort(num.begin(), num.end()); vector > tmp; vector sel; dfs(num, 0, target, sel, tmp); return tmp; } void dfs(vector &num, int pos, int target, vector& sel, vector >& r... 阅读全文
posted @ 2014-03-17 21:10 卖程序的小歪 阅读(180) 评论(0) 推荐(0)
LeetCode CombinationSum
摘要：class Solution {public: vector > combinationSum(vector &candidates, int target) { sort(candidates.begin(), candidates.end()); candidates.erase(unique(candidates.begin(), candidates.end()), candidates.end()); vector > tmp; vector sel; dfs(... 阅读全文
posted @ 2014-03-17 19:54 卖程序的小歪 阅读(198) 评论(0) 推荐(0)
LeetCode Longest Substring Without Repeating Characters
摘要：class Solution {public: int lengthOfLongestSubstring(string s) { int len = s.length(); if (len mlen) mlen = clen; q++; ... 阅读全文
posted @ 2014-03-15 12:41 卖程序的小歪 阅读(159) 评论(0) 推荐(0)
LeetCode Reorder List
摘要：1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int val; 5 * ListNode *next; 6 * ListNode(int x) : val(x), ne... 阅读全文
posted @ 2014-03-15 10:35 卖程序的小歪 阅读(177) 评论(0) 推荐(0)
LeetCode Copy List with Random Pointer
摘要：/** * Definition for singly-linked list with a random pointer. * struct RandomListNode { * int label; * RandomListNode *next, *random; * RandomListNode(int x) : label(x), next(NULL), random(NULL) {} * }; */class Solution {public: RandomListNode *copyRandomList(RandomListNode *head) { ... 阅读全文
posted @ 2014-03-14 21:10 卖程序的小歪 阅读(334) 评论(0) 推荐(0)
LeetCode Unique Paths II
摘要：class Solution {public: int uniquePathsWithObstacles(vector > &obstacleGrid) { vector >& dp = obstacleGrid; if (dp.empty() || dp[0].e... 阅读全文
posted @ 2014-03-14 19:56 卖程序的小歪 阅读(165) 评论(0) 推荐(0)
LeetCode Unique Paths
摘要：class Solution {public: int uniquePaths(int m, int n) { int (*dp)[101] = new int[101][101]; for (int i=0;i<101;i++) dp[0][i] = 0; ... 阅读全文
posted @ 2014-03-14 16:58 卖程序的小歪 阅读(159) 评论(0) 推荐(0)
LeetCode Decode Ways
摘要：A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded messag... 阅读全文
posted @ 2014-03-13 22:22 卖程序的小歪 阅读(198) 评论(0) 推荐(0)
Leetcode Sudoku Solver
摘要：class Solution {private: int row[9]; int col[9]; int blk[9]; public: void solveSudoku(vector > &board) { if (board.empty() || board[0].empty()) return; initBits(board); dfs(board, 0, 0); } bool dfs(vector >& board, int ridx, int cidx) { ... 阅读全文
posted @ 2014-03-13 16:24 卖程序的小歪 阅读(221) 评论(0) 推荐(0)
Leetcode Valid Sudoku
摘要：class Solution {private: // only used by _isValidSudoku int row[9]; int col[9]; int blk[9];public: bool _isValidSudoku(vector >& board) { if (board.empty()) return true; memset(row, 0, sizeof(row)); memset(col, 0, sizeof(col)); memset(blk, 0, sizeof(blk)); ... 阅读全文
posted @ 2014-03-12 21:34 卖程序的小歪 阅读(161) 评论(0) 推荐(0)
Leetcode Surrounded Regions
摘要：1 class Solution { 2 public: 3 void solve(vector > &board) { 4 if (board.size() == 0) return; 5 int my = board.size() - 1; 6 int mx = board[0].size() -1; 7 // top border 8 for (int i=0; i >& board, int mx, int my, int _x, int _y, char oc, char nc) {40 ... 阅读全文
posted @ 2014-03-11 21:37 卖程序的小歪 阅读(202) 评论(0) 推荐(0)
LeetCode Sqrt
摘要：int sqrt(int x) { int lo = 0; int hi = x; int m = 0; double mul = 0; for (;;) { m = (lo + hi) / 2; if (lo > hi) break; mul = 1.0 * m * m; if (mul > x) { hi = m - 1; } else if (mul == x) { ... 阅读全文
posted @ 2014-03-11 16:17 卖程序的小歪 阅读(210) 评论(0) 推荐(0)
LeetCode POW
摘要：1 double pow(double x, int n) { 2 if (n == 0) return 1; 3 unsigned int k = 0; 4 if (n >=1;14 }15 return ret;16 }MS 2012 math.h 1 template inline 2 _Ty _Pow_int(_Ty _X, int _Y) 3 {unsigned int _N; 4 if (_Y >= 0) 5 ... 阅读全文
posted @ 2014-03-11 14:39 卖程序的小歪 阅读(157) 评论(0) 推荐(0)
LeetCode Next Permutation
摘要：class Solution {public: void nextPermutation(vector &num) { if (num.size() =0 && (num[i] >= num[i+1])) i--; if (i >= 0) { ... 阅读全文
posted @ 2014-03-10 22:18 卖程序的小歪 阅读(168) 评论(0) 推荐(0)
ACK-Ackermann, 阿克曼函数
摘要：以前好几次在学语言的使用都有实现这个ack函数的经历，今天读本算法书，偶尔又提到了这个，查了下wiki来头好大Values ofA(m,n)m\n01234n012345123456235791135132961125413=65533=265536−3=== 阅读全文
posted @ 2014-03-06 15:13 卖程序的小歪 阅读(769) 评论(0) 推荐(0)
用01随机函数构造[a,b]整数范围随机数
摘要：1 #include 2 #include 3 #define RAND_0_1 (rand()&0x1) 4 5 int random(int a, int b); 6 7 int main(){ 8 int s[100]; 9 10 for (int i=0; i>1;34 }35 } while(ret > D);36 return ret + a;37 }算法导论（第二版）里第五章有关于用1/0随机函数产生[a, b]内的随机数，不知这样实现是否正确，运行结果不理想 阅读全文
posted @ 2014-02-26 21:40 卖程序的小歪 阅读(272) 评论(0) 推荐(0)

上一页 1 ··· 12 13 14 15 16