complexity

【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 ta
·2015-10-31 11:28

[LeetCode]Single Number

Note: Your algorithm should have a linear runtime complexity. Could you implement it without u
·2015-10-31 11:45

4.Median of Two Sorted Arrays(Array; Divide-and-Conquer)

The overall run time complexity should be O(log (m+n)).  
·2015-10-31 11:49

LeetCode137：Single Number II

Note: Your algorithm should have a linear runtime complexity. Could you implement it without u
·2015-10-31 11:10

LeetCode136：Single Number

Note: Your algorithm should have a linear runtime complexity. Could you implement it without using e
·2015-10-31 11:10

LeetCode148：Sort List

题目： Sort a linked list in O(n log n) time using constant space complexity.
·2015-10-31 11:09

Personal Reading Assignment 2 -读推荐文章有感以及项目开发目前总结

首先在“No Silver Bullet”一文中，我深刻体验到了： 非线性的complexity,项目单模块的复杂度以及整合之后出现的大量耦合问题； conformity的困难，一致性因为个人代码习惯和沟通的不充分导致软件的整合过
·2015-10-31 11:21

函数编程(FP)

Object-Oriented Programming，OOP）和元件（Components）的观念注入大多数的主流imperative编程语言（例如BASIC丶C丶 Pascal），采用这些技术可以降低软体开发的复杂度（Complexity
·2015-10-31 11:41

poj1472

Instant Complexity Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 
·2015-10-31 10:14

Python内置方法的时间复杂度

原文：http://www.orangecube.net/python-time-complexity 本文翻译自Python Wiki本文基于GPL v2协议，转载请保留此协议。
·2015-10-31 10:15

个人阅读作业2：关于项目经历的心得

然而，在软件工程中却不是如此，软件工程中有不可避免的诸多问题，主要由复杂性（complexity），软件整合（conformity），可变性
·2015-10-31 10:46

leetcode[137]Single Number II

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

leetcode[136]Single Number

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

leetcode[148]Sort List

Sort a linked list in O(n log n) time using constant space complexity. /** * Definition
·2015-10-31 10:59

leetcode[154]Find Minimum in Rotated Sorted Array II

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

leetcode[172]Factorial Trailing Zeroes

Note: Your solution should be in logarithmic time complexity. 给定一个整数n，返回n!（n的阶乘）数字中的后缀0的个数。
·2015-10-31 10:57

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-31 10:49

个人阅读作业2：结合《No Silver Bullet》谈谈我在软件开发过程的遇到的困难与体会

在《No Silver Bullet》中，作者描述了造成软件本质性困难（essence）的四个原因： 1、复杂性（complexity）： 　　首先我们来看一下作者对软件的定义，其大意是“软件的本质是对一连串相关的概念的构建
·2015-10-31 10:31

《No Silver Bullet: Essence and Accidents of Software Engineering》总结

      这篇文章首先是介绍了软件工程要面临的固有的不可避免的问题，主要是复杂性（complexity），软件整合（conformity），可变性（changeability
·2015-10-31 10:29

LeetCode - Sort List

Sort List 2014.1.14 23:17 Sort a linked list in O(n log n) time using constant space complexity
·2015-10-31 10:04

LeetCode - Single Number

Note:Your algorithm should have a linear runtime complexity. Co
·2015-10-31 10:03

《No Silver Bullet: Essence and Accidents of Software Engineering》总结

　　这篇文章首先是介绍了软件工程要面临的固有的不可避免的问题，主要是复杂性（complexity），软件整合（conformity），可变性（changeability）和不可见性（invisibility
·2015-10-31 10:17

阅读作业2--韦昀

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

【leetcode刷题笔记】Merge k Sorted Lists

Analyze and describe its complexity.   题解：最开始用了最naive的方法，每次在k个链表头中找出最小的元素，插入到新链表中。
·2015-10-31 10:42

【leetcode刷题笔记】Sort List

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

【leetcode刷题笔记】Single Number

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

领域驱动的模型概述

读Domain-Driven Design Tackling complexity in the heart of software DDD中对建模的基本要求如下，首先模型和实现是相互绑定的，在我们当前的项目中可能会体会到
·2015-10-31 10:46

LeetCode2：Median of Two Sorted Arrays

The overall run time complexity should be O(log (m+n)). 解题思路： 这道题，很容易想到的是先排序再直接定位中间那个
·2015-10-31 10:03

Pac-Man Is NP-Hard

— has used computational complexity theory to decide, once and
·2015-10-31 10:49

1063. Set Similarity (25)

contests/pat-a-practise/1063 At first, i decide use a for loop to get the intersection, which time complexity
·2015-10-31 10:23

Search for a Range [LeetCode]

Your algorithm's runtime complexity must be in the order of O(log n).
·2015-10-31 09:23

Merge k Sorted Lists [LeetCode]

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

Search in Rotated Sorted Array II [LeetCode]

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

Leetcode: Sort List

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

[Leetcode] Merge k Sorted Lists

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

[Leetcode] Sort List

Sort a linked list in O(n log n) time using constant space complexity. 归并排序！
·2015-10-31 09:10

【leetcode】Merge k Sorted Lists

Analyze and describe its complexity.   思路： 我自己的，每次找k个元素的最小的接在答案链表的后面。结果超时了。
·2015-10-31 09:24

【leetcode】Median of Two Sorted Arrays（hard）★！！

The overall run time complexity should be O(log (m+n)).   思路： 难，知道用分治算法，却不知道怎么用。只好看答
·2015-10-31 09:24

redis 控制调用频率

Time complexity: O(1) Increments the number stored at key by one.
·2015-10-31 09:00

.NET面试题，看看你的水平

3.什么叫圈复杂度（cyclomatic complexity）？为什么它很重要？
·2015-10-31 09:43

AAC规格分类和下载地址

14496-5_2001_Amd_6_Reference_Software/ MPEG AAC音频编码在不同的领域，分为九种规格：MPEG-2 AAC MainMPEG-2 AAC LC (Low Complexity
·2015-10-31 09:40

[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 ta
·2015-10-31 09:22

[LeetCode] Factorial Trailing Zeroes 阶乘末尾0

Note: Your solution should be in logarithmic time complexity.
·2015-10-31 09:21

Careercup - Facebook面试题 - 5179916190482432

Restrictions: 1. no use of division 2. complexity in O(n) 题目：给定一个整数数组，将个元
·2015-10-31 09:19

LeetCode - Search in Rotated Sorted Array II

Would this affect the run-time complexity? How
·2015-10-31 09:14

C# Iterations: IEnumerator, IEnumerable and Yield

The foreach statement hides the complexity of the enumerators, but you can directly manipulate IEnumerator
·2015-10-31 09:25

Leetcode:Median of Two Sorted Arrays 两有序数组的中位数

The overall run time complexity should be O(log (m+n)).   这题最初的想法就是 Merg
·2015-10-31 08:14

企业架构思考

在新西兰Teched2009的Session《ARC203 - Services and Complexity》分享了自己关于企业架构的独特观点，非常令人印象深刻，无疑可以给大家带来很多思考。
·2015-10-31 08:31

[LeetCode] Search for a Range

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

[LeetCode] Factorial Trailing Zeroes

Note: Your solution should be in logarithmic time complexity.
·2015-10-30 14:30
上一页 8 9 10 11 12 13 14 15 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他