原创 LeetCode-Distinct Subsequences

遞歸：只能過小數據 class Solution { public: int numDistinct(string S, string T) { // Start typing your C/C++ solutio

2018-09-04 15:22:09 1

原创 LeetCode-Word Ladder

class Solution { public: int ladderLength(string start, string end, unordered_set<string> &dict) { // Start

2018-09-04 15:22:09 2

原创 LeetCode-Palindrome Partitioning II

class Solution { public: int minCut(string s) { // Start typing your C/C++ solution below // DO NOT

2018-09-04 15:22:09 2

原创 LeetCode-Longest Consecutive Sequence

class Solution { public: int longestConsecutive(vector<int> &num) { // Start typing your C/C++ solution bel

2018-09-04 15:22:09

原创 dddd

MapService_MapServer mapservice = new MapService_MapServer(); mapservice.Url = “http://sampleserver1.arcgisonline.com/A

2018-09-04 15:22:09

原创 Subsets II

class Solution { public: vector<vector<int> > subsetsWithDup(vector<int> &S) { // Start typing your C/C++ s

2018-09-04 15:22:09

原创 LeetCode-Maximal Rectangle

class Solution { public: int maximalRectangle(vector<vector<char> > &matrix) { // Start typing your C/C++ s

2018-09-04 15:22:09

原创 LeetCode-Sudoku Solver

class Solution { public: bool solveSudoku1(vector<vector<char> > &board) { // Start typing your C/C++ s

2018-09-04 15:22:09

原创 LeetCode-Valid Sudoku

class Solution { public: bool isValidSudoku(vector<vector<char> > &board) { // Start typing your C/C++ solu

2018-09-04 15:22:09

原创 LeetCode-Combination Sum II

class Solution { public: vector<vector<int> > combinationSum2(vector<int> &num, int target) { // Start typi

2018-09-04 15:22:09

原创 LeetCode-Anagrams

class Solution { public: vector<string> anagrams(vector<string> &strs) { // Start typing your C/C++ solutio

2018-09-04 15:22:09

原创 LeetCode-Populating Next Right Pointers in Each Node II

/** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *rig

2018-09-04 15:22:08

原创 LeetCode-Surrounded Regions

class Solution { public: void solve(vector<vector<char>> &board) { // Start typing your C/C++ solution belo

2018-09-04 15:22:08

原创 LeetCode-Substring with Concatenation of All Words

  class Solution { public: vector<int> findSubstring(string S, vector<string> &L) { // Start typing your C/

2018-09-04 15:22:08

原创 LeetCode-Populating Next Right Pointers in Each Node

/** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *rig

2018-09-04 15:22:08