Given an unsorted array, find the maximum difference between the successive elements in its sorted form. Return 0 if the array contains less than 2 el Read More
Given an array of integers arr and an integer d. In one step you can jump from index i to index: i + x where: i + x < arr.length and 0 < x <= d.i - x Read More
Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. 来源:力扣(LeetCode)链接:https://leetcode Read More