枚举
文章平均质量分 50
lqcsp
这个作者很懒,什么都没留下…
展开
-
Word Ladder II
Given two words (beginWord and endWord), and a dictionary’s word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:Only one letter can be changed at a time Each i原创 2016-08-21 15:58:47 · 374 阅读 · 0 评论 -
37. Sudoku Solver
ProblemWrite a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character .You may assume that there will be only one unique solution. A sudoku puzzle…Solut原创 2016-08-21 16:01:08 · 338 阅读 · 0 评论 -
386. Lexicographical Numbers
ProblemGiven an integer n, return 1 - n in lexicographical order.For example, given 13, return:[1,10,11,12,13,2,3,4,5,6,7,8,9].Please optimize your algorithm to use less time and space. The input size原创 2016-08-21 16:28:49 · 1421 阅读 · 0 评论