complexity

[LeetCode] Find Minimum in Rotated Sorted Array II

Would this affect the run-time complexity? How and why? Suppose a sorted array is
·2015-10-30 14:28

[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-10-30 14:19

[Leetcode] Median of Two Sorted Arrays

The overall run time complexity should be O(log (m+n)). 好难啊，总是会有各种边界问题。想法如下： 最后从medianof t
·2015-10-30 14:18

[LeetCode 题解]: Merge k Sorted Lists

Analyze and describe its complexity. 题意：对k个有序的链表进行归并排序。并分析其复杂度。
·2015-10-30 14:07

阅读作业2--韦昀

Accidents of Software Engineering 　　本文是比喻性质的，软件工程比作狼人，在不经意间可能变成可怕的怪物，而银弹则是在传说中是对付狼人的唯一有效的武器，但是软件开发由于自身存在Complexity
·2015-10-30 14:40

[LeetCode] Sort List 排序 sort

Sort a linked list in O(n log n) time using constant space complexity.
·2015-10-30 14:40

Careercup - Microsoft面试题 - 5173689888800768

2014-05-11 05:21 题目链接 原题： Complexity of a function: int func_fibonacci ( int n) { if (n &
·2015-10-30 13:13

Careercup - Microsoft面试题 - 5673934611546112

2014-05-10 23:26 题目链接 原题： what is the best,worst and average case complexity for fibonacci no.s .
·2015-10-30 13:11

LeetCode - Merge k Sorted Lists

Analyze and describe its complexity. Solution: 　　You must've done the job of merging tw
·2015-10-30 13:53

LeetCode - Median of Two Sorted Arrays

The overall run time complexity should be O(lo
·2015-10-30 13:49

【LeetCode 34】Search for a Range

Your algorithm's runtime complexity must be in the order of O(log n).
·2015-10-30 13:43

【leetcode刷题笔记】Single Number II

Note:Your algorithm should have a linear runtime complexity. Could you implement it witho
·2015-10-30 13:13

Virtualization Basics

Virtualization Basics Virtualization is not a new concept, but its complexity has been growing, and
·2015-10-30 12:36

视觉繁美：信息可视化方法与案例解析

《视觉繁美：信息可视化方法与案例解析》 基本信息 原书名：Visual Complexity: Mapping Patterns of Information 作者： (美)Manuel Lima
·2015-10-30 11:43

Merge k Sorted Lists leetcode java

Analyze and describe its complexity.
·2015-10-30 10:09

C# Closures Explained

Unfortunately with a lot of this power also comes increased complexity. Programmers usually ex
·2015-10-29 08:59

Managing password security and resources

Password aging and expiration Password history Password complexity verification Account locking
·2015-10-28 09:08

关于算法空间复杂度的问题

关于空间复杂度的介绍(摘自百度) 空间复杂度(Space Complexity)是对一个算法在运行过程中临时占用存储空间大小的量度，记做S(n)=O(f(n))。
·2015-10-28 09:11

[LeetCode] Single Number 单独的数字

Note:Your algorithm should have a linear runtime complexity. Could you implement it wit
·2015-10-28 08:06

zz如何精简用户界面

英文原文： Minimizing Complexity In User Interfaces 　　简洁、易用、友好、直观。这些词语经常被提及，但在执行过程中经常被遗忘。
·2015-10-28 08:27

搜索 --- 数独求解 POJ 2676 Sudoku

16ms水过 Time complexity: O(n)
·2015-10-28 08:30

快速幂 --- CSU 1556: Jerry's trouble

Time complexity: O(n)   Source code:&n
·2015-10-28 08:28

Water --- CSU 1550: Simple String

Time complexity: O(n)   Source code:  &n
·2015-10-28 08:27

电子书下载：The Rails 3 Way, 2nd Edition

  Book DescriptionRuby on Rails strips complexity from the development process, enabling professional
·2015-10-28 08:36

Research of Terrain Visualization with huge textures

There is a bottleneck between the complexity of the scene and the capability of current syst
·2015-10-27 16:02

Algorithm backup ---- Selection sort(选择排序算法)

It has O(n2) complexity, making it inefficient on large lists, and generally performs worse than the
·2015-10-27 16:07

Algorithm backup ---- Find the kth largest number(寻找第K大数)

to find the k-th largest number from an ayyay based on the theory of quick sort with an algorithmic complexity
·2015-10-27 16:06

[算法][LeetCode]Single Number——异或运算的巧妙运用

Note:Your algorithm should have a linear runtime complexity. Could you implement it witho
·2015-10-27 15:57

软件复杂度概述

为此,成立于1976的McCabe&Associates公司开发出了McCabe Cyclomatic Complexity Metric（圈复杂度）技术对软件进行结构测试。
·2015-10-27 15:35

【leetcode】Factorial Trailing Zeroes（easy）

Note: Your solution should be in logarithmic time complexity.   思路：编程之美里有，就是找因子5的个数。
·2015-10-27 15:01

【leetcode】Search for a Range（middle）

Your algorithm's runtime complexity must be in the order of O(log n).
·2015-10-27 15:53

【leetcode】Search in Rotated Sorted Array II（middle）☆

Would this affect the run-time complexity? How and why? Write a function to determine if a given ta
·2015-10-27 15:53

【leetcode】Minimum Window Substring (hard) ★

string S and a string T, find the minimum window in S which will contain all the characters in T in complexity
·2015-10-27 15:48

【leetcode】Sort List (middle)

Sort a linked list in O(n log n) time using constant space complexity.
·2015-10-27 15:43

【leetcode】Single Number II （medium） ★ 自己没做出来....

Note:Your algorithm should have a linear runtime complexity. Could you implement it witho
·2015-10-27 15:27

【leetcode】Single Number (Medium) ☆

Note:Your algorithm should have a linear runtime complexity. Could you implement it withou
·2015-10-27 15:26

[LeetCode] Merge k Sorted Lists

Analyze and describe its complexity. Soluton: /** * Definition for singly-linked list.
·2015-10-27 15:02

[LeetCode] Single Number II

Note:Your algorithm should have a linear runtime complexity. Could you implement it witho
·2015-10-27 15:51

POJ-1472 Instant Complexity 模拟

相当于表达式计算一般，用递归进行处理，将BEGIN视作是一个LOOP，每次进入LOOP则进行多条语句处理，知道遇到END位置，结束这个LOOP。 代码如下： #include <iostream> #include <cstdlib> #include <cstdio> #include <cstring> #include <a
·2015-10-27 14:23

LeetCode - Factorial Trailing Zeroes

Note: Your solution should be in logarithmic time complexity. Solution: 　　
·2015-10-27 14:11

Evolution（矩阵快速幂）zoj2853

Memory Limit: 32768 KB   Description Evolution is a long, long process with extreme complexity
·2015-10-27 14:03

每日英语：When Simplicity Is The Solution

At the beginning of 'Walden,' Henry David Thoreau makes a concise case against the complexity of modern
·2015-10-27 14:36

Leetcode: Search for a Range

Your algorithm's runtime complexity must be in the order of O(log n). If the target is
·2015-10-27 14:11

Leetcode:Single Number

Note: Your algorithm should have a linear runtime complexity. Could you implement it
·2015-10-27 14:20

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-10-27 14:35

How to implement *All-Digital* analog-to-digital converters in FPGAs and ASICs

  When we engineers look at the complexity of system design these days, we are challenged with
·2015-10-27 13:16

算法：Rate of Growth

Rate of growth describes how an algorithm’s complexity changes as the input size grows.
·2015-10-27 13:21

DDD：Strategic Domain Driven Design with Context Mapping

approaches to object oriented modeling tend not to scale well when the applications grow in size and complexity
·2015-10-27 13:10

LeetCode:Median of Two Sorted Arrays

The overall run time complexity should be O(log (m+n)). 求两个有序数组的中位数，如果总元素个数是偶数，中位数是中间
·2015-10-27 11:34

领域驱动设计基本理论知识总结(zhuan)

2004年Eric Evans 发表Domain-Driven Design –Tackling Complexity in the Heart of Software （领域驱动设计），简称Evans
·2015-10-27 11:17
上一页 9 10 11 12 13 14 15 16 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他