mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 00:25:22 +08:00
规范格式
This commit is contained in:
@ -0,0 +1,25 @@
|
||||
package leetcode
|
||||
|
||||
import (
|
||||
"math"
|
||||
"sort"
|
||||
)
|
||||
|
||||
func minimumAbsDifference(arr []int) [][]int {
|
||||
minDiff, res := math.MaxInt32, [][]int{}
|
||||
sort.Ints(arr)
|
||||
for i := 1; i < len(arr); i++ {
|
||||
if arr[i]-arr[i-1] < minDiff {
|
||||
minDiff = arr[i] - arr[i-1]
|
||||
}
|
||||
if minDiff == 1 {
|
||||
break
|
||||
}
|
||||
}
|
||||
for i := 1; i < len(arr); i++ {
|
||||
if arr[i]-arr[i-1] == minDiff {
|
||||
res = append(res, []int{arr[i-1], arr[i]})
|
||||
}
|
||||
}
|
||||
return res
|
||||
}
|
@ -0,0 +1,52 @@
|
||||
package leetcode
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"testing"
|
||||
)
|
||||
|
||||
type question1200 struct {
|
||||
para1200
|
||||
ans1200
|
||||
}
|
||||
|
||||
// para 是参数
|
||||
// one 代表第一个参数
|
||||
type para1200 struct {
|
||||
arr []int
|
||||
}
|
||||
|
||||
// ans 是答案
|
||||
// one 代表第一个答案
|
||||
type ans1200 struct {
|
||||
one [][]int
|
||||
}
|
||||
|
||||
func Test_Problem1200(t *testing.T) {
|
||||
|
||||
qs := []question1200{
|
||||
|
||||
question1200{
|
||||
para1200{[]int{4, 2, 1, 3}},
|
||||
ans1200{[][]int{[]int{1, 2}, []int{2, 3}, []int{3, 4}}},
|
||||
},
|
||||
|
||||
question1200{
|
||||
para1200{[]int{1, 3, 6, 10, 15}},
|
||||
ans1200{[][]int{[]int{1, 3}}},
|
||||
},
|
||||
|
||||
question1200{
|
||||
para1200{[]int{3, 8, -10, 23, 19, -4, -14, 27}},
|
||||
ans1200{[][]int{[]int{-14, -10}, []int{19, 23}, []int{23, 27}}},
|
||||
},
|
||||
}
|
||||
|
||||
fmt.Printf("------------------------Leetcode Problem 1200------------------------\n")
|
||||
|
||||
for _, q := range qs {
|
||||
_, p := q.ans1200, q.para1200
|
||||
fmt.Printf("【input】:%v 【output】:%v\n", p, minimumAbsDifference(p.arr))
|
||||
}
|
||||
fmt.Printf("\n\n\n")
|
||||
}
|
44
leetcode/1200.Minimum-Absolute-Difference/README.md
Executable file
44
leetcode/1200.Minimum-Absolute-Difference/README.md
Executable file
@ -0,0 +1,44 @@
|
||||
# [1200. Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/)
|
||||
|
||||
|
||||
## 题目:
|
||||
|
||||
Given an array of **distinct** integers `arr`, find all pairs of elements with the minimum absolute difference of any two elements.
|
||||
|
||||
Return a list of pairs in ascending order(with respect to pairs), each pair `[a, b]` follows
|
||||
|
||||
- `a, b` are from `arr`
|
||||
- `a < b`
|
||||
- `b - a` equals to the minimum absolute difference of any two elements in `arr`
|
||||
|
||||
**Example 1:**
|
||||
|
||||
Input: arr = [4,2,1,3]
|
||||
Output: [[1,2],[2,3],[3,4]]
|
||||
Explanation: The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.
|
||||
|
||||
**Example 2:**
|
||||
|
||||
Input: arr = [1,3,6,10,15]
|
||||
Output: [[1,3]]
|
||||
|
||||
**Example 3:**
|
||||
|
||||
Input: arr = [3,8,-10,23,19,-4,-14,27]
|
||||
Output: [[-14,-10],[19,23],[23,27]]
|
||||
|
||||
**Constraints:**
|
||||
|
||||
- `2 <= arr.length <= 10^5`
|
||||
- `-10^6 <= arr[i] <= 10^6`
|
||||
|
||||
|
||||
## 题目大意
|
||||
|
||||
给出一个数组,要求找出所有满足条件的数值对 [a,b]:`a<b` 并且 `b-a` 的差值是数组中所有两个元素差值的最小值。
|
||||
|
||||
## 解题思路
|
||||
|
||||
|
||||
- 给出一个数组,要求找出所有满足条件的数值对 [a,b]:`a<b` 并且 `b-a` 的差值是数组中所有两个元素差值的最小值。
|
||||
- 简单题,按照题意先排序,然后依次求出两个相邻元素的差值,求出最小的差值。最后遍历一遍数组,把所有等于最小差值的数值对都输出。
|
Reference in New Issue
Block a user