complexity

Median of Two Sorted Arrays

The overall run time complexity should be O(log (m+n)).  
hcx2013·2015-05-17 21:00

Single Number II

Note:Your algorithm should have a linear runtime complexity. Could you implement it witho
·2015-05-16 22:00

Single Number I

Note:Your algorithm should have a linear runtime complexity. Could you implement it without usi
·2015-05-16 21:00

Median of Two Sorted Arrays

The overall run time complexity should be O(log (m+n)). 分析：题目要求
·2015-05-10 19:00

Time complexity of recursive fibonacci algorithm

Onethingyouneedtokeepinmindaboutfindingthetimecomplexityofarecursivefunctionisrecurrencerelation.BelowisaCfunctionforfindingthefibonaccisequence(sameasyours):intfib(intn) { if((n==1)||(n==2))return1
yuanhsh·2015-05-08 13:00

Count the number of occurrences in a sorted array

Expected time complexity is O(Logn) Examples: Input: arr[] = {1, 1, 2, 2, 2, 2, 3,}, x = 2
yuanhsh·2015-05-01 05:00

Count the number of occurrences in a sorted array

Expected time complexity is O(Logn) Examples: Input: arr[] = {1, 1, 2, 2, 2, 2, 3,}, x = 2
yuanhsh·2015-05-01 05:00

软件设计的复杂度

什么是软件设计的复杂度软件技术发展的使命之一就是控制复杂度(Complexity)。从高级语言的产生，到结构化编程，再到面向对象编程、组件化编程等等。
Horky·2015-04-30 00:32

软件设计的复杂度

什么是软件设计的复杂度软件技术发展的使命之一就是控制复杂度(Complexity)。从高级语言的产生，到结构化编程，再到面向对象编程、组件化编程等等。
HorkyChen·2015-04-30 00:00

Search in Rotated Sorted Array II

Would this affect the run-time complexity? How and why? Write a function to determine if a given ta
·2015-04-29 16:00

[LeetCode] Median of Two Sorted Arrays 两个有序数组的中位数

The overall run time complexity should be O(log (m+n)).
·2015-04-29 14:00

What is the computational complexity of an SVM?

http://www.quora.com/What-is-the-computational-complexity-of-an-SVMAlexandrePassos, aPhDstudentinmachinelearningin
杰·2015-04-20 21:00

leetcode 4 Median of Two Sorted Arrays

The overall run time complexity should be O(log (m+n)). 看到题目，首先想到的是 把2个数组合并成一个，然后在去中间位置的
vvaaiinn·2015-04-16 13:00

Factorial Trailing Zeroes

Note: Your solution should be in logarithmic time complexity.
·2015-04-10 18:00

[LeetCode] Search for a Range 搜索一个范围

Your algorithm's runtime complexity must be in the order of O(log n). If the target
·2015-04-09 13:00

代理模式Proxy

Encapsulate the complexity/overhead of the target in the wrapper //3. The cli
qryt520·2015-03-22 23:00

LeetCode 23 - Merge k Sorted Lists

Analyze and describe its complexity.
yuanhsh·2015-03-21 01:00

LeetCode 23 - Merge k Sorted Lists

Analyze and describe its complexity.
yuanhsh·2015-03-21 01:00

[LeetCode] Minimum Window Substring 最小窗口子串

string S and a string T, find the minimum window in S which will contain all the characters in T in complexity
·2015-03-16 07:00

Median of Two Sorted Arrays

The overall run time complexity should be O(log (m+n)). 思路简单，就是写起来比较麻烦。 几个注意点： 1，其中一个数组为空
·2015-03-14 21:00

Merge k Sorted Lists

Analyze and describe its complexity. 这题我写的太难看了，就直接看网上copy下来的吧，具体是哪里copy过来的我忘记了。几天的思想就是分治。
plan454·2015-03-12 19:00

[LeetCode] Search in Rotated Sorted Array II 在旋转有序数组中搜索之二

Would this affect the run-time complexity? How and why? Write a function to determine if a
·2015-03-10 13:00

LeetCode 76 - Minimum Window Substring

string S and a string T, find the minimum window in S which will contain all the characters in T in complexity
yuanhsh·2015-03-02 08:00

LeetCode 76 - Minimum Window Substring

string S and a string T, find the minimum window in S which will contain all the characters in T in complexity
yuanhsh·2015-03-02 08:00

LeetCode 148 - Sort List

Sort a linked list in O(n log n) time using constant space complexity.
yuanhsh·2015-02-25 02:00

Median of Two Sorted Arrays

The overall run time complexity should be O(log (m+n)). 看到这题，本来是想寻找每一部分的中间值进行分治想法来解决的。但是写了半
plan454·2015-02-10 23:00

[LeetCode] Longest Consecutive Sequence 求最长连续序列

Givenanunsortedarrayofintegers,findthelengthofthelongestconsecutiveelementssequence.YouralgorithmshouldruninO(n)complexity.Example
Grandyang·2015-02-06 01:00

[LeetCode] Single Number II 单独的数字之二

Note:Your algorithm should have a linear runtime complexity. Could you implement
·2015-01-31 13:00

poj1472--Instant Complexity(模拟)

 InstantComplexityTimeLimit:1000MS     MemoryLimit:10000KB     64bitIOFormat:%I64d&%I64uSubmit Status Appointdescription: SystemCrawler (2013-03-03)DescriptionAnalyzingtherun-timecomplexityofalgorithm
u013015642·2015-01-31 09:00

Complexity Behind Closure

这篇文章同时发布在github上这篇文章是我对ooc编译器里一个小bug调试时作的手记。虽然相信大多数人对编译器（并且是一门小众语言的编译器）并不感兴趣，但这篇文章可以给C用户们提供一些Object-orientedProgramming的想法，以及是对之前那篇泛型文章的最好的补充。我自己都没想到在翻译了那篇文章没多久，就亲身经历了这么一个“光滑平面”的问题。Introduction今天，我在oo
·2015-01-30 17:00

[LeetCode] Sort List 链表排序

  Sort a linked list in O(n log n) time using constant space complexity.
·2015-01-26 11:00

用Codility测试你的编码能力

Codility第一课：算法复杂度各种算法书的开篇大多是算法分析，而复杂度(complexity)又是最基本的分析指标。所以Codility的第一课也不例外，直入复杂度主题。
dc_726·2015-01-19 21:00

LeetCode - Search for a Range

Your algorithm's runtime complexity must be in the order of O(log n).
yuanhsh·2015-01-13 03:00

LeetCode - Search for a Range

Your algorithm's runtime complexity must be in the order of O(log n).
yuanhsh·2015-01-13 03:00

[LeetCode] Factorial Trailing Zeroes 求阶乘末尾零的个数

Note: Your solution should be in logarithmic time complexity.
·2015-01-12 21:00

LeetCode - Search in Rotated Sorted Array II

Would this affect the run-time complexity? How and why? Write a function to determine if a given
yuanhsh·2015-01-10 09:00

如何使用Swift 字典删除中的方法：removeAtIndex？

.     ///     /// Complexity: O(\ `count`\ ).   
萨斯辈的呼唤·2014-12-02 11:00

2014 Asia AnShan Regional Contest --- HDU 5078 Osu!

Time complexity: O(n)  
·2014-11-15 20:00

leetcode: Single Number II

Note:Your algorithm should have a linear runtime complexity. Could you implement it
frank-liu·2014-11-09 19:00

[leetcode] FindMinimuminRotatedSortedArray2

* * Would this affect the run-time complexity? How and why? * Supp
zhang_xzhi_xjtu·2014-10-22 00:00

[LeetCode] Find Minimum in Rotated Sorted Array II 寻找旋转有序数组的最小值之二

Would this affect the run-time complexity? How and why? Suppose a sorted array is
·2014-10-21 15:00

数论 - 简单数位推理 --- NYIST 514

Time complexity：O(n) n为数字的位数   Source
·2014-10-13 17:00

【LeetCode】Single Number

有三种解法，1、计数排序+一次遍历： time-complexity:O(n),space-complexity:O(max_int);2、哈希表： time-complexity:O(n),space-complexity
闵启阳·2014-10-10 17:00

字符串 - 近似回文词 --- csu 1328

Time complexity：O(n*m)   Source code： &
·2014-10-03 18:00

Single Number II

Note: Your algorithm should have a linear runtime complexity. Could you implement it without using
淡淡的一抹·2014-09-27 10:00

UVA586 - Instant Complexity(递归加模拟)

UVA586-InstantComplexity(递归加模拟)题目链接题目大意：给你一段代码，要求你算复杂度。OP代表操作，Loop代表循环，end结束。解题思路：递归去模拟。具体看代码。代码:#include #include constintN=15; chars1[N],s2[N]; typedeflonglongll; llnv[N]; voidsolve(ll*v){ while(
u012997373·2014-09-24 09:00

Single Number

Note: Your algorithm should have a linear runtime complexity. Could you implement it without using e
淡淡的一抹·2014-09-19 20:00

uva 586 - Instant Complexity(dfs)

题目链接：uva586-InstantComplexity题目大意：给出一段程序，求程序的执行语句的次数。解题思路：DFS，传入两个参数，一个n的指数，一个常数的系数。遇到LOOPn，就递归调用，并且n+1，遇到LOOPnum，就常数系数乘上num。输出要按照正常格式，首项不需要+号系数为1不需要输出系数为0整项不显示指数为1不显示次数为0时要输出0#include #include #inclu
u011328934·2014-08-24 00:00

代码圈复杂度（Cyclomatic Complexity，CC）和Oclint工具 介绍

什么是代码圈复杂度圈复杂度是一种度量程序复杂度的方法，由ThomasMcCabe于197６年定义，用来衡量一个模块判定结构的复杂程度，数量上表现为独立路径条数，即合理的预防错误所需测试的最少路径条数，圈复杂度大说明程序代码质量低且难于测试和维护，根据经验，高的圈复杂度和程序出错的可能性和有着很大关系。代码覆盖率和代码圈复杂度有什么关系呢，下面一个例子说明100%代码覆盖率的单元测试并不表示测试了代
ithiker·2014-08-11 10:59

代码圈复杂度（Cyclomatic Complexity，CC）和Oclint工具 介绍

什么是代码圈复杂度圈复杂度是一种度量程序复杂度的方法，由ThomasMcCabe于197６年定义，用来衡量一个模块判定结构的复杂程度，数量上表现为独立路径条数，即合理的预防错误所需测试的最少路径条数，圈复杂度大说明程序代码质量低且难于测试和维护，根据经验，高的圈复杂度和程序出错的可能性和有着很大关系。代码覆盖率和代码圈复杂度有什么关系呢，下面一个例子说明100%代码覆盖率的单元测试并不表示测试了代
gigglesun·2014-08-11 10:00
上一页 11 12 13 14 15 16 17 18 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他