LeetCode刷题记204-Divide and Conquer(分治)
https://leetcode-cn.com/problems/beautiful-array/submissions/
class Solution {
public void swap(int[] a, int i, int j) {
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
public void bulid(int[] ans, int[] cur, int l, int r) {
原创
2021-03-22 16:07:09 ·
266 阅读 ·
0 评论