leetcode
文章平均质量分 72
学渣的第六感
热爱生活,永不放弃
展开
-
LeetCode 之 Triangle
原题:Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3原创 2013-12-27 23:37:33 · 662 阅读 · 0 评论 -
LeetCode之Construct Binary Tree from Preorder and Inorder Traversal
这个题和由中序和后序构建二叉树基本一样,看看就行了。。。。LeetCode 之 Construct Binary Tree from Inorder and Postorder Traversal代码(136ms):class Solution {public: TreeNode *buildTree(vector &preorder, vector &inorder) {原创 2013-12-12 09:45:50 · 76 阅读 · 0 评论 -
LeetCode 之 Construct Binary Tree from Inorder and Postorder Traversal
原题:Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.这个题其实不算难,就是在边界判断的时候较麻烦对每个中序遍历inOrder和后续遍历原创 2013-12-12 00:05:24 · 746 阅读 · 0 评论 -
LeetCode 之 Unique Binary Search Trees
原题:Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2原创 2013-12-04 15:03:41 · 593 阅读 · 0 评论 -
LeetCode 之 Max Points on a Line
原题:Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.做这个题首先需要注意特殊情况,一是两个点相同,二是x相同,y不同,即斜率无穷大,double可以用std::numeric_limits::infinity()表示解题思路:原创 2013-12-10 16:29:33 · 684 阅读 · 0 评论 -
LeetCode 之 Add Binary
这个题还是比较简单的,就是需要代码的简洁,用两个index分别指向两个字符串,用一个carry保存进位,由于index需要判断出界,开始准备用好几种情况分别讨论,后来发现只判断两个index是否同时越界,如果有一个没越另一个越了,就让另一个为'0'就行。同时注意char和int的转化,由于string中的char只可能是'0'或'1',用char减去'0'就得到最后转化后的int值。另外对st原创 2013-12-09 16:10:09 · 619 阅读 · 0 评论 -
LeetCode 之 Word Break
原题:Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict原创 2013-12-08 16:57:27 · 624 阅读 · 0 评论 -
LeetCode 之 Word Ladder
原题:Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a timeEach intermediate wor原创 2013-12-07 22:28:55 · 890 阅读 · 0 评论 -
LeetCode 之 Median of Two Sorted Arrays
原题:There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).这个题是求两个有序数组的中间数,其实这个中间数,如果是奇数,原创 2013-12-01 03:24:43 · 897 阅读 · 0 评论 -
LeetCode 之 Decode Ways
原题:A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine原创 2013-11-29 00:35:48 · 796 阅读 · 0 评论 -
LeetCode 之 Search for a Range
原题:Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is n原创 2013-11-14 16:36:03 · 741 阅读 · 0 评论 -
LeetCode 之 Path Sum II
原题:Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22,这个题跟第一个基本一样,看看第一个。就是需要返回一个路径原创 2013-11-14 23:37:44 · 750 阅读 · 0 评论 -
LeetCode 之 Remove Nth Node From End of List
原题:Given a linked list, remove the nth node from the end of list and return its head.这个题是要求把链表的倒数第N个元素删除。。。当然只能扫描一次,其实很简单,用队列就可以,比如要删第i个,非常好,我这个队列就保存i个,没遇到一个节点我就把整个队列向前移一步,那么最后队列的头部就是这个要删除的节点喽原创 2013-11-15 15:43:36 · 710 阅读 · 0 评论 -
LeetCode 之 Populating Next Right Pointers in Each Node II
原题:Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution still work?Note:You may only use co原创 2013-11-14 16:52:59 · 679 阅读 · 0 评论 -
LeetCode 之 Add Two Numbers
原题:You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it原创 2013-11-14 11:18:59 · 807 阅读 · 0 评论 -
LeetCode 之 Maximum Depth of Binary Tree
最近看了点动态规划,二叉树的深度用递归方法解决,算得上是动态规划,不过由于二叉树比较简单,因此不需要应用带备份的算法,而且由于二叉树有方向,只能自顶向下,不能自底向上,说是动态规划,其实就是递归而已。。。。不过学了东西之后归类还是好的,而且在开始犯了一个2b的错误,为了简化代码下了如下错误的:class Solution {public: int maxDepth(TreeNod原创 2013-11-05 14:22:45 · 676 阅读 · 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 ne原创 2013-12-05 17:41:58 · 652 阅读 · 0 评论 -
LeetCode之 Maximum Subarray
原题:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray [4,−1,原创 2013-11-10 12:54:50 · 832 阅读 · 0 评论 -
leetCode 之 Longest Common Prefix
原题:Write a function to find the longest common prefix string amongst an array of strings.找所有字符串的公共前缀,很简单,只要挨个比较就行了,就是长度不一样的时候,要判断一样,否则会出错。另外,注意c++string的操作,在string后添加一个字符用push_back就行,这个和vector原创 2013-12-12 11:25:49 · 549 阅读 · 0 评论 -
LeetCode 之 Distinct Subsequences
原题:Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by deleting some (c原创 2013-12-27 00:14:04 · 653 阅读 · 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 i原创 2013-12-26 13:48:02 · 597 阅读 · 0 评论 -
LeetCode 之 First Missing Positive
原题:Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n)>原创 2013-12-26 00:23:33 · 643 阅读 · 0 评论 -
LeetCode 之 Edit Distance
原题:Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted原创 2013-12-24 00:20:20 · 621 阅读 · 0 评论 -
LeetCode 之 Letter Combinations of a Phone Number
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.这个题其实就是一个深度搜索,假如原创 2013-12-19 16:26:08 · 600 阅读 · 0 评论 -
LeetCode 之 Recover Binary Search Tree
原题:Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is pretty straight forward. Could原创 2013-12-18 15:18:49 · 713 阅读 · 0 评论 -
LeetCode 之 Longest Consecutive Sequence
原题:Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is原创 2013-12-18 13:00:28 · 573 阅读 · 0 评论 -
Leetcode 之 Interleaving String
原题:Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.When s3 = "aadbbba原创 2013-12-31 17:42:29 · 685 阅读 · 0 评论 -
LeetCode 之 Set Matrix Zeroes
原题:Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did you use extra space?A straight forward solution原创 2013-12-31 00:19:27 · 727 阅读 · 0 评论 -
LeetCode 之 Reorder List
原题:Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}, reord原创 2013-12-14 23:55:51 · 567 阅读 · 0 评论 -
leetCode 之 String to Integer (atoi)
原题:Implement atoi to convert a string to an integer.题目很好理解,就是把一个字符串转成一个int,主要是有这么几种情况要考虑:1 正负号2 空格3 字母 123a44,这种,就返回123;a123,就返回04 溢出 int保存的范围是 -2147483648 ~ 2147483647原创 2013-12-29 21:39:13 · 689 阅读 · 0 评论 -
LeetCode 之 Longest Substring Without Repeating Characters
i原题: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原创 2013-12-29 00:52:48 · 596 阅读 · 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.把一个有序数组转成搜索树,很简单,数组中间的当root,左半边作为root->left;右半边作为root->right。这个就是在做的时候遇到了一个问题,就是指针的传递,由于c++中原创 2013-12-06 16:47:00 · 542 阅读 · 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 3原创 2013-12-05 22:54:24 · 606 阅读 · 0 评论 -
LeetCode 之 Remove Duplicates from Sorted List
原题:Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.本题就是要删除所有的重复的数原创 2013-12-05 19:54:21 · 859 阅读 · 0 评论 -
LeetCode 之 Path Sum
原题:Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree原创 2013-11-13 17:25:13 · 941 阅读 · 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.不就是求二叉树从根节点到叶子节点的最小深度么。。。。这个题跟这原创 2013-11-14 02:04:00 · 740 阅读 · 0 评论 -
LeetCode 之 Minimum Path Sum
原题:Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or r原创 2013-11-13 23:02:00 · 751 阅读 · 0 评论 -
leetcode 之 Single Number II
原题:Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it with原创 2013-11-05 17:15:47 · 774 阅读 · 0 评论 -
leetcode 之 Same Tree
题目:Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.比较两原创 2013-11-05 14:55:36 · 602 阅读 · 0 评论 -
LeetCode 之 Single Number
Key:两个相同的整数异或为0,而0与非0的整数异或为该数,由于数组中只有一个数出现一次,因此将所有的证书异或即可得到答案,c++的异或标志为^class Solution {public: int singleNumber(int A[], int n) { // IMPORTANT: Please reset any member data you d原创 2013-11-04 14:52:28 · 569 阅读 · 0 评论