数据砖OA

1.        Reverse digits in pairs输入一个integer，里面的digit两两reverse，如果长度为奇数则最后一位保持不变。第二位数保证不为0
比如：76859 - > 67589
2.        Palindrome cutting
You are given a string s, consider the following algorithm applied to this string:
1.        Take all the prefixes of the string, and choose the longest palindrome between them.
2.        If this chosen prefix contains at least 2 characters, cut this prefix from s and go back to the first step with the updated string. Otherwise, end the algorithm with the current string s as a result.
Your task is to implement the above algorithm and return its result when applied to string s.



3. figure under gravity
4. Min difference of arrays
题目见图片


有没有大佬知道第三题怎么做呀😢
以及求好心人加米谢

同求第三题