From 9671a5baaebe1b3bce04dba485d4e7435e1aed03 Mon Sep 17 00:00:00 2001
From: KKSU <15274802129@163.com>
Date: Wed, 13 Dec 2023 14:46:28 +0800
Subject: [PATCH] 微信小程序配置
---
src/main/java/cc/mrbird/febs/mall/service/impl/AgentServiceImpl.java | 37 +++++++++++++++++++++++++++++++++++++
1 files changed, 37 insertions(+), 0 deletions(-)
diff --git a/src/main/java/cc/mrbird/febs/mall/service/impl/AgentServiceImpl.java b/src/main/java/cc/mrbird/febs/mall/service/impl/AgentServiceImpl.java
index 11c321e..ed4153e 100644
--- a/src/main/java/cc/mrbird/febs/mall/service/impl/AgentServiceImpl.java
+++ b/src/main/java/cc/mrbird/febs/mall/service/impl/AgentServiceImpl.java
@@ -1041,4 +1041,41 @@
mallProductSellMapper.insert(mallProductSell);
}
+ public static List<Integer> findMissingNumbers(int[] nums) {
+ //定义一个标记数组，标记出现过的下表为true
+ boolean[] flag = new boolean[nums.length+1];
+ for(int temp:nums){
+ flag[temp] = true;
+ }
+ List<Integer> arr = new ArrayList<Integer>();
+ //以连续的i作为本应该的下标，查找之前的标记数组，没有被标记过的下标，就是消失的数字
+ for(int i = 1;i <= nums.length; i++){
+ if(!flag[i]){
+ arr.add(i);
+ }
+ }
+ return arr;
+ }
+
+ public static List<Integer> findDisappearedNumbers(int[] nums) {
+ Set<Integer> set = new HashSet<>(); // 利用Set对象元素不重复的特性
+ // 把nums里的每一个数字都添加至set中
+ for(int i = 0; i < nums.length; ++i) {
+ set.add(nums[i]);
+ }
+ List<Integer> list = new ArrayList<>();
+ // 把1~n的每一个数字都添加至set中，若添加成功则说明原数组不存在该数字，加入list即可
+ for(int i = 1; i <= nums.length; ++i) {
+ if(set.add(i)) {
+ list.add(i);
+ }
+ }
+ return list;
+ }
+ public static void main(String[] args) {
+ int[] nums = {1, 2, 2, 5, 2};
+ List<Integer> missingNumbers = findDisappearedNumbers(nums);
+ System.out.println("缺失的数字为：" + missingNumbers);
+ }
+
}
--
Gitblit v1.9.1