链接: https://pan.baidu.com/s/1lgFuGKgI_nHBrwQ_fDjO8A
需要下载密码的私信我
跪谢大神!好人一生平安!bluewhale1991@hotmail.com
请加我微信stn57556
请加我微信stn57556
请加我微信stn57556联系。
我分享一下吧
感谢,我补充一个在职跳槽的,7/19的event
很简单的题目:
- lc 973
- lc 560
debug question.
补充一个校招的
- Given Speed X units/minute, calculate the maximum time taken to travel between any 2 stations. Stations is an array of x,y co-ordinates
[[x1,y1],[x2,y2],…], and distance is calculated using euclidean formula sqrt((y2-y1)^2 +(x2-x1)^2);
Return Time in minutes rounded to 6 decimal places
Ex:
Speed: 5
stations:[[0,0],[0,2],[2,0]]
Ans:Maximum distanc=[0,2] to [2,0] = sqrt(4+4);
Time = sqrt(8)/5 - Given a string find the minimum number of adjacent swaps to make it a palindrome. If not possible return -1;
Ex: “ntiin”
Swap t with i => nitin => ans = 1; - Ships are aligned in layers, with following conditions:
Each ship has value(v)
Each ship in a layer is followed by [v^2+1]%M ships,with values from 0 to ([v^2+1]%M)-1
The first ship has value v=2
M is constant given as argument
Find The Total number of ships %M in all layers
Ex:
L=1
M=4
Output:1 //One layer thus only 1 ship
感谢