懒猫欣 - 博客园

2013年10月5日

摘要： 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,2], [1,2,1], and [2,1,1].第一个版本，加了一个set去除重复class Solution {public: void sub(vector > & ret,vector& num,int index){ if(index= 阅读全文

posted @ 2013-10-05 18:14 懒猫欣阅读(167) 评论(0) 推荐(0)

LeetCode-Permutations

摘要： Given a collection of 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], and [3,2,1].class Solution {public: void sub(vector > & ret,vector& num,int index){ if(index==num.size()){ ret.push_b... 阅读全文

posted @ 2013-10-05 17:41 懒猫欣阅读(161) 评论(0) 推荐(0)

LeetCode-Partition List

摘要： Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of the two partitions. For example,Given 1->4->3->2->5->2 and x = 3,return 1->2->2-&g 阅读全文

posted @ 2013-10-05 17:21 懒猫欣阅读(161) 评论(0) 推荐(0)

LeetCode-Substring with Concatenation of All Words

摘要： You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without any intervening characters. For example, given:S: "barfoothefoobarman"L: ["foo", & 阅读全文

posted @ 2013-10-05 01:52 懒猫欣阅读(165) 评论(0) 推荐(0)

2013年10月4日

LeetCode-Balanced Binary Tree

摘要： Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.class Solution {public: int sub(TreeNode* root){ if(root==NULL)return 0; ... 阅读全文

posted @ 2013-10-04 17:09 懒猫欣阅读(127) 评论(0) 推荐(0)

LeetCode-Flatten Binary Tree to Linked List

摘要： Given a binary tree, flatten it to a linked list in-place. For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened tree should look like: 1 \ 2 \ 3 \ 4 \ 5 \ 6click to show hints.Hints:If ... 阅读全文

posted @ 2013-10-04 16:36 懒猫欣阅读(146) 评论(0) 推荐(0)

LeetCode-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 one unique solution. A sudoku puzzle......and its solution numbers marked in red.简单的回溯搜索即可class Solution {public: void solveSudoku(vector 阅读全文

posted @ 2013-10-04 16:16 懒猫欣阅读(238) 评论(0) 推荐(0)

LeetCode-Valid Sudoku

摘要： Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'. A partially filled sudoku which is valid.class Solution {public: bool isValidSudoku(vector > &board) { // Note: The 阅读全文

posted @ 2013-10-04 14:28 懒猫欣阅读(155) 评论(0) 推荐(0)

LeetCode-Climbing Stairs

摘要： You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?class Solution {public: int climbStairs(int n) { // Note: The Solution object is instantiated only once and is reused by each ... 阅读全文

posted @ 2013-10-04 13:56 懒猫欣阅读(116) 评论(0) 推荐(0)

LeetCode-Combinations

摘要： 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], [1,2], [1,3], [1,4],]class Solution {public: void sub(vector >& ret,int n,int k){ if(n >copy=ret; for(int i=0;i > comb... 阅读全文

posted @ 2013-10-04 12:36 懒猫欣阅读(156) 评论(0) 推荐(0)

公告