03 2015 档案

[LeetCode] Fraction to Recurring Decimal 哈希表
摘要：Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.If the fractional part is repeating,... 阅读全文
posted @ 2015-03-31 21:13 A_zhu 阅读(240) 评论(0) 推荐(0)
[LeetCode] Permutation Sequence
摘要：The set[1,2,3,…,n]contains a total ofn! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie... 阅读全文
posted @ 2015-03-28 04:09 A_zhu 阅读(284) 评论(0) 推荐(0)
[LeetCode] Sqrt(x) 二分搜索
摘要：Implementint sqrt(int x).Compute and return the square root ofx.Hide TagsMathBinary Search 并未使用牛顿迭代，实现是通过二分搜索实现的，需要注意判断时候 x* xusing namespace std;c... 阅读全文
posted @ 2015-03-24 18:01 A_zhu 阅读(212) 评论(0) 推荐(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 ord... 阅读全文
posted @ 2015-03-22 19:47 A_zhu 阅读(251) 评论(0) 推荐(0)
[LeetCode] Combinations 回溯
摘要：Given two integersnandk, return all possible combinations ofknumbers out of 1 ...n.For example,Ifn= 4 andk= 2, a solution is:[ [2,4], [3,4], [2,3],... 阅读全文
posted @ 2015-03-22 00:00 A_zhu 阅读(201) 评论(0) 推荐(0)
[LeetCode]Word Search 回溯
摘要：Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjace... 阅读全文
posted @ 2015-03-21 23:31 A_zhu 阅读(197) 评论(0) 推荐(0)
[LeetCode] Container With Most Water
摘要：Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoints of ... 阅读全文
posted @ 2015-03-21 01:50 A_zhu 阅读(157) 评论(0) 推荐(0)
[LeetCode] Sort List 排序 sort
摘要：Sort a linked list inO(nlogn) time using constant space complexity.Hide TagsLinked ListSort 基于单项链表的排序，时间为nlogn ，O（1）空间，其实及将数组的快速排序用链表实现，并用递归来维护拆分与合并。... 阅读全文
posted @ 2015-03-20 13:35 A_zhu 阅读(272) 评论(0) 推荐(0)
c/c++: c++函数返回类型什么情况带const
摘要：c++ 函数的返回类型，包括const 什么时候起作用呢?函数返回值不想其立即修改的。 例子如下，这是一个简单的避免产生隐形返回变量的方法，abc 的函数返回是引用，main函数中第10行，++ 操作是基于 const int & 类型，所以会出错，但以后对改引用的操作不会受到const 约束... 阅读全文
posted @ 2015-03-20 04:25 A_zhu 阅读(17186) 评论(0) 推荐(1)
[LeetCode] Restore IP Addresses 回溯
摘要：Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given"25525511135",return["255.2... 阅读全文
posted @ 2015-03-20 00:04 A_zhu 阅读(247) 评论(0) 推荐(0)
[LeetCode] Binary Tree Inorder Traversal 中序排序
摘要：Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note... 阅读全文
posted @ 2015-03-17 23:23 A_zhu 阅读(192) 评论(0) 推荐(0)
[LeetCode] Evaluate Reverse Polish Notation stack 栈
摘要：Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another express... 阅读全文
posted @ 2015-03-17 23:08 A_zhu 阅读(252) 评论(0) 推荐(0)
[LeetCode] Repeated DNA Sequences hash map
摘要：All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to ... 阅读全文
posted @ 2015-03-15 15:26 A_zhu 阅读(689) 评论(1) 推荐(0)
[LeetCode] Largest Number 排序
摘要：Given a list of non negative integers, arrange them such that they form the largest number.For example, given[3, 30, 34, 5, 9], the largest formed num... 阅读全文
posted @ 2015-03-13 19:05 A_zhu 阅读(226) 评论(0) 推荐(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.Hide TagsTreeDepth-first Search 实现方法有两种，一种是二叉树自下往上 实... 阅读全文
posted @ 2015-03-13 17:38 A_zhu 阅读(185) 评论(0) 推荐(0)
[LeetCode] Populating Next Right Pointers in Each Node 深度搜索
摘要：Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文
posted @ 2015-03-13 13:04 A_zhu 阅读(211) 评论(0) 推荐(0)
[LeetCode] Binary Search Tree Iterator 深度搜索
摘要：Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Callingnext()will return the next... 阅读全文
posted @ 2015-03-13 12:47 A_zhu 阅读(202) 评论(0) 推荐(0)
[LeetCode] Best Time to Buy and Sell Stock II 贪心算法
摘要：Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文
posted @ 2015-03-12 19:35 A_zhu 阅读(251) 评论(0) 推荐(0)
[LeetCode] Find Peak Element 二分搜索
摘要：A peak element is an element that is greater than its neighbors.Given an input array wherenum[i] ≠ num[i+1], find a peak element and return its index.... 阅读全文
posted @ 2015-03-12 17:40 A_zhu 阅读(639) 评论(0) 推荐(0)
[LeetCode] 3Sum Closest
摘要：Given an arraySofnintegers, find three integers inSsuch that the sum is closest to a given number, target. Return the sum of the three integers. You m... 阅读全文
posted @ 2015-03-12 17:07 A_zhu 阅读(215) 评论(0) 推荐(0)
[LeetCode] Gas Station 贪心
摘要：There areNgas stations along a circular route, where the amount of gas at stationiisgas[i].You have a car with an unlimited gas tank and it costscost[... 阅读全文
posted @ 2015-03-12 16:31 A_zhu 阅读(394) 评论(0) 推荐(0)
[LeetCode] Number of 1 Bits 位操作
摘要：Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as theHamming weight).For example, the 32-bit in... 阅读全文
posted @ 2015-03-10 17:55 A_zhu 阅读(1712) 评论(0) 推荐(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 an... 阅读全文
posted @ 2015-03-10 16:18 A_zhu 阅读(152) 评论(0) 推荐(0)
[LeetCode] Remove Duplicates from Sorted List 链表
摘要：Given a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2, return1->2.Given1->1->2->3->3, retu... 阅读全文
posted @ 2015-03-10 16:13 A_zhu 阅读(154) 评论(0) 推荐(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... 阅读全文
posted @ 2015-03-10 14:25 A_zhu 阅读(156) 评论(0) 推荐(0)
[LeetCode] Remove Nth Node From End of List 快慢指针
摘要：Given a linked list, remove thenthnode from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After re... 阅读全文
posted @ 2015-03-10 04:23 A_zhu 阅读(194) 评论(0) 推荐(0)
[LeetCode] String to Integer (atoi) 字符串
摘要：Implementatoito convert a string to an integer.Hint:Carefully consider all possible input cases. If you want a challenge, please do not see below and ... 阅读全文
posted @ 2015-03-10 04:10 A_zhu 阅读(219) 评论(0) 推荐(0)
[LeetCode] Min Stack 栈
摘要：Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes... 阅读全文
posted @ 2015-03-09 20:33 A_zhu 阅读(210) 评论(0) 推荐(0)
[LeetCode] Compare Version Numbers 字符串操作
摘要：Compare two version numbersversion1andversion2.Ifversion1>version2return 1, ifversion1#include using namespace std;class Solution {public: int comp... 阅读全文
posted @ 2015-03-09 16:11 A_zhu 阅读(355) 评论(0) 推荐(0)
[LeetCode] Excel Sheet Column Title
摘要：Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 ->... 阅读全文
posted @ 2015-03-09 15:38 A_zhu 阅读(145) 评论(0) 推荐(0)
[LeetCode] Majority Element
摘要：Given an array of sizen, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋times.You may assume that the arr... 阅读全文
posted @ 2015-03-09 14:37 A_zhu 阅读(155) 评论(0) 推荐(0)
[LeetCode] Excel Sheet Column Number
摘要：Related to questionExcel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A ... 阅读全文
posted @ 2015-03-09 14:23 A_zhu 阅读(161) 评论(0) 推荐(0)
[LeetCode] Reverse Bits 位操作
摘要：Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as00000010100101000001111010011100), return ... 阅读全文
posted @ 2015-03-09 14:13 A_zhu 阅读(2320) 评论(0) 推荐(0)