Java developer Opportunity not requiring work experience - 未名空间MITBBS历史存档

国际科技财经博客移民网络热点娱乐民生时事公众号

Redian新闻

>未名空间

>Programming - 葵花宝典

Java developer Opportunity not requiring work experience

Java developer Opportunity not requiring work experience# Programming - 葵花宝典

m*n2016-06-22 07:06

1 楼

http://www.uscis.gov/portal/site/uscis/menuitem.5af9bb95919f35e66f614176543f6d1a/?vgnextoid=138b6138f898d010VgnVCM10000048f3d6a1RCRD&vgnextchannel=e7d696cfcd6ff110VgnVCM1000004718190aRCRD
Fiscal Year 2010 H-1B Cap Count
As of December 15, 2009, approximately 64,200 H-1B cap-subject petitions had
been filed. USCIS has approved sufficient H-1B petitions for aliens with
advanced degrees to meet the exemption of 20,000 from the fiscal year 2010
cap. Any H-1B petitions filed on behalf of an alien wi

g*u2016-06-22 07:06

2 楼

Finance Company which is located in NYC area urgently needs 5 Java Developer
without requiring industry work experience, but if you have other computer
language work experience, that is plus. This is full time and permanent
position. You must hold the master degree of computer science, Computer
engineering,
Information system, Mathematics or other Science major (S.T.E.M). If you are
GC holder and US citizenship, that is plus. If you are interested in this
position and available now, you can send your resume in Word format to
[email protected]/* */

r*t2016-06-22 07:06

3 楼

在这个网页里：http://www.careercup.com/question?id=266699
He gave me an array of Integers, each integer allows me to make at max its
value jumps. If i am at zero, i'm stuck i cannot move forword. He asked me
to find the least selection to reach end of the array.
ex: 1 3 5 8 9 2 6 7 6 8 9
initially at one i have only make one jump to 3, from 3 i can jump either 1
step 0r 2 steps 0r 3 steps.
my solution is 1 to 3 to 8, 3 selection and i am done.
Device an algo for this
有一个答案用到动态规划：
It's a dynamic program

n*r2016-06-22 07:06

4 楼

没必要dp吧，greedy就可以
从最后一个node开始，往前过一遍array，找到离它最远且能cover到它的点
然后以这点开始，重复上述步骤，直到找到第一个点

1

【在 r********t 的大作中提到】

: 在这个网页里：http://www.careercup.com/question?id=266699
: He gave me an array of Integers, each integer allows me to make at max its
: value jumps. If i am at zero, i'm stuck i cannot move forword. He asked me
: to find the least selection to reach end of the array.
: ex: 1 3 5 8 9 2 6 7 6 8 9
: initially at one i have only make one jump to 3, from 3 i can jump either 1
: step 0r 2 steps 0r 3 steps.
: my solution is 1 to 3 to 8, 3 selection and i am done.
: Device an algo for this
: 有一个答案用到动态规划：