Problem I
You are given a string s consisting only of digits '0',"1', ..'g'.Inone move, you can select any two adjacent characters of s and swap them.You are allowed to make any number of moves .
Write a function to determine whether s can be made a palindrome
Examples
Example 1
Input: s = "0011"
Output: True
Explanation:“0011"=> "0101" =>"1001"
Example 2
Input: s ="360630"
Output: True
Explanation:“360630" => “306630" => "036630
Problem II
Again, you are given a string s consisting only of digits'0',"1', .,g'. But this time there's no swapping allowed.Instead, in one step, you can change any character of s toany other character .
Let k be a positive integer. Write a function to determinewhether s can be made a palindrome after performing atmost k steps.
接受预约中，包AC
我们可以在线协助您通过任何的OA，不管是开摄像头还是任何作弊检测方案我们都能够绕过
Accepting bookings, ensure AC.
We can assist you online with any online assessment, and we can bypass any cheating detection mechanisms, including those that require the use of a camera
contact me to slove OA （Paid ）
