Given a sorted array find all possible |ai - aj| where ai,aj belongs to Array A. Fin - JobHunting版 - 未名存档

本页内容为未名空间相应帖子的节选和存档，一周内的贴子最多显示50字，超过一周显示500字访问原贴

JobHunting版 - Given a sorted array find all possible |ai - aj| where ai,aj belongs to Array A. Fin

相关主题
● Google电话面试题目	● Extension problem of finding intersection of two sorted array
● 一个特别的inplace merge two sorted arrays	● 问一道老题
● 一个小公司面经	● 哪里有讲k-way merge的？
● 问个面试题	● 请教一下external sorting的问题
● anybody remember this question?? (about sorting)	● 刷题刷到没自信了
● [算法] unsorted array	● a[i] + b[j] = c[k] 的题有靠谱的答案不?
● find median for k sorted arrays	● 优步面试，哎。。。
● c/c++ qsort/sort 来 sort array of string	● [合集] google phone interview questions

相关话题的讨论汇总
话题: array话题: aj话题: ai话题: given话题: fin

进入JobHunting版参与讨论

1

(共1页)

s******d 发帖数: 61	1 复杂度怎么能控制到o(n)啊
I*******l 发帖数: 203	2 Are there any additional conditions? If no, then it seems you can not do this in o(n^2) time. This is because you can construct an array such that all the pairwise differences are distinct, so there are \theta(n^2) numbers to output. For example, 1,2,4,8,....

1

(共1页)

进入JobHunting版参与讨论

相关主题
● [合集] google phone interview questions	● anybody remember this question?? (about sorting)
● [合集] Google电话面试题目	● [算法] unsorted array
● 关于面试ABC	● find median for k sorted arrays
● CS intern面试经验	● c/c++ qsort/sort 来 sort array of string
● Google电话面试题目	● Extension problem of finding intersection of two sorted array
● 一个特别的inplace merge two sorted arrays	● 问一道老题
● 一个小公司面经	● 哪里有讲k-way merge的？
● 问个面试题	● 请教一下external sorting的问题

相关话题的讨论汇总
话题: array话题: aj话题: ai话题: given话题: fin

未名新帖统计// 7月16日

#	版面	帖数(主题数)
-	全站	4871 (796)
1	Military	3777 (569)
2	Stock	341 (51)
3	Joke	117 (17)
4	History	116 (3)
5	Automobile	100 (9)
6	USANews	55 (9)
7	Midlife	45 (1)
8	Headline	41 (41)
9	Dreamer	33 (13)
10	FleaMarket	32 (20)
11	Living	30 (7)

* 这里只显示发帖超过25的版面，努力灌水吧:-)