FWIW: I'm not the author of the content presented here (which is an outline from Edmond Lau's book). I've just copy-pasted it from somewhere over the Internet, but I cannot remember what exactly the original source is. I was also not able to find the author's name, so I cannot give him/her the proper credits.
| """ | |
| Question: | |
| Mary can perform the following minimal sequence of swap operations to | |
| successfully sort all 3 items by decreasing popularity rating: [3, 1, 2] → [3, 2, 1]. | |
| Solution: | |
| 1. The swap always compares the last element in the array with | |
| the least element in the remaining list e.g. | |
| in the case of [3, 1, 2, 4]...we compare 4 with the minimum value in [3,1,2] | |
| and swap the two if the minimum value is less |
| def splitInteger(num,parts): | |
| array = [] | |
| for i in range(parts): | |
| if i < num % parts: | |
| value = num // parts + 1 | |
| else: | |
| value = num // parts | |
| array.append(value) | |
| return sorted(array) |
| if a == b: | |
| return True | |
| if a is None or b is None: | |
| return False | |
| if a.val != b.val: | |
| return False | |
| return compare(a.left, b.left) and compare(a.right, b.right) |
