11 2014 档案

Word Break
摘要：Given a stringsand a dictionary of wordsdict, determine ifscan be segmented into a space-separated sequence of one or more dictionary words.For exampl... 阅读全文
posted @ 2014-11-30 21:20 Jessica程序猿 阅读(281) 评论(0) 推荐(0)
N-Queens II
摘要：Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.#include#include#includeusi... 阅读全文
posted @ 2014-11-30 20:28 Jessica程序猿 阅读(166) 评论(0) 推荐(0)
N-Queens
摘要：Then-queens puzzle is the problem of placingnqueens on ann×nchessboard such that no two queens attack each other.Given an integern, return all distinc... 阅读全文
posted @ 2014-11-30 19:37 Jessica程序猿 阅读(274) 评论(0) 推荐(0)
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 ... 阅读全文
posted @ 2014-11-30 18:32 Jessica程序猿 阅读(178) 评论(0) 推荐(0)
Minimum Window Substring
摘要：Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S="ADOBECODEBA... 阅读全文
posted @ 2014-11-30 09:45 Jessica程序猿 阅读(181) 评论(0) 推荐(0)
Word Ladder
摘要：Given two words (startandend), and a dictionary, find the length of shortest transformation sequence fromstarttoend, such that:Only one letter can be ... 阅读全文
posted @ 2014-11-29 23:29 Jessica程序猿 阅读(376) 评论(0) 推荐(0)
Interleaving String
摘要：Dynamic ProgrammingGivens1,s2,s3, find whethers3is formed by the interleaving ofs1ands2.For example,Given:s1="aabcc",s2="dbbca",Whens3="aadbbcbcac", r... 阅读全文
posted @ 2014-11-29 21:38 Jessica程序猿 阅读(213) 评论(0) 推荐(0)
Binary Tree Maximum Path Sum
摘要：Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 ... 阅读全文
posted @ 2014-11-29 20:33 Jessica程序猿 阅读(287) 评论(0) 推荐(0)
Surrounded Regions
摘要：Given a 2D board containing'X'and'O', capture all regions surrounded by'X'.A region is captured by flipping all'O's into'X's in that surrounded region... 阅读全文
posted @ 2014-11-29 19:07 Jessica程序猿 阅读(243) 评论(0) 推荐(0)
Maximal Rectangle
摘要：Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.参考：http://xpentium.blog.163.com/b... 阅读全文
posted @ 2014-11-29 16:20 Jessica程序猿 阅读(218) 评论(0) 推荐(0)
Largest Rectangle in Histogram
摘要：Givennnon-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histog... 阅读全文
posted @ 2014-11-29 14:39 Jessica程序猿 阅读(156) 评论(0) 推荐(0)
Best Time to Buy and Sell Stock III
摘要：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 @ 2014-11-29 11:55 Jessica程序猿 阅读(177) 评论(0) 推荐(0)
Edit Distance
摘要：Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the fol... 阅读全文
posted @ 2014-11-29 10:38 Jessica程序猿 阅读(271) 评论(0) 推荐(0)
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 @ 2014-11-29 10:11 Jessica程序猿 阅读(194) 评论(0) 推荐(0)
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 @ 2014-11-28 20:36 Jessica程序猿 阅读(633) 评论(0) 推荐(0)
Palindrome Partitioning
摘要：Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv... 阅读全文
posted @ 2014-11-28 17:03 Jessica程序猿 阅读(205) 评论(0) 推荐(0)
Intersection of Two Linked Lists
摘要：Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a... 阅读全文
posted @ 2014-11-28 11:16 Jessica程序猿 阅读(217) 评论(0) 推荐(0)
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 @ 2014-11-27 17:25 Jessica程序猿 阅读(219) 评论(0) 推荐(0)
Decode Ways
摘要：A message containing letters fromA-Zis being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message conta... 阅读全文
posted @ 2014-11-27 16:11 Jessica程序猿 阅读(156) 评论(0) 推荐(0)
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 telephon... 阅读全文
posted @ 2014-11-27 14:33 Jessica程序猿 阅读(156) 评论(0) 推荐(0)
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 @ 2014-11-27 12:52 Jessica程序猿 阅读(147) 评论(0) 推荐(0)
Generate Parentheses
摘要：Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))... 阅读全文
posted @ 2014-11-27 10:54 Jessica程序猿 阅读(234) 评论(0) 推荐(0)
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 @ 2014-11-27 10:32 Jessica程序猿 阅读(151) 评论(0) 推荐(0)
Combination Sum II
摘要：Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Each number ... 阅读全文
posted @ 2014-11-27 09:59 Jessica程序猿 阅读(185) 评论(0) 推荐(0)
Combination Sum
摘要：Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thesamerepeated num... 阅读全文
posted @ 2014-11-27 09:13 Jessica程序猿 阅读(203) 评论(0) 推荐(0)
Candy
摘要：动态规划：There areNchildren standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following ... 阅读全文
posted @ 2014-11-26 22:46 Jessica程序猿 阅读(273) 评论(0) 推荐(0)
Divide Two Integers
摘要：Divide two integers without using multiplication, division and mod operator.思路：这道题属于数值处理的题目，对于整数处理的问题，在Reverse Integer中我有提到过，比较重要的注意点在于符号和处理越界的问题。对于这道... 阅读全文
posted @ 2014-11-26 21:54 Jessica程序猿 阅读(164) 评论(0) 推荐(0)
LRU Cache
摘要：Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the valu... 阅读全文
posted @ 2014-11-26 17:24 Jessica程序猿 阅读(398) 评论(0) 推荐(0)
Max Points on a Line
摘要：Givennpoints on a 2D plane, find the maximum number of points that lie on the same straight line.参考：http://blog.csdn.net/doc_sgl/article/details/17103... 阅读全文
posted @ 2014-11-26 16:22 Jessica程序猿 阅读(170) 评论(0) 推荐(0)
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 ... 阅读全文
posted @ 2014-11-26 10:50 Jessica程序猿 阅读(225) 评论(0) 推荐(0)
Copy List with Random Pointer
摘要：A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy ... 阅读全文
posted @ 2014-11-26 09:27 Jessica程序猿 阅读(169) 评论(0) 推荐(0)
Anagrams
摘要：Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.参考：http://www.cnblogs.com/AnnieKim/ar... 阅读全文
posted @ 2014-11-25 22:39 Jessica程序猿 阅读(227) 评论(0) 推荐(0)
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 @ 2014-11-25 21:47 Jessica程序猿 阅读(220) 评论(0) 推荐(0)
Unique Binary Search Trees II
摘要：Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 uni... 阅读全文
posted @ 2014-11-25 20:01 Jessica程序猿 阅读(198) 评论(0) 推荐(0)
Trapping Rain Water
摘要：Givennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.Fo... 阅读全文
posted @ 2014-11-25 17:23 Jessica程序猿 阅读(134) 评论(0) 推荐(0)
4Sum
摘要：Given an arraySofnintegers, are there elementsa,b,c, anddinSsuch thata+b+c+d= target? Find all unique quadruplets in the array which gives the sum of ... 阅读全文
posted @ 2014-11-25 13:59 Jessica程序猿 阅读(154) 评论(0) 推荐(0)
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 @ 2014-11-25 13:02 Jessica程序猿 阅读(147) 评论(0) 推荐(0)
3Sum
摘要：Given an arraySofnintegers, are there elementsa,b,cinSsuch thata+b+c= 0? Find all unique triplets in the array which gives the sum of zero.Note:Elemen... 阅读全文
posted @ 2014-11-25 11:31 Jessica程序猿 阅读(187) 评论(0) 推荐(0)
Longest Valid Parentheses
摘要：Given a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substring.For"(()", the longest... 阅读全文
posted @ 2014-11-24 22:13 Jessica程序猿 阅读(162) 评论(0) 推荐(0)
Multiply Strings
摘要：Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-nega... 阅读全文
posted @ 2014-11-24 21:20 Jessica程序猿 阅读(175) 评论(0) 推荐(0)
Insert Interval
摘要：Given a set ofnon-overlappingintervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially... 阅读全文
posted @ 2014-11-24 20:10 Jessica程序猿 阅读(185) 评论(0) 推荐(0)
Merge Intervals
摘要：Given a collection of intervals, merge all overlapping intervals.For example,Given[1,3],[2,6],[8,10],[15,18],return[1,6],[8,10],[15,18].思路：首先以start排序，... 阅读全文
posted @ 2014-11-24 18:24 Jessica程序猿 阅读(205) 评论(0) 推荐(0)
Merge k Sorted Lists
摘要：Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.思路：开始做过两两合并的链表，此时做k路合并，即将k个链表进行合并，可以先将这k个链表进行两两合并，知道合并... 阅读全文
posted @ 2014-11-24 17:02 Jessica程序猿 阅读(196) 评论(0) 推荐(0)
Sqrt(x)
摘要：Implementint sqrt(int x).Compute and return the square root ofx.这里给出两种实现方法：一是二分搜索，二是牛顿迭代法。1. 二分搜索对于一个非负数n，它的平方根不会小于大于（n/2+1）。在[0, n/2+1]这个范围内可以进行二分搜索，... 阅读全文
posted @ 2014-11-24 15:59 Jessica程序猿 阅读(477) 评论(0) 推荐(0)
First Missing Positive
摘要：Given an unsorted integer array, find the first missing positive integer.For example,Given[1,2,0]return3,and[3,4,-1,1]return2.Your algorithm should ru... 阅读全文
posted @ 2014-11-24 12:34 Jessica程序猿 阅读(154) 评论(0) 推荐(0)
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.C++实现代码：#inclu... 阅读全文
posted @ 2014-11-24 10:09 Jessica程序猿 阅读(192) 评论(0) 推荐(0)
Construct Binary Tree from Preorder and Inorder Traversal
摘要：Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.提交成功的代码：C++实现：#... 阅读全文
posted @ 2014-11-24 09:59 Jessica程序猿 阅读(239) 评论(0) 推荐(0)
Distinct Subsequences
摘要：Dynamic ProgrammingGiven a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is f... 阅读全文
posted @ 2014-11-24 08:53 Jessica程序猿 阅读(207) 评论(0) 推荐(0)
Reverse Nodes in k-Group
摘要：Given a linked list, reverse the nodes of a linked listkat a time and return its modified list.If the number of nodes is not a multiple ofkthen left-o... 阅读全文
posted @ 2014-11-23 22:27 Jessica程序猿 阅读(197) 评论(0) 推荐(0)
Jump Game II
摘要：Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu... 阅读全文
posted @ 2014-11-23 18:35 Jessica程序猿 阅读(166) 评论(0) 推荐(0)
Jump Game
摘要：Dynamic Programming参考：http://fisherlei.blogspot.com/2012/12/leetcode-jump-game.htmlhttp://blog.csdn.net/linhuanmars/article/details/21354751Given an a... 阅读全文
posted @ 2014-11-23 16:44 Jessica程序猿 阅读(245) 评论(0) 推荐(0)
Convert Sorted List to Binary Search Tree
摘要：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.C++代码实现：#include#include#include#includeu... 阅读全文
posted @ 2014-11-23 15:16 Jessica程序猿 阅读(166) 评论(0) 推荐(0)
Subsets II
摘要：Given a collection of integers that might contain duplicates,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.... 阅读全文
posted @ 2014-11-23 11:52 Jessica程序猿 阅读(192) 评论(1) 推荐(0)
Subsets
摘要：Given a set of distinct integers,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not co... 阅读全文
posted @ 2014-11-23 11:20 Jessica程序猿 阅读(179) 评论(0) 推荐(0)
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 ... 阅读全文
posted @ 2014-11-23 08:56 Jessica程序猿 阅读(185) 评论(0) 推荐(0)
Search in Rotated Sorted Array II
摘要：Follow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Write a function to... 阅读全文
posted @ 2014-11-22 21:21 Jessica程序猿 阅读(154) 评论(0) 推荐(0)
Search in Rotated Sorted Array
摘要：Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).You are given a target value t... 阅读全文
posted @ 2014-11-22 21:09 Jessica程序猿 阅读(169) 评论(0) 推荐(0)
Find Minimum in Rotated Sorted Array II
摘要：Follow upfor "Find Minimum in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Suppose a sort... 阅读全文
posted @ 2014-11-22 18:55 Jessica程序猿 阅读(185) 评论(0) 推荐(0)
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 le... 阅读全文
posted @ 2014-11-22 16:08 Jessica程序猿 阅读(192) 评论(0) 推荐(0)
Binary Tree Postorder Traversal
摘要：Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].C+... 阅读全文
posted @ 2014-11-22 08:23 Jessica程序猿 阅读(174) 评论(0) 推荐(0)
Convert Sorted Array to Binary Search Tree
摘要：Given an array where elements are sorted in ascending order, convert it to a height balanced BST.首先我是要AVL树的创建过程进行操作，不过提交之后出现超时，但还是让我将AVL树的创建过程实现了一遍，记录... 阅读全文
posted @ 2014-11-21 22:25 Jessica程序猿 阅读(234) 评论(0) 推荐(0)
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 @ 2014-11-21 20:25 Jessica程序猿 阅读(164) 评论(0) 推荐(0)
Gray Code
摘要：The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integernrepresenting the total number... 阅读全文
posted @ 2014-11-21 19:39 Jessica程序猿 阅读(170) 评论(0) 推荐(0)
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 @ 2014-11-21 18:47 Jessica程序猿 阅读(145) 评论(0) 推荐(0)
Best Time to Buy and Sell Stock
摘要：Dynamic ProgrammingSay you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most ... 阅读全文
posted @ 2014-11-21 17:39 Jessica程序猿 阅读(130) 评论(0) 推荐(0)
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 le... 阅读全文
posted @ 2014-11-21 17:05 Jessica程序猿 阅读(169) 评论(0) 推荐(0)
Next Permutation
摘要：Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possibl... 阅读全文
posted @ 2014-11-21 15:33 Jessica程序猿 阅读(176) 评论(0) 推荐(0)
LeetCode:Permutations(求全排列)
摘要：Given a collection of numbers, return all possible permutations.For example,[1,2,3]have the following permutations:[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,... 阅读全文
posted @ 2014-11-21 13:41 Jessica程序猿 阅读(230) 评论(0) 推荐(0)
Evaluate Reverse Polish Notation
摘要：Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another express... 阅读全文
posted @ 2014-11-21 10:45 Jessica程序猿 阅读(222) 评论(0) 推荐(0)
Rotate Image
摘要：You are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?C++实现代码：#include#in... 阅读全文
posted @ 2014-11-21 10:05 Jessica程序猿 阅读(215) 评论(0) 推荐(0)
Pow(x, n)
摘要：Implement pow(x,n).C++实现代码：#includeusing namespace std;class Solution{public: double pow(double x, int n) { if(x==0&&n==0) ret... 阅读全文
posted @ 2014-11-21 09:16 Jessica程序猿 阅读(187) 评论(0) 推荐(0)
Search Insert Position
摘要：Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or... 阅读全文
posted @ 2014-11-21 08:36 Jessica程序猿 阅读(182) 评论(0) 推荐(0)
Maximum Subarray
摘要：Dynamic ProgrammingFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the arra... 阅读全文
posted @ 2014-11-21 08:23 Jessica程序猿 阅读(166) 评论(0) 推荐(0)
Spiral Matrix II
摘要：Given an integern, generate a square matrix filled with elements from 1 ton2in spiral order.For example,Givenn=3,You should return the following matri... 阅读全文
posted @ 2014-11-20 21:59 Jessica程序猿 阅读(187) 评论(0) 推荐(0)
Spiral Matrix
摘要：Given a matrix ofmxnelements (mrows,ncolumns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ],... 阅读全文
posted @ 2014-11-20 21:29 Jessica程序猿 阅读(157) 评论(0) 推荐(0)
Rotate List
摘要：Given a list, rotate the list to the right bykplaces, wherekis non-negative.For example:Given1->2->3->4->5->NULLandk=2,return4->5->1->2->3->NULL.注意：当给... 阅读全文
posted @ 2014-11-20 18:49 Jessica程序猿 阅读(151) 评论(0) 推荐(0)
Unique Paths II
摘要：Dynamic ProgrammingFollow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacl... 阅读全文
posted @ 2014-11-20 14:58 Jessica程序猿 阅读(160) 评论(0) 推荐(0)
Unique Paths
摘要：Dynamic ProgrammingA robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or ... 阅读全文
posted @ 2014-11-20 13:47 Jessica程序猿 阅读(158) 评论(0) 推荐(0)
Minimum Path Sum
摘要：Dynamic ProgrammingGiven amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers alo... 阅读全文
posted @ 2014-11-20 13:21 Jessica程序猿 阅读(130) 评论(0) 推荐(0)
[译]C++如何切分字符串
摘要：声明：翻译仅以技术学习和交流为目的，如需转载请务必标明原帖链接。http://stackoverflow.com/questions/236129/how-to-split-a-string-in-c水平有限，如有翻译不当，欢迎探讨、批评与指正。帖子内容：C++ 切分字符串的最优雅的方式是什么？我们... 阅读全文
posted @ 2014-11-20 10:35 Jessica程序猿 阅读(798) 评论(0) 推荐(0)
Reverse Words in a String
摘要：Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".click to show clarification.Cl... 阅读全文
posted @ 2014-11-20 10:28 Jessica程序猿 阅读(151) 评论(0) 推荐(0)
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 @ 2014-11-19 20:39 Jessica程序猿 阅读(192) 评论(0) 推荐(0)
Set Matrix Zeroes
摘要：Given amxnmatrix, 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 s... 阅读全文
posted @ 2014-11-19 19:31 Jessica程序猿 阅读(160) 评论(0) 推荐(0)
Flatten Binary Tree to Linked List
摘要：Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened t... 阅读全文
posted @ 2014-11-19 17:17 Jessica程序猿 阅读(181) 评论(0) 推荐(0)
Triangle
摘要：Dynamic ProgrammingGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For exa... 阅读全文
posted @ 2014-11-19 17:00 Jessica程序猿 阅读(276) 评论(0) 推荐(0)
Search a 2D Matrix
摘要：Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted from l... 阅读全文
posted @ 2014-11-19 16:34 Jessica程序猿 阅读(258) 评论(0) 推荐(0)
Sort Colors
摘要：Given an array withnobjects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, wh... 阅读全文
posted @ 2014-11-19 15:23 Jessica程序猿 阅读(163) 评论(0) 推荐(0)
Remove Duplicates from Sorted Array II
摘要：Follow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted array A =[1,1,1,2,2,3],Your function should ret... 阅读全文
posted @ 2014-11-19 13:30 Jessica程序猿 阅读(168) 评论(0) 推荐(0)
Maximum Product Subarray
摘要：Dynamic ProgrammingFind the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the ... 阅读全文
posted @ 2014-11-19 09:47 Jessica程序猿 阅读(177) 评论(0) 推荐(0)
Remove Duplicates from Sorted List II
摘要：Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-... 阅读全文
posted @ 2014-11-18 23:15 Jessica程序猿 阅读(200) 评论(0) 推荐(0)
Swap Nodes in Pairs
摘要：Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor... 阅读全文
posted @ 2014-11-18 21:28 Jessica程序猿 阅读(175) 评论(0) 推荐(0)
Valid Sudoku
摘要：Determine if a Sudoku is valid, according to:Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with ... 阅读全文
posted @ 2014-11-18 21:06 Jessica程序猿 阅读(230) 评论(0) 推荐(0)
Partition List
摘要：Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi... 阅读全文
posted @ 2014-11-18 19:19 Jessica程序猿 阅读(165) 评论(0) 推荐(0)
Single Number II
摘要：Given an array of integers, every element appearsthreetimes except for one. Find that single one.Note:Your algorithm should have a linear runtime comp... 阅读全文
posted @ 2014-11-18 17:16 Jessica程序猿 阅读(168) 评论(0) 推荐(0)
Single Number
摘要：Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime complexity... 阅读全文
posted @ 2014-11-18 17:05 Jessica程序猿 阅读(206) 评论(0) 推荐(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 fo... 阅读全文
posted @ 2014-11-18 15:36 Jessica程序猿 阅读(174) 评论(0) 推荐(0)
Sort List （使用归并排序的链表排序）
摘要：Sort a linked list inO(nlogn) time using constant space complexity.C++代码的实现：#include#includeusing namespace std;//Definition for singly-linked list.st... 阅读全文
posted @ 2014-11-18 13:18 Jessica程序猿 阅读(212) 评论(0) 推荐(0)
Sum Root to Leaf Numbers
摘要：Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which rep... 阅读全文
posted @ 2014-11-18 11:07 Jessica程序猿 阅读(174) 评论(0) 推荐(0)
Count and Say
摘要：The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.11is read off as"tw... 阅读全文
posted @ 2014-11-18 10:18 Jessica程序猿 阅读(212) 评论(0) 推荐(0)
C++ int转string
摘要：一、使用atoi说明：itoa( int value, char *string, int radix ); 第一个参数：你要转化的int; 第二个参数：转化后的char*; 第三个参数：你要转化的进制;举例：//------------------------------------- //功能... 阅读全文
posted @ 2014-11-18 10:13 Jessica程序猿 阅读(6495) 评论(0) 推荐(0)
Reverse Linked List II
摘要：Reverse a linked list from positionmton. Do it in-place and in one-pass.For example:Given1->2->3->4->5->NULL,m= 2 andn= 4,return1->4->3->2->5->NULL.No... 阅读全文
posted @ 2014-11-17 23:11 Jessica程序猿 阅读(214) 评论(0) 推荐(0)
Unique Binary Search Trees
摘要：Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1... 阅读全文
posted @ 2014-11-17 13:26 Jessica程序猿 阅读(141) 评论(0) 推荐(0)
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 / \ ... 阅读全文
posted @ 2014-11-17 10:10 Jessica程序猿 阅读(158) 评论(0) 推荐(0)
Validate Binary Search Tree
摘要：Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only n... 阅读全文
posted @ 2014-11-17 08:51 Jessica程序猿 阅读(230) 评论(0) 推荐(0)
Find Minimum in Rotated Sorted Array
摘要：Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.You m... 阅读全文
posted @ 2014-11-16 22:55 Jessica程序猿 阅读(134) 评论(0) 推荐(0)
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 nu... 阅读全文
posted @ 2014-11-16 20:32 Jessica程序猿 阅读(219) 评论(0) 推荐(0)
Binary Tree Zigzag Level Order Traversal
摘要：Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al... 阅读全文
posted @ 2014-11-16 17:18 Jessica程序猿 阅读(232) 评论(0) 推荐(0)
Linked List Cycle II
摘要：Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?本来不... 阅读全文
posted @ 2014-11-16 16:00 Jessica程序猿 阅读(218) 评论(0) 推荐(0)
Reorder List
摘要：Given a singly linked listL: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 exam... 阅读全文
posted @ 2014-11-16 14:04 Jessica程序猿 阅读(164) 评论(0) 推荐(0)
Binary Tree Preorder Traversal
摘要：Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].二叉树... 阅读全文
posted @ 2014-11-16 12:41 Jessica程序猿 阅读(174) 评论(0) 推荐(0)
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 andsum =... 阅读全文
posted @ 2014-11-16 09:43 Jessica程序猿 阅读(222) 评论(0) 推荐(0)
Populating Next Right Pointers in Each Node
摘要：Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文
posted @ 2014-11-15 22:33 Jessica程序猿 阅读(189) 评论(0) 推荐(0)
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 ... 阅读全文
posted @ 2014-11-15 20:53 Jessica程序猿 阅读(153) 评论(0) 推荐(0)
Insertion Sort List
摘要：Sort a linked list using insertion sort.C++代码如下：#include#includeusing namespace std;//Definition for singly-linked list.struct ListNode{ int val; ... 阅读全文
posted @ 2014-11-15 20:08 Jessica程序猿 阅读(216) 评论(0) 推荐(0)
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 @ 2014-11-15 17:22 Jessica程序猿 阅读(170) 评论(0) 推荐(0)
Binary Tree Level Order Traversal II
摘要：Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa... 阅读全文
posted @ 2014-11-15 17:03 Jessica程序猿 阅读(240) 评论(0) 推荐(0)
Binary Tree Level Order Traversal
摘要：Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2... 阅读全文
posted @ 2014-11-15 16:47 Jessica程序猿 阅读(203) 评论(0) 推荐(0)
ZigZag Conversion
摘要：The string"PAYPALISHIRING"is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font fo... 阅读全文
posted @ 2014-11-15 15:30 Jessica程序猿 阅读(201) 评论(0) 推荐(0)
Reverse Integer
摘要：Reverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321click to show spoilers.Have you thought about this?Here are som... 阅读全文
posted @ 2014-11-15 12:38 Jessica程序猿 阅读(164) 评论(0) 推荐(0)
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 @ 2014-11-15 11:03 Jessica程序猿 阅读(218) 评论(0) 推荐(0)
Palindrome Number
摘要：Determine whether an integer is a palindrome. Do this without extra space.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinki... 阅读全文
posted @ 2014-11-15 08:55 Jessica程序猿 阅读(155) 评论(0) 推荐(0)
Longest Common Prefix
摘要：Write a function to find the longest common prefix string amongst an array of strings.（每个字符串从0开始的公共部分即最长公共前缀）C++代码如下：#include#include#includeusing nam... 阅读全文
posted @ 2014-11-14 22:18 Jessica程序猿 阅读(249) 评论(0) 推荐(0)
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 @ 2014-11-14 21:46 Jessica程序猿 阅读(177) 评论(0) 推荐(0)
Valid Parentheses
摘要：Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.The brackets must close in the correct ... 阅读全文
posted @ 2014-11-14 20:27 Jessica程序猿 阅读(165) 评论(0) 推荐(0)
Remove Duplicates from Sorted Array
摘要：Remove Duplicates from Sorted ArrayGiven a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new lengt... 阅读全文
posted @ 2014-11-14 19:59 Jessica程序猿 阅读(138) 评论(0) 推荐(0)
Remove Element
摘要：Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't mat... 阅读全文
posted @ 2014-11-14 19:04 Jessica程序猿 阅读(119) 评论(0) 推荐(0)
Implement strStr()
摘要：Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.这个题应该就是求子串的问题，改进的方法是kmp算法。... 阅读全文
posted @ 2014-11-14 17:22 Jessica程序猿 阅读(228) 评论(0) 推荐(0)
Length of Last Word
摘要：Given a stringsconsists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word doe... 阅读全文
posted @ 2014-11-14 16:04 Jessica程序猿 阅读(200) 评论(0) 推荐(0)
Merge Two Sorted Lists
摘要：Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.C++代码如下：#... 阅读全文
posted @ 2014-11-14 15:33 Jessica程序猿 阅读(210) 评论(0) 推荐(0)
Plus One
摘要：Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at... 阅读全文
posted @ 2014-11-14 10:53 Jessica程序猿 阅读(285) 评论(0) 推荐(0)
Climbing Stairs
摘要：You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb... 阅读全文
posted @ 2014-11-14 09:12 Jessica程序猿 阅读(139) 评论(0) 推荐(0)
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 @ 2014-11-14 09:09 Jessica程序猿 阅读(178) 评论(0) 推荐(0)
Merge Sorted Array
摘要：Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal... 阅读全文
posted @ 2014-11-14 09:06 Jessica程序猿 阅读(189) 评论(0) 推荐(0)
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.Fo... 阅读全文
posted @ 2014-11-13 21:36 Jessica程序猿 阅读(164) 评论(0) 推荐(0)
Pascal's Triangle
摘要：GivennumRows, generate the firstnumRowsof Pascal's triangle.For example, givennumRows= 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]... 阅读全文
posted @ 2014-11-13 18:36 Jessica程序猿 阅读(235) 评论(0) 推荐(0)
Pascal's Triangle II
摘要：Given an indexk, return thekthrow of the Pascal's triangle.For example, givenk= 3,Return[1,3,3,1].Note:Could you optimize your algorithm to use onlyO(... 阅读全文
posted @ 2014-11-13 17:29 Jessica程序猿 阅读(160) 评论(0) 推荐(0)
Valid Palindrome
摘要：Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Pana... 阅读全文
posted @ 2014-11-13 16:35 Jessica程序猿 阅读(163) 评论(0) 推荐(0)
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 @ 2014-11-13 15:53 Jessica程序猿 阅读(268) 评论(0) 推荐(0)
关于虚拟继承类的大小问题探索，VC++ 和 G++ 结果是有区别的
摘要：昨天笔试遇到个 关于类占用的空间大小的问题，以前没怎么重视，回来做个试验，还真发现了问题，以后各位笔试考官门，出题时请注明是用什么编译器。 vc6/vc8 cl 和 Dev-C 的g++ 来做的测试:上代码，测试代码：#include class A{public:int x; int y;A(){... 阅读全文
posted @ 2014-11-13 10:31 Jessica程序猿 阅读(776) 评论(0) 推荐(0)
对象内存布局 (15)
摘要：重复继承下面我们再来看看，发生重复继承的情况。所谓重复继承，也就是某个基类被间接地重复继承了多次。下图是一个继承图，我们重载了父类的f()函数。其类继承的源代码如下所示。其中，每个类都有两个变量，一个是整形（4字节），一个是字符（1字节），而且还有自己的虚函数，自己overwrite父类的虚函数。如... 阅读全文
posted @ 2014-11-12 21:27 Jessica程序猿 阅读(265) 评论(0) 推荐(0)
对象内存布局 (14)
摘要：前言07年12月，我写了一篇《C++虚函数表解析》的文章，引起了大家的兴趣。有很多朋友对我的文章留了言，有鼓励我的，有批评我的，还有很多问问题的。我在这里一并对大家的留言表示感谢。这也是我为什么再写一篇续言的原因。因为，在上一篇文章中，我用了的示例都是非常简单的，主要是为了说明一些机理上的问题，也是... 阅读全文
posted @ 2014-11-12 21:11 Jessica程序猿 阅读(225) 评论(0) 推荐(0)
对象内存布局 (13)——上一篇的纠正
摘要：下面来看看虚基类对对象内存布局的影响。虚基类的主要作用就是在所有的派生类中，保留且仅保留一份虚基类的suboject。#include using namespace std;class Base{public: int m_base; Base():m_base(20){} vi... 阅读全文
posted @ 2014-11-12 20:57 Jessica程序猿 阅读(205) 评论(0) 推荐(0)
对象内存布局 (12)
摘要：下面来看看虚基类对对象内存布局的影响。虚基类的主要作用就是在所有的派生类中，保留且仅保留一份虚基类的suboject。a. 一个虚基类的情况#include using namespace std;class Base{public: int base_member;};class Deriv... 阅读全文
posted @ 2014-11-12 14:14 Jessica程序猿 阅读(206) 评论(0) 推荐(0)
对象内存布局 (11)
摘要：注意：关于内存对齐(memory alignment)，请看关于内存对齐问题，后面将会用到。下面我们进行在普通继承(即非虚继承)时，派生类的指针转换到基类指针的情形研究。假定各类之间的关系如下图：代码如下：#include using namespace std;class Parent{publi... 阅读全文
posted @ 2014-11-12 13:41 Jessica程序猿 阅读(189) 评论(0) 推荐(0)
对象内存布局 (10)
摘要：在对象内存布局 (9)基础上做些修改：派生类override基类的虚函数，即Base2 override Base1中声明的虚函数vfBase1()，Base3 override Base1中声明的虚函数vfBase1()和Base2中声明的虚函数vfBase2()， Derived overrid... 阅读全文
posted @ 2014-11-12 11:18 Jessica程序猿 阅读(154) 评论(0) 推荐(0)
对象内存布局 (9)
摘要：假定多层继承的各类之间的关系如下图。假定派生类不override基类的虚函数，即Base2不override Base1中声明的虚函数vfBase1()，Base3不override Base2中声明的虚函数vfBase2()，Derived不override Base3中声明的虚函数vfBase3... 阅读全文
posted @ 2014-11-12 11:11 Jessica程序猿 阅读(196) 评论(0) 推荐(0)
对象内存布局 (8)
摘要：在内存对象布局 (5)的代码中，在Derived类中将三个基类中的虚函数分别覆盖一个，即分别覆盖Base1中声明的vfBase1_1()，Base2中声明的vfBase2_1()以及Base3中声明的vfBase3_1()。保持其他代码不变，修改后的Derived代码如下：#include usin... 阅读全文
posted @ 2014-11-12 11:02 Jessica程序猿 阅读(187) 评论(0) 推荐(0)
对象内存布局 (7)
摘要：在对象内存布局 (5)的代码中，在Derived类中覆盖Base1中声明的vfBase1_1()，其他代码不变。修改后的代码如下：#include using namespace std;class Base1{public: int m_base1; inline virtual vo... 阅读全文
posted @ 2014-11-12 10:57 Jessica程序猿 阅读(236) 评论(0) 推荐(0)
对象内存布局 (6)
摘要：如果在对象内存布局 (5)的代码中，将Base1中的两个虚函数声明删除，同时将main函数中的下面代码注释掉(因为现在只有两张虚函数表了)：代码如下：#include using namespace std;class Base1{public: int m_base1; /*inlin... 阅读全文
posted @ 2014-11-12 10:45 Jessica程序猿 阅读(166) 评论(0) 推荐(0)
对象内存布局 (5)
摘要：内容概要：满足下面3个条件时，1. 父类有虚函数，子类也有虚函数，且子类的虚函数重写或覆盖了父类的虚函数2. 非虚继承3. 多重继承类对象之内存布局多重继承，派生类不重写基类中的虚函数。假定各类之间的关系如下图：代码如下：#include using namespace std;class Base... 阅读全文
posted @ 2014-11-12 09:32 Jessica程序猿 阅读(201) 评论(0) 推荐(0)
对象内存布局 (4)
摘要：内容概要：满足下面2个条件时，1. 父类有虚函数，子类也有虚函数，且子类的虚函数重写或覆盖了父类的虚函数2. 非虚继承类对象之内存布局在前面的例子中，恢复原来的两个虚函数vfBase_1()和vfBase_2()，同时在Derived类中重写基类的虚函数vfBase_1()，Base类和Derive... 阅读全文
posted @ 2014-11-12 08:08 Jessica程序猿 阅读(152) 评论(0) 推荐(0)
对象内存布局 (3)
摘要：内容概要：满足下面2个条件时，1. 父类无虚函数，子类有虚函数2. 非虚继承类对象之内存布局如果将Base中的两个虚函数删除，情况有会怎么样呢？将Base中的两个虚函数删除，其他保持不变。Base类和Derived类两者之间的关系如下：代码如下：#include using namespace st... 阅读全文
posted @ 2014-11-11 23:32 Jessica程序猿 阅读(151) 评论(0) 推荐(0)
对象内存布局 (2)
摘要：内容概要：满足下面2个条件时，1. 父类有虚函数，子类也有虚函数，但子类并没有重写或覆盖父类的虚函数2. 非虚继承类对象之内存布局如果在Derived类中增加一个下面的虚函数，会怎么样呢？Base类和Derived类之间的关系如下：新加入的虚函数定义如下：#include using namespa... 阅读全文
posted @ 2014-11-11 23:25 Jessica程序猿 阅读(201) 评论(0) 推荐(0)
对象内存布局 (1)
摘要：内容概要：满足下面2个条件时，1. 父类有虚函数，子类无虚函数(即无虚函数重写或无虚函数覆盖)2. 非虚继承类对象之内存布局前述相关内容参考：1.http://blog.csdn.net/pathuang68/archive/2009/04/20/4096088.aspx2.http://blog.... 阅读全文
posted @ 2014-11-11 22:58 Jessica程序猿 阅读(340) 评论(0) 推荐(0)
C++虚函数及虚函数表解析
摘要：一、背景知识（一些基本概念）虚函数（Virtual Function）：在基类中声明为 virtual 并在一个或多个派生类中被重新定义的成员函数。纯虚函数（Pure Virtual Function）：基类中没有实现体的虚函数称为纯虚函数（有纯虚函数的基类称为虚基类）。C++ “虚函数”的存在是为... 阅读全文
posted @ 2014-11-08 23:21 Jessica程序猿 阅读(2309) 评论(1) 推荐(1)
C++ inline 函数
摘要：（一）inline函数（摘自C++ Primer的第三版）在函数声明或定义中函数返回类型前加上关键字inline即把min（）指定为内联。 inline int min(int first, int secend) {/****/}; inline 函数对编译器而言必须是可见的，以便它能够在调用点内... 阅读全文
posted @ 2014-11-07 20:18 Jessica程序猿 阅读(4714) 评论(0) 推荐(0)
第十六章 贪心算法——0/1背包问题
摘要：1、问题描述： 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为C。问:应如何选择装入背包的物品，使得装入背包中物品的总价值最大? 形式化描述：给定c >0, wi >0, vi >0 , 1≤i≤n.要求找一n元向量(x1,x2,…,xn,), xi∈{0,1}, ∋ ∑ wi... 阅读全文
posted @ 2014-11-07 13:57 Jessica程序猿 阅读(2241) 评论(0) 推荐(0)
动态规划——活动选择问题
摘要：一个递归解 设c[i][j]为Sij中最大兼容子集中的活动数目，当Sij为空集时，c[i][j]=0；当Sij非空时，若ak在Sij的最大兼容子集中被使用，则则问题Sik和Skj的最大兼容子集也被使用，故可得到c[i][j] = c[i][k]+c[k][j]+1。当i≥j时，Sij必定为空集，否... 阅读全文
posted @ 2014-11-07 10:31 Jessica程序猿 阅读(1039) 评论(0) 推荐(0)
第十六章 贪心算法——活动选择问题
摘要：前言：贪心算法也是用来解决最优化问题，将一个问题分成子问题，在现在子问题最优解的时，选择当前看起来是最优的解，期望通过所做的局部最优选择来产生一个全局最优解。书中先从活动选择问题来引入贪心算法，分别采用动态规划方法和贪心算法进行分析。本篇笔记给出活动选择问题的详细分析过程，并给出详细的实现代码进行测... 阅读全文
posted @ 2014-11-06 23:19 Jessica程序猿 阅读(1591) 评论(0) 推荐(0)
第十五章 动态规划——最优二叉搜索树
摘要：1、前言： 接着学习动态规划方法，最优二叉查找树问题。二叉查找树参考http://www.cnblogs.com/Anker/archive/2013/01/28/2880581.html。如果在二叉树中查找元素不考虑概率及查找不成功的情况下，可以采用红黑树或者平衡二叉树来搜索，这样可以在O(l... 阅读全文
posted @ 2014-11-06 19:59 Jessica程序猿 阅读(1490) 评论(0) 推荐(1)
第十五章 动态规划——最长公共子序列
摘要：1、基本概念 一个给定序列的子序列就是该给定序列中去掉零个或者多个元素的序列。形式化来讲就是：给定一个序列X={x1，x2，……，xm}，另外一个序列Z={z1、z2、……，zk}，如果存在X的一个严格递增小标序列，使得对所有j=1,2，……k，有xij =zj，则Z是X的子序列。例如：Z={B,... 阅读全文
posted @ 2014-11-06 16:12 Jessica程序猿 阅读(898) 评论(0) 推荐(0)
第十五章 动态规划——矩阵链乘法
摘要：前言：今天接着学习动态规划算法，学习如何用动态规划来分析解决矩阵链乘问题。首先回顾一下矩阵乘法运算法，并给出C++语言实现过程。然后采用动态规划算法分析矩阵链乘问题并给出C语言实现过程。1、矩阵乘法 从定义可以看出：只有当矩阵A的列数与矩阵B的行数相等时A×B才有意义。一个m×r的矩阵A... 阅读全文
posted @ 2014-11-06 10:14 Jessica程序猿 阅读(572) 评论(0) 推荐(0)
第十五章 动态规划——钢条切割
摘要：前言：动态规划的概念 动态规划（dynamic programming）是通过组合子问题的解而解决整个问题的。分治算法是指将问题划分为一些独立的子问题，递归的求解各个问题，然后合并子问题的解而得到原问题的解。例如归并排序，快速排序都是采用分治算法思想。本书在第二章介绍归并排序时，详细介绍了分治算法... 阅读全文
posted @ 2014-11-06 09:11 Jessica程序猿 阅读(863) 评论(0) 推荐(0)
第十四章 数据结构的扩张
摘要：前言：通常我们会遇到一些问题，采用一些标准的数据结构，如双链表、散列表或二叉查找数时，不能够满足操作要求，需要对这些数据结构进行扩张，添加一些额外的信息使得能够完成新的操作。附加的信息需要对数据结构的某些操作进行调整，这个是非常关键的步骤，决定着数据结构扩张是否能够实现。本章主要讨论了红黑树结构的扩... 阅读全文
posted @ 2014-11-05 20:12 Jessica程序猿 阅读(276) 评论(0) 推荐(0)
第十四章 红黑树——C++代码实现
摘要：红黑树的介绍红黑树(Red-Black Tree，简称R-B Tree)，它一种特殊的二叉查找树。红黑树是特殊的二叉查找树，意味着它满足二叉查找树的特征：任意一个节点所包含的键值，大于等于左孩子的键值，小于等于右孩子的键值。除了具备该特性之外，红黑树还包括许多额外的信息。红黑树的每个节点上都有存储位... 阅读全文
posted @ 2014-11-05 18:16 Jessica程序猿 阅读(472) 评论(0) 推荐(0)
第十三章 红黑树
摘要：R-B Tree简介 R-B Tree，全称是Red-Black Tree，又称为“红黑树”，它一种特殊的二叉查找树。红黑树的每个节点上都有存储位表示节点的颜色，可以是红(Red)或黑(Black)。红黑树的特性:（1）每个节点或者是黑色，或者是红色。（2）根节点是黑色。（3）每个叶子节点（NIL... 阅读全文
posted @ 2014-11-05 18:11 Jessica程序猿 阅读(325) 评论(0) 推荐(0)
第十二章 二叉搜索树
摘要：摘要： 本章介绍了二叉查找树的概念及操作。主要内容包括二叉查找树的性质，如何在二叉查找树中查找最大值、最小值和给定的值，如何找出某一个元素的前驱和后继，如何在二叉查找树中进行插入和删除操作。在二叉查找树上执行这些基本操作的时间与树的高度成正比，一棵随机构造的二叉查找树的期望高度为O(lgn)，从而... 阅读全文
posted @ 2014-11-04 22:10 Jessica程序猿 阅读(311) 评论(0) 推荐(0)
第十一章 散列表
摘要：摘要： 本章介绍了散列表（hash table）的概念、散列函数的设计及散列冲突的处理。散列表类似与字典的目录，查找的元素都有一个key与之对应，在实践当中，散列技术的效率是很高的，合理的设计散函数和冲突处理方法，可以使得在散列表中查找一个元素的期望时间为O(1)。散列表是普通数组概念的推广，在散... 阅读全文
posted @ 2014-11-04 16:32 Jessica程序猿 阅读(284) 评论(0) 推荐(0)
第十章 基本数据结构——二叉树
摘要：可以参考：http://www.cnblogs.com/dolphin0520/archive/2011/08/25/2153720.html摘要 书中第10章10.4小节介绍了有根树，简单介绍了二叉树和分支数目无限制的有根树的存储结构，而没有关于二叉树的遍历过程。为此对二叉树做个简单的总结，介绍... 阅读全文
posted @ 2014-11-03 23:28 Jessica程序猿 阅读(411) 评论(0) 推荐(0)
第十章 基本数据结构——链表
摘要：链表 链表与数组的区别是链表中的元素顺序是有各对象中的指针决定的，相邻元素之间在物理内存上不一定相邻。采用链表可以灵活地表示动态集合。链表有单链表和双链表及循环链表。书中着重介绍了双链表的概念及操作，双链表L的每一个元素是一个对象，每个对象包含一个关键字和两个指针：next和prev。链表的操作包... 阅读全文
posted @ 2014-11-03 22:47 Jessica程序猿 阅读(494) 评论(0) 推荐(0)
第十章 基本数据结构——栈和队列
摘要：摘要 本章介绍了几种基本的数据结构，包括栈、队列、链表以及有根树，讨论了使用指针的简单数据结构来表示动态集合。本章的内容对于学过数据结构的人来说，没有什么难处，简单的总结一下。1、栈和队列 栈和队列都是动态集合，元素的出入是规定好的。栈规定元素是先进后出（FILO），队列规定元素是先进先出（FI... 阅读全文
posted @ 2014-11-03 20:34 Jessica程序猿 阅读(325) 评论(0) 推荐(0)
第九章——中位数和顺序统计量
摘要：摘要： 本章所讨论的问题是在一个由n个不同数值构成的集合中选择第i个顺序统计量问题。主要讲的内容是如何在线性时间内O(n)时间内在集合S中选择第i小的元素，最基本的是选择集合的最大值和最小值。一般情况下选择的元素是随机的，最大值和最小值是特殊情况，书中重点介绍了如何采用分治算法来实现选择第i小的元... 阅读全文
posted @ 2014-11-03 16:26 Jessica程序猿 阅读(660) 评论(0) 推荐(0)
第八章 线性时间排序
摘要：摘要： 本章先回顾了前面介绍的合并排序、堆排序和快速排序的特点及运行运行时间。合并排序和堆排序在最坏情况下达到O(nlgn)，而快速排序最坏情况下达到O(n^2)，平均情况下达到O(nlgn)，因此合并排序和堆排序是渐进最优的。这些排序在执行过程中各元素的次序基于输入元素间的比较，称这种算法为比较... 阅读全文
posted @ 2014-11-03 13:27 Jessica程序猿 阅读(298) 评论(0) 推荐(0)
第七章——快速排序
摘要：快速排序对于n个数的输入数组来说，快速排序是一种最坏情况时间复杂度为O(n2)的排序算法，虽然最坏情况时间复杂度很差，但是快速排序通常是实际排序中最好的选择，因为它的平均性能非常好：它的期望时间复杂度是O(nlgn)，而且O(nlgn)中隐含的常数因子非常小。1、快速排序的描述 快速排序算法采用的... 阅读全文
posted @ 2014-11-03 11:05 Jessica程序猿 阅读(418) 评论(0) 推荐(0)
第六章——优先队列
摘要：1、概述 队列是一种满足先进先出（FIFO）的数据结构，数据从队列头部取出，新的数据从队列尾部插入，数据之间是平等的，不存在优先级的。这个就类似于普通老百姓到火车站排队买票，先来的先买票，每个人之间是平等的，不存在优先的权利，整个过程是固定不变的。而优先级队列可以理解为在队列的基础上给每个数据赋一... 阅读全文
posted @ 2014-11-02 20:59 Jessica程序猿 阅读(302) 评论(0) 推荐(0)
第六章——堆排序
摘要：一 堆　堆给人的感觉是一个二叉树，但是其本质是一种数组对象，因为对堆进行操作的时候将堆视为一颗完全二叉树，树种每个节点与数组中的存放该节点值的那个元素对应。所以堆又称为二叉堆，堆与完全二叉树的对应关系如下图所示：二叉堆可以分为两种形式：最大堆和最小堆。在这两种堆中，结点的值都要满足堆的性质。在最大堆... 阅读全文
posted @ 2014-11-02 20:40 Jessica程序猿 阅读(307) 评论(0) 推荐(0)
树、二叉树基础
摘要：刚看到堆排序，顺便记录一下关于树的一些基本概念：前言前面介绍的栈、队列都是线性结构(linear structure)。而树是非线性结构(non-linear structure)。因此，树中的元素之间一般不存在类似于线性结构的一对一的关系，更多地表现为多对多的关系。直观地看，它是数据元素(在树中称... 阅读全文
posted @ 2014-11-01 23:23 Jessica程序猿 阅读(1917) 评论(0) 推荐(0)
第四章 分治策略——最大子数组问题
摘要：最大子数组问题方法一：暴力求解方法我们可以很容易地设计出一个暴力方法来求解本问题：简单地尝试没对可能的子数组，共有O(n2)种#includeusing namespace std;#define INT_MIN 0x80000000int main(){ int arr[10]={9,8,-... 阅读全文
posted @ 2014-11-01 21:14 Jessica程序猿 阅读(519) 评论(0) 推荐(0)
递归算法详细分析
摘要：递归的总结：http://www.cnblogs.com/Bob-FD/archive/2013/04/10/3012568.html（其中包含一些递归的资料，有时间看看，递归实在是不好理解）C通过运行时堆栈支持递归函数的实现。递归函数就是直接或间接调用自身的函数。 许多教科书都把计算机阶乘和菲波那... 阅读全文
posted @ 2014-11-01 19:41 Jessica程序猿 阅读(857) 评论(0) 推荐(0)
第二章 算法基础
摘要：2.1 插入排序C++实现：#includeusing namespace std;void InsertSort(int arr[],int n){ int i,j,key; for(i=1;i=0&&keyusing namespace std;void Merge(int arr[... 阅读全文
posted @ 2014-11-01 11:25 Jessica程序猿 阅读(243) 评论(0) 推荐(0)