码迷,mamicode.com
首页 >  
搜索关键字:assume    ( 1858个结果
leetcode_num169_Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ? n/2 ? times. You may assume that the array is non-empty and the majority element ...
分类:其他好文   时间:2015-03-09 22:34:31    阅读次数:198
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. #include #include #include using namespace std; stru...
分类:其他好文   时间:2015-03-09 14:29:02    阅读次数:146
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.   #include #include #include #include using namespace ...
分类:其他好文   时间:2015-03-09 10:57:56    阅读次数:102
Merge Sorted Array
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 tha...
分类:其他好文   时间:2015-03-08 21:28:44    阅读次数:122
LeetCode-Find Minimum in Rotated Sorted Array(找出反转数组中的最小值)
题1: 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 exi...
分类:编程语言   时间:2015-03-07 14:16:09    阅读次数:150
LeetCode Search Insert Position
1.题目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 order.You may assume no duplicates in the array....
分类:其他好文   时间:2015-03-06 17:11:55    阅读次数:109
1052. Linked List Sorting
A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. Now give...
分类:其他好文   时间:2015-03-06 15:58:03    阅读次数:163
[LeetCode] 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...
分类:其他好文   时间:2015-03-06 11:15:36    阅读次数:112
3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact...
分类:其他好文   时间:2015-03-04 17:08:53    阅读次数:138
ZOJ 2853 Evolution 【简单矩阵快速幂】
这道题目第二次看的时候才彻底理解了是什么意思把题目转化为数学模型分析后就是 有一个初始序列, 有一个进化率矩阵求的是初始序列 与进化率矩阵进行 m 次运算后, 初始序列最后一位的答案那么显然,可以对进化率矩阵进行快速幂计算ExampleLet's assume thatP(0, 1)=P(1, 2)...
分类:其他好文   时间:2015-03-04 12:34:42    阅读次数:150
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!