avatar
父母探亲的保险问题# Reunion - 探亲与陪读
C*Y
1
Interview questions for front-end web developer.
1. Given a node of a non-binary tree, find all nodes on the same level. Choose any
language and data structure you prefer to implement this.
2. Given a node of a DOM tree, find all nodes on the same level. Use javascript and jquery library to implement this, write as less code as possible.
avatar
f*s
2
多谢!
avatar
z*4
3
父母过来探亲,想顺便检查一下身体,请问用什么保险比较好?
avatar
j*l
4
第一题的条件反射就是BFS?
avatar
w*e
5
是改错题吗?怎么读不懂?
如果问的是非诚勿扰的播出时间,去人家管网查。
avatar
w*y
6
来美国检查身体实在不是什么明智之举。。。。
在国内查好再过来吧。

【在 z******4 的大作中提到】
: 父母过来探亲,想顺便检查一下身体,请问用什么保险比较好?
avatar
r*o
7
what is DOM tree?

Choose any
javascript and jquery library to implement this, write as less code as
possible.

【在 C*Y 的大作中提到】
: Interview questions for front-end web developer.
: 1. Given a node of a non-binary tree, find all nodes on the same level. Choose any
: language and data structure you prefer to implement this.
: 2. Given a node of a DOM tree, find all nodes on the same level. Use javascript and jquery library to implement this, write as less code as possible.

avatar
s*t
8
1, bfs
2, $(node).siblings()

Choose any
javascript and jquery library to implement this, write as less code as
possible.

【在 C*Y 的大作中提到】
: Interview questions for front-end web developer.
: 1. Given a node of a non-binary tree, find all nodes on the same level. Choose any
: language and data structure you prefer to implement this.
: 2. Given a node of a DOM tree, find all nodes on the same level. Use javascript and jquery library to implement this, write as less code as possible.

avatar
C*Y
9

1. bfs for sure.
2. siblings() is not correct. Tested with the following code:








  • 1

  • 2

  • 3




【在 s*********t 的大作中提到】
: 1, bfs
: 2, $(node).siblings()
:
: Choose any
: javascript and jquery library to implement this, write as less code as
: possible.

avatar
s*t
10
ah
forgot you want same level
well, same method
first call $(node).parent() till reach document root, finding the depth
then, n = $(document)
repeat n = n.children() 'depth'times, n is the list of nodes at the same
level

);

【在 C*Y 的大作中提到】
:
: 1. bfs for sure.
: 2. siblings() is not correct. Tested with the following code:
:
:
:
:
:

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

#版面帖数(主题数)
-全站4871 (796)
1Military3777 (569)
2Stock341 (51)
3Joke117 (17)
4History116 (3)
5Automobile100 (9)
6USANews55 (9)
7Midlife45 (1)
8Headline41 (41)
9Dreamer33 (13)
10FleaMarket32 (20)
11Living30 (7)

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

历史上的今天

相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。