3423. Maximum Difference Between Adjacent Elements in a Circular Array ====================================================================== :题号: 3423 :题名: Maximum Difference Between Adjacent Elements in a Circular Array :类型: Algorithms(元数据占位) :难度: Easy :原题: `LeetCode 3423 `_ :数据源: LeetCode GraphQL :处理状态: 题目文件已建立;题目信息、题目重述与自建示例待下一轮补充。