- 博客(15)
- 收藏
- 关注
RSS订阅原创 LeetCode_79 Word Search
Link to original problem: 这里写链接内容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 thos
2016-01-31 06:13:51
218
原创 LeetCode_78 Subsets
Link to original problem: 这里写链接内容 Given a set of distinct integers, nums, return all possible subsets.Note: Elements in a subset must be in non-descending order. The solution set must not contain du
2016-01-31 06:07:03
236
原创 LeetCode_77 Combinations
Link to original problem: 这里写链接内容Given two integers n and k, return all possible combinations of k numbers out of 1 … n.For example, If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3],
2016-01-31 06:02:18
255
原创 LeetCode_60 Permutation Sequence
Link to original problem: 这里写链接内容 The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order, We get the following sequence (ie, for n = 3
2016-01-31 05:30:02
249
原创 LeetCode_47 Permutations II
Link to original problem: 这里写链接内容Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example, [1,1,2] have the following unique permutations: [1,1
2016-01-31 05:03:13
340
原创 LeetCode_46 Permutations
Link to original problem: 这里写链接内容 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], [
2016-01-31 04:55:50
351
原创 LeetCode_44 Wildcard Matching
Link to original problem: 这里写链接内容Implement wildcard pattern matching with support for ‘?’ and ‘*’.‘?’ Matches any single character. ‘*’ Matches any sequence of characters (including the empty sequence
2016-01-29 05:55:39
198
原创 LeetCode_40 Combination Sum II
Link to the original problem: 这里写链接内容 Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may
2016-01-29 04:13:24
214
原创 LeetCode_39 Combination Sum
Original problem: 这里写链接内容 Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen f
2016-01-29 03:55:26
212
原创 LeetCode_37 Sudoku Solver
Original problem: 37 Sudoku Solver 这里写链接内容 Write 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
2016-01-29 03:40:51
247
原创 LeetCode_22 Generate Parentheses
Link to original problem: 这里写链接内容 Very typical backtracking problem, it can be simulated to give all the possible orders of n 0s and n 1s list. But we need to take care about that at every index of ea
2016-01-28 03:56:52
296
原创 LeetCode_17 Letter Combinations of a Phone Number
Very typical backtracking problem.Here is the link to the original problem. 点击打开链接 Related question: 22 Generate Parentheses 点击打开链接 and 39 Combination Sum 点击打开链接 Given a digit string, return all
2016-01-28 03:19:18
220
原创 LeetCode_10 Regular Expression Matching
This is the linkage to this problem: 点击打开链接 Similar question: None by now Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches
2016-01-27 13:23:27
442
转载 What are TCHAR, WCHAR, LPSTR, LPWSTR, LPCTSTR (etc.)?
Many C++ Windows programmers get confused over what bizarre identifiers like TCHAR, LPCTSTR are. In this article, I would attempt by best to clear out the fog. In general, a character can be repr
2015-12-04 10:51:27
354
原创 第一篇文章--开始Windows编程的学习
Windows程序的框架： int WINAPI WinMain (HINSTANCE hInstance, HINSTANCE hPrevInstance, PSTR szCmdLine, int iCmdShow){ return 0 ; } Hinstance为窗口句柄， hPrevInstance为当前窗口共享窗口句柄， szCmdLine和CmdShow未知。
2015-02-09 13:03:35
252
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人