编程
七仔xu
这个作者很懒,什么都没留下…
展开
-
227. Basic Calculator II(medium)[后缀表达式 栈]
Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *, / operators and empty spaces . The integer division should原创 2016-06-30 21:38:48 · 192 阅读 · 0 评论 -
224.leetcode Basic Calculator(hard)[后缀表达式 栈]
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原创 2016-06-30 21:36:37 · 444 阅读 · 0 评论 -
2.Add Two Numbers(medium)[链表处理 大数相加]
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 as a link原创 2016-06-29 16:26:11 · 208 阅读 · 0 评论 -
258.LeetCode Add Digits(easy)[数学问题 求一个数的树根]
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 on原创 2016-04-14 17:18:16 · 551 阅读 · 0 评论 -
67.LeetCode Add Binary(easy)[字符串 大数相加处理]
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".这个题是要实现对字符串完成二进制加法的功能,类似于大数加法这样的功能,需要考虑的是进位位、两个串不是一样长的时候需要补0的操作。这个题需要实现1+1 进位这样的原创 2016-04-14 17:04:13 · 503 阅读 · 0 评论 -
110.LeetCode Balanced Binary Tree(easy)[二叉树 检测是否平衡]
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原创 2016-03-29 21:50:05 · 302 阅读 · 0 评论 -
94.LeetCode Binary Tree Inorder Traversal(medium)[中序遍历二叉树 树的遍历]
Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].中序遍历二叉树/** * Defin原创 2016-04-14 17:36:30 · 250 阅读 · 0 评论 -
122.leetcode Best Time to Buy and Sell Stock II(medium)[贪心算法 数组]
122. Best Time to Buy and Sell Stock IISay you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may comp原创 2016-07-12 21:42:20 · 319 阅读 · 0 评论 -
123.leetcode Best Time to Buy and Sell Stock III(hard)[动态规划算法 数组]
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note:You may原创 2016-07-13 12:18:41 · 255 阅读 · 0 评论 -
309.leetcode Best Time to Buy and Sell Stock with Cooldown(medium)[动态规划]
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on原创 2016-07-13 15:45:58 · 261 阅读 · 0 评论 -
103.leetcode Binary Tree Zigzag Level Order Traversal(medium)[二叉树 栈]
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given binary原创 2016-07-05 21:13:11 · 293 阅读 · 0 评论 -
173.leetcode Binary Search Tree Iterator(medium)[二叉搜索树 栈 中序遍历]
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest number in the BST.Note: next()原创 2016-07-18 21:57:56 · 218 阅读 · 0 评论 -
算法基础-字符移位
算法基础-字符移位小Q最近遇到了一个难题:把一个字符串的大写字母放到字符串的后面,各个字符的相对位置不变,且不能申请额外的空间。你能帮帮小Q吗?输入描述:输入数据有多组,每组包含一个字符串s,且保证:1<=s.length<=1000. 输出描述:对于每组数据,输出移位后的字符串。输入例子:AkleBiCeilD输原创 2016-07-09 14:56:30 · 2316 阅读 · 0 评论 -
102.LeetCode Binary Tree Level Order Traversal(easy)[二叉树层次遍历 广度搜索 队列]
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20原创 2016-03-29 21:54:03 · 218 阅读 · 0 评论 -
103.leetcode Binary Tree Zigzag Level Order Traversal(medium)[二叉树层次遍历 栈]
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given binary原创 2016-08-04 10:43:50 · 291 阅读 · 0 评论 -
319.leetcode Bulb Switcher (medium)[观察总结规律]
There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it's off or turning of原创 2016-08-04 10:54:20 · 224 阅读 · 0 评论 -
70.leetcode Climbing Stairs(easy)[递推表示式 斐波那契数列]
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?这个题目可以采用动态规划或者递推表达式来完成,f(n)原创 2016-08-04 11:10:36 · 197 阅读 · 0 评论 -
216.leetcode Combination Sum III(medium)[回溯]
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.Example 1:Input:原创 2016-08-04 11:23:08 · 208 阅读 · 0 评论 -
165.LeetCode Compare Version Numbers(easy)[字符串处理 分割与int转换]
Compare two version numbers version1 and version2.If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and co原创 2016-04-19 11:05:56 · 266 阅读 · 0 评论 -
106.leetcode.Construct Binary Tree from Inorder and Postorder Traversal(medium)[中序、后序构造二叉树]
Given inorder and postorder traversal of a tree, construct the binary tree.对于一棵二叉树可以通过先序、中序求得这棵树的结构,也可以通过后序、中序求得这棵树的结构,下面就是采用中序、后序构造的方法,对于后序可以确定每一步的根节点,再用中序可以确定左右子树。/** * Definition for a binary原创 2016-08-04 11:39:28 · 303 阅读 · 0 评论 -
105.leetcode Construct Binary Tree from Preorder and Inorder Traversal(medium)[先序、中序构造二叉树]
Given preorder and inorder traversal of a tree, construct the binary tree.对于一棵二叉树可以通过先序、中序求得这棵树的结构,也可以通过后序、中序求得这棵树的结构,下面就是采用中序、先序构造的方法,对于先序可以确定每一步的根节点,再用中序可以确定左右子树。/** * Definition for a binary原创 2016-08-04 11:41:59 · 184 阅读 · 0 评论 -
11.leetcode Container With Most Water(medium)[分析规律减少搜索空间]
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i,原创 2016-08-04 17:06:06 · 198 阅读 · 0 评论 -
217.leetcode Contains Duplicate(easy)[数组 查重]
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element原创 2016-08-04 17:12:54 · 246 阅读 · 0 评论 -
219.leetcode Contains Duplicate II(easy)[数组 滑动窗口]
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j]and the difference between i and j is at most k.查原创 2016-08-04 17:21:44 · 263 阅读 · 0 评论 -
220.leetcode Contains Duplicate III (medium)[]
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] andnums[j] is at most t and the difference between i and原创 2016-08-04 19:25:59 · 184 阅读 · 0 评论 -
108.leetcode Convert Sorted Array to Binary Search Tree(medium)[数组 二分查找 二叉平衡搜索树]
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.把一个升序数组转换成平衡二叉搜索树,整个过程相当于二分查找,mid为根节点,左边的数组生成的新的平衡二叉搜索树为树的左子树,右边为右子树。/** * Definition for a binary原创 2016-08-04 19:31:09 · 238 阅读 · 0 评论 -
38.leetcode Count and Say(easy)[字符串处理 string与int的转换]
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as原创 2016-08-04 19:42:20 · 301 阅读 · 0 评论 -
204.leetcode Count Primes (easy)[素数 数学观察]
Description:Count the number of prime numbers less than a non-negative number, n.计算不大于n的素数的个数,暴力破解的方法是遍历从从1到n的数并检测是否为素数。但是通过观察可以知道,2的倍数,3的倍数都不是素数,因此从2开始遍历它小于n的倍数都不可能是素数,并记录这个状态。最后再遍历状态数组dp[n],原创 2016-08-04 19:52:15 · 259 阅读 · 0 评论 -
338.LeetCode Counting Bits(medium)[二进制位处理]
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原创 2016-04-21 19:37:21 · 290 阅读 · 0 评论 -
237.LeetCode Delete Node in a Linked List(easy)[单链表 删除节点]
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value原创 2016-04-15 17:06:07 · 246 阅读 · 0 评论 -
115.leetcode Distinct Subsequences(hard)[动态规划]
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 (can be non原创 2016-08-04 20:17:13 · 203 阅读 · 0 评论 -
299.LeetCode Bulls and Cows(easy)[字符串处理 map]
You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint t原创 2016-04-14 21:47:51 · 220 阅读 · 0 评论 -
171.leetcode Excel Sheet Column Number(easy)[进制转换]
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 ...原创 2016-08-04 20:42:00 · 197 阅读 · 0 评论 -
107.LeetCode Binary Tree Level Order Traversal II(easy)[二叉树层次遍历 广度搜索 队列]
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree {3,9,20,#,#,15,7},原创 2016-03-29 21:52:51 · 217 阅读 · 0 评论 -
144.leetcode Binary Tree Preorder Traversal(medium)[二叉树先序遍历]
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3]./** * Definition for a bi原创 2016-07-21 21:24:07 · 236 阅读 · 0 评论 -
145.leetcode Binary Tree Postorder Traversal(easy)[二叉树后序遍历]
Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].具体思路:二叉树后序遍历/**原创 2016-07-21 21:25:25 · 282 阅读 · 0 评论 -
257.leetcode Binary Tree Paths(easy)[二叉树深度路径遍历]
Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->2->5", "1->3"]具体思路:原创 2016-07-21 21:32:37 · 242 阅读 · 0 评论 -
172.leetcode Factorial Trailing Zeroes(easy)[阶乘 数学]
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity题目的含义是获取整数n!尾部0的个数,其实就是看n!这个整数中2和5银子的个数,因为5的个数肯定比2少,所以最终的决定性因素是n!中5的因原创 2016-08-05 09:48:18 · 199 阅读 · 0 评论 -
153.leetcode Find Minimum in Rotated Sorted Array(medium)[有序数组 二分查找]
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.You may assume no duplicate exists in原创 2016-08-05 09:58:51 · 287 阅读 · 0 评论 -
154.leetcode Find Minimum in Rotated Sorted Array II(hard)[排序数组 重复元素 二分查找]
Follow up for "Find Minimum in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Suppose a sorted array is rotated at some pivot unk原创 2016-08-05 10:07:16 · 232 阅读 · 0 评论