Leetcode
Gummary
这个作者很懒,什么都没留下…
展开
-
Leetcode_231_Power of Two
Given an integer, write a function to determine if it is a power of two. 原题链接思路:如果那个数是2的幂,那么二进制表示中一定只有一个1。 例如 1:0001 2:0010 4:0100 … 所以就想按位来检验是否为2的幂 class Solution { public: bool isPowerOfTwo(in原创 2016-04-07 19:12:07 · 267 阅读 · 0 评论 -
Leetcode_104_Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.题意:求一棵二叉树的最大深度 思路:递归 坑:暂无代码:/** * Defini原创 2016-04-20 18:08:51 · 413 阅读 · 0 评论 -
Leetcode_338_Counting Bits
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.Example: For num = 5 you sh原创 2016-04-20 18:06:26 · 486 阅读 · 0 评论 -
Leetcode_258_Add Digits
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, r原创 2016-04-17 11:15:17 · 469 阅读 · 0 评论 -
Leetcode_86_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原创 2016-04-11 17:37:18 · 232 阅读 · 0 评论 -
Leetcode_105_Construct Binary Tree from Preorder and Inorder Traversal
这个题和上一个题差不多是一样的,只不过后序变成了前序,但是思路还是一样的,这次直接顺着上次的思路写的,一遍A了,算是记住这种算法了。/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * Tr原创 2016-04-11 15:10:49 · 420 阅读 · 0 评论 -
Leetcode_326_Power of Three
Given an integer, write a function to determine if it is a power of three.Follow up: Could you do it without using any loop / recursion?题意:判断一个数是否为3的幂 思路:解决了2的幂以为这个题也很简单,一直取余除三就行,但是看了看提议要求尽量不用递归和循环,所原创 2016-04-13 22:45:25 · 434 阅读 · 0 评论 -
Leetcode_144_Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,2,3].Note: Recursive solution is trivial,原创 2016-04-13 17:39:22 · 389 阅读 · 0 评论 -
Leetcode_162_Find Peak Element
A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array may contain multiple peaks, in that case原创 2016-04-25 22:31:24 · 410 阅读 · 0 评论 -
Leetcode_94_Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,3,2].Note: Recursive solution is trivial,原创 2016-04-12 22:37:26 · 402 阅读 · 0 评论 -
Leetcode_171_Excel Sheet Column Number
Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example:A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28 题意:给原创 2016-04-12 18:06:11 · 297 阅读 · 0 评论 -
Leetcode_168_Excel Sheet Column Number
Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example:1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 -> AB 题意:给定一个正整数n,给出在EXCEL中列的值 思路:取余,相除,和以前在学校做的根据原创 2016-04-12 17:55:19 · 304 阅读 · 0 评论 -
Leetcode_106_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.根据中序和后序遍历确定一个二叉树,一开始打算每一个都用vector储存,结果内存超限了。 内存超限代码:/** * Def原创 2016-04-09 09:59:39 · 282 阅读 · 0 评论 -
Leetcode_78_Subsets
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 duplicate subsets.For example, If nums原创 2016-04-07 22:18:35 · 288 阅读 · 0 评论 -
Leetcode_300_Longest Increasing Subsequence
Given an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2, 3, 7, 101], therefore原创 2016-04-07 19:28:10 · 318 阅读 · 0 评论 -
Leetcode_226_Invert Binary Tree
Invert a binary tree. 题意:反转一棵二叉树 思路:每次交换即可 坑:暂无 代码:/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int原创 2016-04-22 09:47:19 · 394 阅读 · 0 评论