leetcode刷题笔记(Golang)--164. Maximum Gap

最新推荐文章于 2024-03-21 22:32:49 发布

圆滚滚coder

最新推荐文章于 2024-03-21 22:32:49 发布

阅读量157

点赞数

分类专栏： leetcode刷题笔记(Golang) 文章标签：算法 leetcode golang

本文链接：https://blog.csdn.net/weixin_44555304/article/details/104447816

版权

164. Maximum Gap
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 elements.

Example 1:

Input: [3,6,9,1]
Output: 3
Explanation: The sorted form of the array is [1,3,6,9], either
(3,6) or (6,9) has the maximum difference 3.
Example 2:

Input: [10]
Output: 0
Explanation: The array contains less than 2 elements, therefore return 0.
Note:

You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range.
Try to solve it in linear time/space.

func maximumGap(nums []int) int {
   
	if len(nums) < 2 {
   
		return 0
	}
	lg := len(nums)
	minSlice :=

关注