- 博客(5)
- 资源 (12)
- 收藏
- 关注
原创 Longest Consecutive Sequence
http://oj.leetcode.com/problems/longest-consecutive-sequence/ void find_longest_consequence(void) { vector v; v.push_back(100); v.push_back(4); v.push_back(200); v.push_back(200); v.pu
2013-09-24 19:25:18 524
原创 Sum Root to Leaf Numbers
http://oj.leetcode.com/problems/sum-root-to-leaf-numbers/ struct TreeNode { int val; TreeNode* left; TreeNode* right; TreeNode(int x): val(x), left(NULL), right(NULL) { } }; void get_nu
2013-09-24 17:34:42 557
原创 Surrounded Regions
http://oj.leetcode.com/problems/surrounded-regions/ void mark(vector>& board, int x, int y) { int h = board.size(); int w = board[0].size(); if (board[y][x] == 'o') { board[y][x] = 's';
2013-09-24 17:00:36 657
原创 Palindrome Partitioning II
http://oj.leetcode.com/problems/palindrome-partitioning-ii/ int minCut(string s) { int ret = 0; int s_len =s.size(); if (s_len <= 1) { return 0; } // s[0] ~ s[i] needs cuts; vector
2013-09-24 10:36:38 690
原创 Palindrome Partitioning
http://oj.leetcode.com/problems/palindrome-partitioning/ bool is_hw(int i, int j, string s, vector>& table) { if (table[i][j] != 0) { return table[i][j] > 0; } if (s[i] != s[j]) {
2013-09-24 10:35:02 599
SD 协议合集,一个就够了~~
2011-01-18
通过 UART 读写 SDRAM verilog 源代码, 附时序约束文件
2010-10-10
uart 收发器 verilog 代码,实现自收发功能;
2010-10-10
SIFT 算法学习资料;
2010-05-24
蓝牙 HCI 驱动(通过 USB 总线)
2010-02-26
控制器和多功能设备驱动
2007-10-21
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人