- 博客(10)
- 资源 (20)
- 收藏
- 关注
原创 近期会议总结
ICASSP2015: Brisbane, Australia. Oct 5,2014CVPR2015 Boston, USA. Nov,14,2014;ICME2015 Turlin, Italy. Nov 28, 2014.ICMR2015 Shanghai, Ch
2014-09-26 10:50:00 1570
原创 Leetcode:Word Search
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertic
2014-09-07 01:32:11 997
原创 LeetCode:Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "255.255.111.35"]. (Order
2014-09-06 12:19:46 754
原创 leetcode: N-Queues
N-QueensThe n-queens puzzle is the problem of placing n queens on ann×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens p
2014-09-05 22:46:46 1076
转载 回溯法
回溯法回溯法有“通用的解题法”之称。用它可以系统地搜索一个问题的所有解或任一解。回溯法是一种即带有系统性又带有跳跃性的搜索算法。它在问题的解空间树中,按深度优先策略,从根节点出发搜索解空间树。算法搜索至解空间树的任一结点时,先判断该节点是否包含问题的解。如果不包含,则跳过对以该节点为根的子树的搜索,逐层向其它祖先节点回溯。否则,进入该子树,继续按照深度优先策略搜索。回溯法求问题的所有解时,
2014-09-05 20:54:18 1244
原创 Leetcode: Word Ladder II
Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that:Only one letter can be changed at a timeEach intermediate word must exi
2014-09-05 20:04:09 1260
原创 Leetcode: Word Ladder
Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a timeEach intermediate word m
2014-09-05 14:06:39 912
转载 LeetCode题目难度分布(含面试频率及使用的数据结构与算法)
原文链接:LeetCode Question Difficulty Distribution(墙外)ID Question Diff Freq Data StructureAlgorithms
2014-09-03 13:51:26 3289
GPSR优化包
2014-06-19
OpenCV 2 Computer Vision Application Programming Cookbook
2013-11-13
Kinect应用开发实战用最自然的方式与机器对话
2013-11-13
pyramid bag of words 金字塔的词袋模型
2013-09-05
cmvs和pmvs2可执行程序
2013-06-18
最新Cygwin1.7.9完整离线安装包
2013-06-18
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人