g*******u
发帖数: 332 | 1 Denote a car 和 trade in a car 都有什么不同？ |
|
f**d
发帖数: 768 | 2 这是一本计算神经科学的优秀著作，全文拷贝这里（图和公式缺），有兴趣的同学可以
阅读
如需要，我可以分享PDF文件（－－仅供个人学习，无商业用途）
From Computer to Brain
William W. Lytton
From Computer to Brain
Foundations of Computational Neuroscience
Springer
William W. Lytton, M.D.
Associate Professor, State University of New York, Downstato, Brooklyn, NY
Visiting Associate Professor, University of Wisconsin, Madison
Visiting Associate Professor, Polytechnic University, Brooklyn, NY
Staff Neurologist., Kings County Hospital, Brooklyn, NY
In From Computer to Brain: ... 阅读全帖 |
|
g****g
发帖数: 1828 | 3 In probability theory, the normal (or Gaussian) distribution, is a
continuous probability distribution that is often used as a first
approximation to describe real-valued random variables that tend to cluster
around a single mean value. The graph of the associated probability density
function is “bell”-shaped, and is known as the Gaussian function or bell
curve:[nb 1]
f(x) = \tfrac{1}{\sqrt{2\pi\sigma^2}}\; e^{ -\frac{(x-\mu)^2}{2\sigma^2}
},
where parameter μ is the mean (location of the pe... 阅读全帖 |
|
D**o
发帖数: 2653 | 4 注意作者 \author{YHBKJ}
Atiyah-Bott Localization 1
2012-09-05 09:24:19
\documentclass[a4paper,12pt]{article}
\usepackage{amsfonts}
\usepackage{amsmath,amsthm,amssymb}
\usepackage{CJK,graphicx}
\usepackage{amscd}
\usepackage{amssymb}
\newtheorem{theorem}{Theorem}[section]
\newtheorem{corollary}{Corollary}[section]
\newtheorem{definition}{Definition}[section]
\newtheorem{lemma}{Lemma}[section]
\begin{document}
\title{\textbf{\Huge{Atiyah-Bott Localization 1}}}\author{YHBKJ}\date{}\
maketitle
\begin{ab... 阅读全帖 |
|
b**********5
发帖数: 7881 | 5 在说说最后一道题吧
给一个dictionary， 里面a list of words， 比如 “abcd“， ”abe", "bbc", "
bdcea"
从这个dictionary里， 给一个random word
怎么random么？
从这个字典里， 你可以看到：
第一个letter， 是“a”， 有多少probability， 是“b“， 有多少probability
then if u pick "a", "b" follow "a" with certain probabilty. if u pick "b",
"b" follow "b" with certain probability...
所以implement getRandomWord时， 先generate a random number between 0 and 1，
然后看第一个letter，“a“ 为first letter的probability是30%， 如果generate
为 0-0.3的时候， 就pick ”a”。 如果“b”的probability为60%， 那么generate
为0.3... 阅读全帖 |
|
j****m
发帖数: 8 | 6 看到有人指出在icmlc 2011会议中同一个作者发表论文达10多篇。本文深知做学术
的不易，觉得在短时间内能在同一个会议上发表10多篇论文，不是造假抄袭，就是粗制
滥造。于是随便找了一篇搜索了一下。发现不如所料，亩产万斤果然是有问题的。
请相关专业人员鉴定是否属于抄袭，以及是否还有其他未发现之处。
抄袭文（以下简称USOM文）
Le Li, Xiaohang Zhang, Zhiwen yu, Zijian Feng, Ruiping Wei, USOM: Mining
and Visualizing Uncertain Data Based on Self-Organizing Maps, Proceedings
of the 2011 International Conference on machine Learning and Cybernetics,
804-809
作者单位：
School of Computer Science and Engineering, South China University of
Technology, Guangzhou, China
... 阅读全帖 |
|
e****i
发帖数: 2152 | 7 【 以下文字转载自 Military 讨论区 】
发信人: erkuai (三天不上bbs,赶得上刘少奇), 信区: Military
标 题: On the Jews and Their Lies, 1543
发信站: BBS 未名空间站 (Wed Jan 12 23:21:23 2011, 美东)
by Martin Luther (1483-1546)
Translated by Martin H. Bertram
copyright © 1971 Fortress Press & Augsburg Fortress - On the Jews and
Their Lies is from Luther’s Works Volume 47. Augsburg Fortress is the
publishing ministry of the Evangelical Lutheran Church in America.
Funded through sales revenue, Augsburg Fortress is called to provide
produ... 阅读全帖 |
|
e****i
发帖数: 2152 | 8 by Martin Luther (1483-1546)
Translated by Martin H. Bertram
copyright © 1971 Fortress Press & Augsburg Fortress - On the Jews and
Their Lies is from Luther’s Works Volume 47. Augsburg Fortress is the
publishing ministry of the Evangelical Lutheran Church in America.
Funded through sales revenue, Augsburg Fortress is called to provide
products and services that communicate the Gospel, enhance faith, and
enrich the life of the Christian community from a Lutheran perspective.
Part I
I had mad... 阅读全帖 |
|
S*********g
发帖数: 24893 | 9 Sodomy
From Wikipedia, the free encyclopedia
Sodomy (/ˈsɒdəmi/) is any non-penile/vaginal copulation-like
act, such as oral or anal sex, or sex between a person and an animal.[1] The
word is derived from the story of Sodom and Gomorrah in chapters 18 and 19
of the Book of Genesis in the Bible.[1] So-called "sodomy laws" in many
countries criminalized not only these behaviors, but other disfavored sexual
activities as well, but in the Western world, many of these laws have been
ove... 阅读全帖 |
|
f****r
发帖数: 5118 | 10 懂信号处理的帮忙分析一下 Wow Signal，俺以前懂，现在虾米了
这个东西说不定正往地球飞过来呢
http://en.wikipedia.org/wiki/Wow!_signal
The Wow! signal was a strong narrowband radio signal detected by Dr. Jerry R
. Ehman on August 15, 1977, while working on a SETI project at The Big Ear
radio telescope of The Ohio State University.[1] The signal bore expected
hallmarks of potential non-terrestrial and non-solar system origin. It
lasted for the full 72 second duration that Big Ear observed it, but has
not been detected again. Much attenti... 阅读全帖 |
|
r******n
发帖数: 170 | 11 一直没弄请怎么解这题，正好从topcoder tutorial上看到有相关讲解：
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=
不过还是没太清楚，这个伪码里的J=1是怎么选出来的？是直接选结束时间最早的那个
事件吗？记得版上似乎有讨论过，不过没翻出来。哪位知道在哪里吗？
Let N denote the number of activities and
{I} the activity I ( 1 <= I <= N )
For each {I}, consider S[I] and F[I] its starting and finishing time
Sort the activities in the increasing order of their finishing time
- that is, for every I < J we must have F [I] <= F [J]
// A denotes the set of the activities that will be... 阅读全帖 |
|
z******w
发帖数: 36 | 12 a greedy approach with O(n) time complexity
1. get the first element of a, b and c. let's use x denotes the largest one,
y denotes medium one, z denotes the smallest one.
2. if the distance(x, y) > distance(y, z), move the y to the next number in
the array it belongs to, if distance(x,y) < distance(y,z), move z instead.
if distance(x,y) == distance(y,z) move y and z together to the next number.
3. update the x,y,z with the new value and repeat the procedure above. |
|
d****o
发帖数: 1055 | 13 好像这道题的思路是这样的。（不知道和你的方法是不是最后的结果一样。没有怎么看
懂你的方法为什么）
假设
A = {4, 10, 15, 20}
B = {1, 13, 29}
C = {5, 14, 28}
1. 初始化一个全局最小值minDistance=INT_MAX;当前距离curDistance=0;
2. get the first element of a, b and c. let's use x denotes the largest one,
y denotes medium one, z denotes the smallest one.(a=1,b=4,c=5)
3. 找到最小值a，最开始在B[0],那么我就一直把a往右移，直到a>b (13>4),假设移到
了B[i](这里i=1),计算 B[i]之前的一个数B[i-1](就是B[0])和最大值c的差,(c-B[0]=5
-1=4),这个差就是curDistance,如果curDistance小于minDistance,更新minDistance.
4. 更新a,b,c
5. 重复step 2,3,4，直到全部a... 阅读全帖 |
|
z******w
发帖数: 36 | 14 a greedy approach with O(n) time complexity
1. get the first element of a, b and c. let's use x denotes the largest one,
y denotes medium one, z denotes the smallest one.
2. if the distance(x, y) > distance(y, z), move the y to the next number in
the array it belongs to, if distance(x,y) < distance(y,z), move z instead.
if distance(x,y) == distance(y,z) move y and z together to the next number.
3. update the x,y,z with the new value and repeat the procedure above. |
|
d****o
发帖数: 1055 | 15 好像这道题的思路是这样的。（不知道和你的方法是不是最后的结果一样。没有怎么看
懂你的方法为什么）
假设
A = {4, 10, 15, 20}
B = {1, 13, 29}
C = {5, 14, 28}
1. 初始化一个全局最小值minDistance=INT_MAX;当前距离curDistance=0;
2. get the first element of a, b and c. let's use x denotes the largest one,
y denotes medium one, z denotes the smallest one.(a=1,b=4,c=5)
3. 找到最小值a，最开始在B[0],那么我就一直把a往右移，直到a>b (13>4),假设移到
了B[i](这里i=1),计算 B[i]之前的一个数B[i-1](就是B[0])和最大值c的差,(c-B[0]=5
-1=4),这个差就是curDistance,如果curDistance小于minDistance,更新minDistance.
4. 更新a,b,c
5. 重复step 2,3,4，直到全部a... 阅读全帖 |
|
p***0
发帖数: 233 | 16 Consider this problem in two parts
First part:what's the probability of forming 5 full boxes, 6 full boxes, etc
. Denote as p_1i, where i is [5,6,7,8,9] for each case.
Second part: for each case mentioned in the first part, what's the
probability of choosing the empty one. Denote as p_2i.
The second part is straightforward.
5 full boxes: 5/10
6 full boxes: 4/10
7 full boxes: 3/10
8 full boxes: 2/10
9 full boxes: 1/10
To solve the first part:
It's easy to find that the position of black balls don... 阅读全帖 |
|
l*****n
发帖数: 2446 | 17 Denotation and Connotation
• Denotation refers to the literal meaning of a word, the "
dictionary definition."¨ For example, if you look up the word snake in a
dictionary, you will discover that one of its denotative meanings is "any of
numerous scaly, legless, sometimes venomous reptiles¡Khaving a long,
tapering, cylindrical body and found in most tropical and temperate regions.
"
• Connotation, on the other hand, refers to the associations that
are connected to a certa |
|
R*******n
发帖数: 428 | 18 > 有意思。 单打这个52%比想象的大不少。
最有意思的是双打发球方居然有不利的时候。
与羽毛球有关的数学文章我还写过好几个。下面是另外一篇。比较
新旧记分制的长度问题。同上，这是数学家的游戏之作，对数学不
感兴趣的请跳过。主要结论：新记分制比老记分制节约1/3时间。
====================================================
Comparison of the new and old badminton scoring system
On May 6th, 2006, the International Badminton Association
has decided to officially change the scoring rule in
Badminton, so that the game time can be more controllable
(shorter).
For a quick reference, here's a short description of the two
systems.
Old ru... 阅读全帖 |
|
j********e
发帖数: 124 | 19 Let's see if this is a solution to the most general case:
i.e., in the n given line segaments, there are zero or some intersections
already.
Denotation: For a line segament ( (x1,0)(x2,1) ), we use to denote it.
Base observation: For two segaments and , assuem a1 < a2. They
intersect
if and only if b2
Now the data structure and algorithms:
Given n segaments ... , sort them according to ai
values.
Now, we use ... to denote the |
|
a*****e
发帖数: 1700 | 20
鼓掌！这结语讲的真心好。
楼主给出的 foldLeft 写法，和普通用循环的写法并无很大的分别，都是描述的计算
powerset 过程。而上述用 filterM 的写法，直接对应的是 powerset 的数学定义。
这两种表达方式的差别，正是 operational semantics 和 denotational semantics
的差别。通常，denotational 的抽象程度要高一些，但从另一个角度看，operational
可以更细致地区分语义上的差别。所以，取决于使用的上下文，并不能笼统地说一种
就一定好于另一种。
但是从语言设计的角度出发，即能够允许 operational 也能够允许 denotational 方
式定义函数或者描述事件的程序语言，要比只能允许其中一种方式的语言要更加
expressive。
的确，多数情况下我们并不关心 powerset 是如何实现的，有现成的库函数调用就好了
。但是不深入学习，就会错过一次锻炼抽象能力的机会。而正确恰当的抽象能力，才是
一个 architect 和一个 engineer 的真正区别。
After all, comp... 阅读全帖 |
|
j******i
发帖数: 6 | 21 To anybody who knows black-scholes model and stochastic differential
equation or anybody who knows control theory.
dS=αSdt+βSdB, S denote the price of a stock depends on t,S(t), α is the
drift or rate of return, β is the volatility, B is brownian motion.
How do I incorporate the control parameter γ , and a number “ L “defined
as dN/dS, where N denotes the amount of asset traded and S denote the asset
price so that dS=(αS+γ/L)dt+βSdB
defines a differential equation.
Thank you in advance |
|
j******i
发帖数: 6 | 22 To anybody who knows black-scholes model and stochastic differential
equation or anybody who knows control theory.
dS=αSdt+βSdB, S denote the price of a stock depends on t,S(t), α is the
drift or rate of return, β is the volatility, B is brownian motion.
How do I incorporate the control parameter γ , and a number “ L “defined
as dN/dS, where N denotes the amount of asset traded and S denote the asset
price so that dS=(αS+γ/L)dt+βSdB
defines a differential equation.
Thank you in advance |
|
j******i
发帖数: 6 | 23 To anybody who knows black-scholes model and stochastic differential
equation or anybody who knows control theory.
dS=αSdt+βSdB, S denote the price of a stock depends on S(t), α is the
drift or rate of return, β is the volatility, B is brownian motion.
How do I incorporate the control parameter γ , and a number “ L “defined
as dN/dS, where N denotes the amount of asset traded and S denote the asset
price so that dS=(αS+γ/L)dt+βSdB
defines a differential equation.
Thank you in advance |
|
j******i
发帖数: 6 | 24 To anybody who knows black-scholes model and stochastic differential
equation or anybody who knows control theory.
dS=αSdt+βSdB, S denote the price of a stock depends on t,S(t), α is the
drift or rate of return, β is the volatility, B is brownian motion.
How do I incorporate the control parameter γ , and a number “ L “defined
as dN/dS, where N denotes the amount of asset traded and S denote the asset
price so that dS=(αS+γ/L)dt+βSdB
defines a differential equation.
Thank you in advance |
|
w*******y
发帖数: 372 | 25 Why "最后加上三四五共同倍数"?
Your answer is correct. But I think the reasoning is more complicated, as
follows:
Let S3 denote the number of roses with weakness 3 ONLY; so as S4, S5;
Let S34 denote the number of roses with weakness 3&4 ONLY; so as S45, S35;
Let S345 denote the number of roses with weakness 3&4&5 ONLY.
Number of roses with weakness = S3 + S4 +S5 + S34 + S35 + S45 + S345
S345 = 360/(3*4*5)
S45 = 360/(4*5) - S345
...
S3 = 360/3 - S34 - S35 - S345
...
Putting them together, we have
360/3 + 360... 阅读全帖 |
|
j******i
发帖数: 6 | 26 To anybody who knows black-scholes model and stochastic differential
equation or anybody who knows control theory.
dS=αSdt+βSdB, S denote the price of a stock depends on t,S(t), α is the
drift or rate of return, β is the volatility, B is brownian motion.
How do I incorporate the control parameter γ , and a number “ L “defined
as dN/dS, where N denotes the amount of asset traded and S denote the asset
price so that dS=(αS+γ/L)dt+βSdB
defines a differential equation.
Thank you in advance |
|
l******i
发帖数: 1404 | 27 直接说说那个扩展吧：
让S_k=能够扔出k个不同值的次数，k<=n。题目要求E[S_k]。
任意给定N>=k，现在先考虑P(S_k=N)。
P(S_k=N)
=1*P(任意给定第N次结果的值，前面N-1次结果构成与第N次不同的k-1个值)
=(C_{n-1}^{k-1})*((k-1)^(N-1))/(n^(N-1))
=(C_{n-1}^{k-1})*(((k-1)/n)^{N-1});
现在求期望：
E[S_k]
=sum_{N=k}^{\infty}[N*P(S_k=N)]
=sum_{N=k}^{\infty}[N*(C_{n-1}^{k-1})*(((k-1)/n)^{N-1})]
=(C_{n-1}^{k-1})*sum_{N=k}^{\infty}[N*(((k-1)/n)^{N-1})]
=(C_{n-1}^{k-1})*P
这里P=sum_{N=k}^{\infty}[N*(((k-1)/n)^{N-1})];
那么((k-1)/n)*P = sum_{N=k}^{\infty}[N*(((k-1)/n)^N)], denoted by (1)
另一方面： P = s... 阅读全帖 |
|
c*x
发帖数: 555 | 28 An airline network is represented by a weighted digraph G=(V,E) in which
airports are denoted by vertices, flight legs are denoted by edges, and flight
time (or geological distance) is denoted by a weight. Suppose that the airline
company wants to establish k repair facilities at certain airports so that
every airport can receive repair service reasonably. The distance d(u,v) from
vertex u to vertex v is defined as the length of a shortest path from u to v
on G.
Input:
weighted digraph G=(V,E)
p |
|
o******6
发帖数: 538 | 29 ☆─────────────────────────────────────☆
jiangwei (johnny) 于 (Wed Feb 18 22:11:29 2009) 提到:
To anybody who knows black-scholes model and stochastic differential
equation or anybody who knows control theory.
dS=αSdt+βSdB, S denote the price of a stock depends on t,S(t), α is the
drift or rate of return, β is the volatility, B is brownian motion.
How do I incorporate the control parameter γ , and a number “ L “defined
as dN/dS, where N denotes the amount of asset traded and S denote the asset |
|
c**i
发帖数: 6973 | 30 Harpoon is A/R/UGM-84.
AGM stands for air-to-ground missile; RGM Radar Guided Missile; UGM
Underwater Guided Missile.
(1) Harpoon Block II; Backgrounder. Boeing, undated.
http://www.boeing.com/defense-space
/missiles/harpoon/docs/HarpoonBlockIIBackgrounder.pdf
Quote:
"Weight:
1,160 lb. Air configuration
1,459 lb. ASROC configuration
1,520 lb. TARTAR configuration
1,523 lb. Capsule/canister configuration
"Propulsion: Air-breathing turbojet engine (cruise), solid-propellant
booster
Note:
(a) RUR-5... 阅读全帖 |
|
I******a
发帖数: 3812 | 31 参见下面dictionary.com的解释，这个词其实跟汉语里的“夷”相对应。用这个词时间
长了自己都可能觉出来好像有什么地方有问题。我见过有些人根本就不说我是什么什么
-ese, 而是说我来自于哪个哪个国家，本能地抵触这个 -ese.
中国人其实应该把这个名称改掉，转叫 Chinon, Chinan 或者就叫 Chinaren 或者拼音
Zhongguoren。
-ese
a suffix forming adjectival derivatives of place names, especially countries
or cities; frequently used nominally to denote the inhabitants of the place
or their language: Faroese; Japanese; Vietnamese; Viennese .
By analogy with such language names, -ese occurs in coinages（造词）
denoting in a disparag... 阅读全帖 |
|
I******a
发帖数: 3812 | 32 http://gyral.blackshell.com/names.html
Visit the original once in a while. Apparently, it's chock full o' updates.
Slur Represents Reasons/Origins
51st Stater Canadians Self-explanatory.
Abba-Dabba Arabs Used in the movie "Betrayed" by rural American hate group.
Abo Australian Aboriginal Derogative shortened term for Aboriginal.
Adolf Germans Hitler, of course. Generally thought of the worst person ever.
Ahab Whites From Moby-Dick. Ahab hunted the white whale.
Ainu Japanese Aboriginal Originall... 阅读全帖 |
|
f********4
发帖数: 2883 | 33 美国印度裔向FCC投诉某电台种族歧视的律师信
2005年，美国印度人向FCC投诉Philadelphia radio station,说他们种族歧视，嘲弄印
度人。比起ABC来这实在算不了什么。
http://intellibriefs.blogspot.ca/2005/01/complaint-to-fcc-again
The following is a complaint filed today before the FCC by Attorney Rahul
Manchanda, of Manchanda Law Offices, P.C. in New York on the
"Indecent, Racist, and Profane Radio Transmissions from Philadelphia radio
station, WUSL-FM (Power 99), owned by Clear Channel Communications".
Attorney Manchanda has taken this action at no cost to the ... 阅读全帖 |
|
D*******o
发帖数: 3229 | 34 From wiki http://en.wikipedia.org/wiki/Slavs
The Slavic autonym *Slověninъ is usually considered a derivation from
slovo "word", originally denoting "people who speak (the same language)," i.
e. people who understand each other, in contrast to the Slavic word denoting
"foreign people" – němci, meaning "mumbling, murmuring people" (from
Slavic *němъ – "mumbling, mute").
发信人: P235 (老来多健忘 能饮一杯无), 信区: Military
标 题: Re: 为什么俄罗斯白妞嫁国男的几率远超美国白妞？
发信站: BBS 未名空间站 (Fri May 8 09:17:34 2015, 美东)
斯拉夫人有奴隶的意思... 阅读全帖 |
|
g******t
发帖数: 18158 | 35 Killed in action (KIA) is a casualty classification generally used by
militaries to describe the deaths of their own combatants at the hands of
hostile forces.[1] The United States Department of Defense, for example,
says that those declared KIA need not have fired their weapons but have been
killed due to hostile attack. KIAs do not come from incidents such as
accidental vehicle crashes and other "non-hostile" events or terrorism. KIA
can be applied both to front-line combat troops and to naval... 阅读全帖 |
|
G****e
发帖数: 11198 | 36 大选中哪些州华人可以起到关键少数的作用？
给几个数据，可以去思考一下，为什么华人可以起到关键少数的作用。是否真的起到这
个作用，要看我们怎么助选。就看这次大选华人踊跃支持Trump，捐款。除了几个龙虾
州，其他州有投票权的华人投给Trump具体会多出来多少呢？
这是一个值得我们研究的话题，要起到关键的少数，往往就是在平衡的天平上多加那么
一点点砝码，赢者通吃的electoral college制度下，少数的分量就不容忽视。
注意：我们华人人少，所以要避免微不足道，就得掌握这个砝码的作用。不能觉得我们
人少，不起作用。往往这些关键州的票数离得那么近，往哪个党派多倾斜点，这个州就
拿下了。
这是今后美国大选中，值得我们在意的地方。
https://en.wikipedia.org/wiki/United_States_presidential_election,_2016
Close races
Red denotes states (or congressional districts whose electoral votes are
awarded separately) won b... 阅读全帖 |
|
G***G
发帖数: 16778 | 37 denote the kid he had with ex-wife to be A
denote the kid he had with current wife to be B
if A is a girl and B is a boy, he would like A more.
if A and B are boys, he would like the one more who likes him more too.
if A and B are girls, he would like A more. |
|
d*******i
发帖数: 117 | 38 "
Suppose we are given a rooted tree T with n leaves and m non-leaf nodes.
Each leaf is colored with one of k < n given colors, so several leaves can
have the same color. We need to color each interior node of T with one of
the k given colors to maximize the number of edges whose (two) endpoints
are colored the same color.
We can solve this with a DP algorithm that runs in O(mk) time. Let V (v,
i) denote the optimal solution value when the problem is applied to the
subtree rooted at node v, and ... 阅读全帖 |
|
b*******y
发帖数: 232 | 39 是样题，然后还是45分钟倒计时的
可以用各种语言编写
感觉这种题目，用C或者java写是不是编程时间上比不过python？
单单看题目本身也很难啊，像是hannoi，但比它难多了，不知道有什么思路？
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs who have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move ... 阅读全帖 |
|
e***n
发帖数: 42 | 40 既然是样题，希望能公开讨论一下：这道题像careercup书上Hanoi Tower的一个变形：
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs which have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move consists of picking the topmost disc of any o... 阅读全帖 |
|
g*********8
发帖数: 64 | 41 第一题ihascode1337的确给出了两个数组不一样的长度的情况，如果一样的长度可以参
考Algorithm Design (by Kleinberg) Chapter 5 Exercise 1,其实也很简单，就是
binary search 的variant，但是这两道的题的coding都很tricky，要非常注意，主要
是递归函数调用的参数传入
他们的coding让我想起了由tree的in-order, pre-order， reconstruct the
binary tree的题，也是一样的tricky编程，也是递归函数调用的参数传递
另外amazon好像还有很好玩的新题：
1）Given a tree preorder sequence such as “NNNLLLL” where N denotes non-
leaf node and L denotes leaf node, with the constraint that no nodes has 1
child. Rebuild the binary tree
2） Given post order traver... 阅读全帖 |
|
g*********8
发帖数: 64 | 42 第一题ihascode1337的确给出了两个数组不一样的长度的情况，如果一样的长度可以参
考Algorithm Design (by Kleinberg) Chapter 5 Exercise 1,其实也很简单，就是
binary search 的variant，但是这两道的题的coding都很tricky，要非常注意，主要
是递归函数调用的参数传入
他们的coding让我想起了由tree的in-order, pre-order， reconstruct the
binary tree的题，也是一样的tricky编程，也是递归函数调用的参数传递
另外amazon好像还有很好玩的新题：
1）Given a tree preorder sequence such as “NNNLLLL” where N denotes non-
leaf node and L denotes leaf node, with the constraint that no nodes has 1
child. Rebuild the binary tree
2） Given post order traver... 阅读全帖 |
|
w****o
发帖数: 2260 | 43 我也自己写了一个。其实就是拿到一个值后，根据值得大小，判断应该把者个值放在哪
里，把真正的操作用代码给直接的描述出来。
具体用法：比如有个数组a[]，有4种颜色，数组大小为n,可以调用 DNF_K(a, 4, 0, n-
1)
// this is the code for k colors.
// the element values can be 0, 1, 2, ..., k-1
// partition[i] records the starting index for value i
// partition[0] does not matter, and should be always 0
// partition[k-1] denotes the lower index of unknown section
// h denotes the upper index of unknown section
// sections are :
// 0 1 2 3 ... unknown k-1
// complexity: O(n*k)
//
void DNF_K(in... 阅读全帖 |
|
o******3
发帖数: 91 | 44 决定把题目跟我写的很挫的代码贴上来，有需要的同学可以来看。。。
代码可以过sample test
但是目前还不能过所有的Test
题目：
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs which have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move consists of picking the topm... 阅读全帖 |
|
o******3
发帖数: 91 | 45 决定把题目跟我写的很挫的代码贴上来，有需要的同学可以来看。。。
代码可以过sample test
但是目前还不能过所有的Test
题目：
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs which have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move consists of picking the topm... 阅读全帖 |
|
s*****n
发帖数: 994 | 46 为啥dfs是最短solution？
题目在此
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs which have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move consists of picking the topmost disc of any one of the pegs and
placing it ... 阅读全帖 |
|
w**7
发帖数: 22 | 47 来自主题: JobHunting版 - 上一道小题 This question can be solved by (assume n has even digits for easy notation)
1. divide n in left and right, denoted as LR
2. n's closest palindrome has to be one of:
a. (L+1)(L+1), b. LL, c. (L-1)(L-1)
3. find the smallest of (a, b, c) that' greater than n, denoted as lr.
4. the rest are (l+1)(l+1), (l+2)(l+2),.... (l+m-1)(l+m-1).
when n has odd digits, the solution is the same. |
|
w**v
发帖数: 14 | 48 感想：
0。题不难，都做出并跑出了。
1。全是从印度本土来的老印，除了recruiter
2。有点不专业，最后的面试是通过skype／hangout进行。面试官造成其中两轮时间缩
短。
3。面试时间11:00-6:00之间，不为申请人着想
4。没有onsite，是省钱吗？但据说工资开得高
网上测试题忘了，但记得是challenge III，在hackerrank上。3小时，实际不用那么多。
电面
Given a list of pairs in form of (employee, manager), find out all reports
of any given employee and print them out.
Example:
(A,B)
(C,B)
(D,A)
(B,E)
Given B, you should print out
B
-A
--D
-C
正式面试coding三轮
Given a string and an expression, find out how many times the expression
appears in the string ... 阅读全帖 |
|
r*******g
发帖数: 1335 | 49 下面这道题看不明白题意，不知道那个+和=是什么鬼，隐约觉得需要dfs搜索什么匹配。
Given a string and an expression, find out how many times the expression
appears in the string as a sub sequence.
Example:
S=aaaacbbdcccc E=a+b+c- where + denoting the preceeding substring repeating
2 times while = denoting the preceeding substring repeating 4 times.
You should return 3 since it could be aa...bb.cccc or .aa..bb.cccc or ..aa.
bb.cccc
其余的题都很基本，看来烙印根本不想招人。 |
|
