Home > Back-end >  Help bosses an algorithm
Help bosses an algorithm

Time:05-07

As title, who know how to use Java to come?
1.


Given a includes an array of n integers nums and a target value target, find out the nums equal the sum of the number of target, and print out all the index, index can't repeat the same results,

For example: nums=,5,8,17,29,33,39,11,16 [1], target=33
Results 1:5, 2:3, 8,...



!!!!!!!!!! Use the title of test data, the output results behind the code!!!!!!!!!!





2. Given a set start and end time of the array, to find out in the array cross time and spare time

[2020-03-20, 2020-03-20],
[2020-05-20, 2020-05-20],
[2020-04-20, 2020-04-20],
[2020-08-20, 2020-08-20],
]
Spare time: 2020-03 ~ 23-2020-04-19, 2020-07-23 ~ 2020-07-23,...
Crossed period of time: 2020-05-20 ~ 2020-05-20,...


!!!!!!!!!! Use the title of test data, the output results behind the code!!!!!!!!!!



//code behind, after finish, click save button in the upper left corner, prompt "save success can
"//if you don't save that success, need to put the "name", behind the copy to # and refresh the page

//please make sure the correct code, cannot appear to run an error

CodePudding user response:

Do come??

CodePudding user response:

references a zhe. 1/f, 900 response:
done??

You also want to do this?
  • Related