Posted on Tue, 21 Sep 2021 15:20:25 -0400 by madolia
Given an integer array A, you can jump A certain number of times from A starting index. In the process of your jump, the 1st, 3rd, 5th... Jumps are called odd jumps, while the 2nd, 4th, 6th... Jumps are called even jumps.
You can jump back from index i to index j (where i < j) as follows:
When performing odd jumps (e.g., 1st, ...
Posted on Sun, 19 Sep 2021 18:39:42 -0400 by 3rve
Notice: HUAWEI, Ali's latest autumn test written test questions, ideas and reference codes have been arranged well in WeChat official account, TechGuide, and the official account of the private letter is returned to HUAWEI or Ali to get the most real-time and detailed written test questions.
Track 1: optimal node (100%)
Title Descriptio ...
Posted on Tue, 14 Sep 2021 19:34:02 -0400 by gazalec
Give you a string s. please find two disjoint palindrome subsequences in s to maximize the product of their lengths. Two subsequences do not intersect if they do not have any characters with the same subscript in the original string.
Please return the maximum product of the length of two palindrome subsequences.
Subsequence refers to the resu ...
Posted on Sun, 12 Sep 2021 16:02:25 -0400 by nielskg
Problem solving ideas of dynamic planning: There are four steps: 1 create a new one-dimensional array or two-dimensional array, and determine the type of array according to the variables given in the question. 2 if it is a one-dimensional array, determine the value of the first element of the array. If it is a two-dimensional array, determine t ...
Posted on Tue, 07 Sep 2021 21:10:37 -0400 by herreram
Topic transmission: http://126.96.36.199/status.php?problem_id=&user_id=2021xiefuquan&cid=1013&language=-1&jresult=-1&csrf=0TJ798Za35gk5HIdMPl37YnoGUDub30n
expectactual Difference a10083-17b1001000c1001000d1001000e000f1001000g10067-33 (no spaces between sample numbers)h1000-100i000j10000the sum800400-400
a. Stone merging
Posted on Mon, 06 Sep 2021 19:17:48 -0400 by Guldstrand