- 博客(5)
- 收藏
- 关注
原创 Letter Combinations of a Phone Number(回溯,dfs)
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit st
2017-06-29 17:09:04 588
原创 Permutations(主要谈谈如何做全排列,组合等回溯的使用)
Given a collection of distinct 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], [3,2,1]
2017-06-26 15:17:34 704
原创 LeetCode Min Stack
大家好这几次都是带来的设计题,这题是设计一个栈,那么同样也是c语言带来的先看题目Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Remov
2017-06-05 21:20:01 366
原创 LeetCode Trie树(前缀树)
大家好,我是刘天昊,这次带来的数据结构-前缀树那么先看题目,同样c语言带来的trie树very funnyImplement a trie with insert, search, and startsWith methods.Note:You may assume that all inputs are consist of lowercase letters
2017-06-05 20:43:23 483
原创 LeetCode 位运算操作集锦(一)
大家好,我是刘天昊,这次给大家带来的是leetcode中位运算的操作集锦那么一次放出三题,并且我会总结其中的位运算的操作那么直接开始(推荐直接在leetcode上找题目,先做做看再看我的blog,要有自己思考的过程)36. Valid SudokuDetermine if a Sudoku is valid, according to: Sudoku Puzzles -
2017-06-01 16:31:00 935
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人