leetcode
lifqjdlut
这个作者很懒,什么都没留下…
展开
-
leetcode Combination Sum II回溯问题
最近一直在看回溯算法的框架,这道题代表性比较强,用到剪枝(重复1),和约束(超过界限直接return)。先贴下一般的回溯算法的框架。引用自这个bolg http://blog.jqian.net/post/backtracking.htmlvoid backtrack(int t){ if(t > n) output(x); else for (i原创 2015-06-26 10:06:46 · 330 阅读 · 0 评论 -
Longest Substring Without Repeating Characters求最长子串中没有重复字母的最长长度
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo转载 2015-07-06 09:37:39 · 354 阅读 · 0 评论 -
leetcode Populating Next Right Pointers in Each Node 树 队列应用
leetcode Populating Next Right Pointers in Each Node 树 队列应用原创 2015-07-06 11:05:42 · 336 阅读 · 0 评论 -
leetcode Power of Two位运算
Given an integer, write a function to determine if it is a power of two.Credits:Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.Show Tags原创 2015-07-06 11:27:41 · 287 阅读 · 0 评论 -
leetcode Flatten Binary Tree to Linked List树
leetcode Flatten Binary Tree to Linked List树原创 2015-07-06 16:54:27 · 318 阅读 · 0 评论 -
leetcode Two Sum 哈希表
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where原创 2015-07-06 19:12:27 · 311 阅读 · 0 评论 -
leetcode Contains Duplicate II 哈希表
Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between iand j is at most k.原创 2015-07-06 17:27:09 · 429 阅读 · 0 评论 -
leetcode Count Complete Tree Nodes
leetcode Count Complete Tree Nodes原创 2015-07-06 15:57:54 · 432 阅读 · 0 评论 -
leetcode Repeated DNA Sequences 哈希表
leetcode Repeated DNA Sequences原创 2015-07-14 11:21:48 · 345 阅读 · 0 评论 -
leetcode Fraction to Recurring Decimal 哈希表
leetcode Fraction to Recurring Decimal 哈希表原创 2015-07-14 13:12:26 · 424 阅读 · 0 评论 -
leetcode Anagrams
leetcode Anagrams原创 2015-07-14 09:43:51 · 358 阅读 · 0 评论 -
leetcode Palindrome Linked List 链表
Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?Show TagsShow Similar Problems题目意思是给一个链表,判断是不是回文,比如1->2->3->原创 2015-07-14 15:58:14 · 293 阅读 · 0 评论 -
leetcode 链表
Dummy node 是链表问题中一个重要的技巧,中文翻译叫“哑节点”或者“假人头结点”。Dummy node 是一个虚拟节点,也可以认为是标杆节点。Dummy node 就是在链表表头 head 前加一个节点指向 head,即 dummy -> head。Dummy node 的使用多针对单链表没有前向指针的问题,保证链表的head 不会在删除操作中丢失。除此之外,还有一种用法比较少原创 2015-09-13 15:33:53 · 387 阅读 · 0 评论 -
间隔K翻转链表
1->2->3->4->5->6->7 k=3 return 3->2->1->6->5->4->7ListNode * reverse(ListNode *head,int k) { ListNode *pre = NULL; while (k>0) { k--; ListNode *next = head->next; head->next = pre;原创 2015-09-24 20:45:25 · 428 阅读 · 0 评论 -
回溯法总结
一般回溯法可以用两种框架,一种遍历方式(for循环),选择方式(可以理解成到某一节点选择或者不选)。比较二者的差别:1.采用遍历方式,for(int i=dep;i选择的方式记得判断dep是否到达边界dep==nums.size()同时记得dep++;2.遍历方式中for循环的临时变量存储的是temp[i],选择方式中是temp[dep];3.采用选择方式中,pop完之后还需要继续原创 2015-10-07 09:02:15 · 658 阅读 · 0 评论 -
leetcode Convert Sorted Array to Binary Search Tree 树
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.把一个有序的数组编程平衡二叉搜索树。/** * Definition for a binary tree node. * struct TreeNode { * int val; *原创 2015-07-05 22:58:54 · 287 阅读 · 0 评论 -
leetcode Generate Parentheses 回溯算法
题目:Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((()))", "(()())", "(())()", "()(()原创 2015-06-26 22:04:35 · 693 阅读 · 0 评论 -
leetcode Add and Search Word - Data structure design回溯算法+Trie字典树
leetcode Add and Search Word - Data structure design回溯算法+Trie字典树原创 2015-06-28 11:03:14 · 481 阅读 · 0 评论 -
leetcode Basic Calculator 栈
Implement a basic calculator to evaluate a simple expression string.The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integers and em原创 2015-06-30 19:31:03 · 298 阅读 · 0 评论 -
leetcode 二叉树的遍历栈的实现 Preorder Traversal Inorder Traversal Postorder Traversal
leetcode 二叉树的遍历用栈实现 非递归原创 2015-06-30 21:53:47 · 396 阅读 · 0 评论 -
leetcode Minimum Size Subarray Sum 双指针
leetcode Minimum Size Subarray Sum 双指针原创 2015-07-02 09:48:23 · 452 阅读 · 0 评论 -
leetcode Swap Nodes in Pairs 链表
leetcode Swap Nodes in Pairs 链表原创 2015-07-02 16:57:39 · 280 阅读 · 0 评论 -
leetcode Remove Nth Node From End of List 链表 双指针
leetcode Remove Nth Node From End of List 链表 双指针原创 2015-07-02 10:18:34 · 332 阅读 · 0 评论 -
leetcode Binary Tree Zigzag Level Order Traversal 层序遍历 双队列
双队列实现二叉树的层序遍历。原创 2015-07-01 19:08:02 · 372 阅读 · 0 评论 -
leetcode Partition List链表
leetcode Partition List链表原创 2015-07-05 10:49:48 · 295 阅读 · 0 评论 -
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 diffe原创 2015-07-05 17:10:47 · 250 阅读 · 0 评论 -
leetcode Symmetric Tree 树
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the f原创 2015-07-05 19:47:07 · 219 阅读 · 0 评论 -
leetcode Add Two Numbers 链表
leetcode Add Two Numbers 链表原创 2015-07-05 10:18:45 · 312 阅读 · 0 评论 -
leetcode Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node./** * Definition for a binary tre原创 2015-07-05 17:45:46 · 247 阅读 · 0 评论 -
leetcode Sum Root to Leaf Numbers 树
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota原创 2015-07-06 09:57:18 · 307 阅读 · 0 评论 -
leetcodes
递归/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class So原创 2015-09-23 22:30:42 · 349 阅读 · 0 评论