修改命名

Author: RustLi

pom.xml

@@ -13,6 +13,7 @@
         <maven.compiler.target>8</maven.compiler.target>
         <project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
         <kotlin.version>1.9.23</kotlin.version>
+        <hutool.version>5.8.25</hutool.version>
     </properties>
 
     <dependencies>
@@ -53,6 +54,26 @@
             <version>1.18.32</version>
             <scope>provided</scope>
         </dependency>
+        <dependency>
+            <groupId>com.kuaike.common</groupId>
+            <artifactId>common-utils</artifactId>
+            <version>1.0.4-SNAPSHOT</version>
+        </dependency>
+        <dependency>
+            <groupId>cn.hutool</groupId>
+            <artifactId>hutool-core</artifactId>
+            <version>${hutool.version}</version>
+        </dependency>
+        <dependency>
+            <groupId>cn.hutool</groupId>
+            <artifactId>hutool-http</artifactId>
+            <version>${hutool.version}</version>
+        </dependency>
+        <dependency>
+            <groupId>cn.hutool</groupId>
+            <artifactId>hutool-cache</artifactId>
+            <version>${hutool.version}</version>
+        </dependency>
     </dependencies>
 
     <build>

src/main/java/org/lwl/algorithms/leetcode/code/dp/Fibonacci.java

@@ -1,4 +1,7 @@
-package algorithms.leetcode.code.dp;
+package org.lwl.algorithms.leetcode.code.dp;
+
+import java.util.HashMap;
+import java.util.Map;
 
 /**
  * @date: 2021/4/8
@@ -18,7 +21,10 @@ public class Fibonacci {
 
     public static void main(String[] args) {
         Fibonacci fibonacci = new Fibonacci();
-        System.out.println(fibonacci.fib(10));
+//        System.out.println(fibonacci.fib(10));
+//        System.out.println(fibonacci.numWays(10));
+        System.out.println(fibonacci.fib2(2));
+//        System.out.println(fibonacci.numWays1(2));
     }
 
 
@@ -29,29 +35,69 @@ public int fib(int n) {
 
     /**
      * des: 带备忘录，时间复杂度从o(2n次幂) 到 o(n)
-     * @param
      */
     public int fibWithMemo(int[] memo, int n){
-        if(n == 0 || n ==1 ) return n;
+        if(n == 0 || n ==1 ){
+            return 1;
+        }
         //增加一个备忘录，防止重复计算；时间复杂度o(n)；
-        if(memo[n] != 0) return memo[n] % 1000000007;
+        if(memo[n] != 0) {
+            return memo[n] % 1000000007;
+        }
         memo[n] = fibWithMemo(memo, n - 1) + fibWithMemo(memo, n - 2);
         return memo[n] % 1000000007;
     }
 
 
     /**
-     * des: 自底向上，递归反向
-     * @param
+     * des: 自底向上，递归反向  动态规划，时间复杂度o(1)
      */
     public int fib2(int n) {
         int a = 0, b = 1, sum;
-        for(int i = 0; i < n; i++){
+        for(int i = 0; i <= n; i++){
             sum = (a + b) % 1000000007;
             a = b;
             b = sum;
         }
         return a;
     }
 
+
+    public int numWays1(int n) {
+        if (n <= 1) {
+            return 1;
+        }
+        if (n == 2) {
+            return 2;
+        }
+        int a = 1;
+        int b = 2;
+        int temp = 0;
+        for (int i = 3; i <= n; i++) {
+            temp = (a + b)% 1000000007;
+            a = b;
+            b = temp;
+        }
+        return temp;
+    }
+
+
+    //使用哈希map，充当备忘录的作用
+    Map<Integer, Integer> tempMap = new HashMap();
+    public int numWays(int n) {
+        // n = 0 也算1种
+        if (n == 0 || n == 1) {
+            return 1;
+        }
+        //先判断有没计算过，即看看备忘录有没有
+        if (tempMap.containsKey(n)) {
+            //备忘录有，即计算过，直接返回
+            return tempMap.get(n);
+        } else {
+            int temp = (numWays(n - 1) + numWays(n - 2)) % 1000000007;
+            // 备忘录没有，即没有计算过，执行递归计算,并且把结果保存到备忘录map中，对1000000007取余（这个是leetcode题目规定的）
+            tempMap.put(n, temp);
+            return temp;
+        }
+    }
 }

src/main/java/org/lwl/algorithms/leetcode/code/dp/REDAME.md

@@ -1,4 +1,4 @@
-package design_patterns.chain_of_responsibility;
+package org.lwl.designpatterns.chainofresponsibility;
 
 import java.util.ArrayList;
 

src/main/java/org/lwl/data_structure/array/Array.java renamed to src/main/java/org/lwl/datastructure/array/Array.java

@@ -1,4 +1,4 @@
-package design_patterns.chain_of_responsibility;
+package org.lwl.designpatterns.chainofresponsibility;
 
 /*实例场景
 在公司内部员工请假一般情况是这样的：员工在OA系统中提交一封请假邮件，该邮件会自动转发到你的直接上级领导邮箱里，如果你的请假的情况特殊的话，

src/main/java/org/lwl/data_structure/array/DiffArr.java renamed to src/main/java/org/lwl/datastructure/array/DiffArr.java

@@ -1,4 +1,4 @@
-package design_patterns.chain_of_responsibility;
+package org.lwl.designpatterns.chainofresponsibility;
 
 /**
  * 类描述：自定义“责任人”

src/main/java/org/lwl/data_structure/array/DupArray.java renamed to src/main/java/org/lwl/datastructure/array/DupArray.java

@@ -1,4 +1,4 @@
-package design_patterns.chain_of_responsibility;
+package org.lwl.designpatterns.chainofresponsibility;
 
 
 /**

src/main/java/org/lwl/data_structure/array/PrefixArr.java renamed to src/main/java/org/lwl/datastructure/array/PrefixArr.java

@@ -1,4 +1,4 @@
-package design_patterns.chain_of_responsibility;
+package org.lwl.designpatterns.chainofresponsibility;
 
 /**
  * 组长

src/main/java/org/lwl/data_structure/listnode/BasicNode.java renamed to src/main/java/org/lwl/datastructure/listnode/BasicNode.java

@@ -1,4 +1,4 @@
-package design_patterns.chain_of_responsibility;
+package org.lwl.designpatterns.chainofresponsibility;
 
 
 

src/main/java/org/lwl/data_structure/listnode/CycleNode.java renamed to src/main/java/org/lwl/datastructure/listnode/CycleNode.java

@@ -1,4 +1,4 @@
-package design_patterns.chain_of_responsibility;
+package org.lwl.designpatterns.chainofresponsibility;
 
 
 public interface Ratify {

src/main/java/org/lwl/data_structure/listnode/IntersectionNode.java renamed to src/main/java/org/lwl/datastructure/listnode/IntersectionNode.java

@@ -1,4 +1,4 @@
-package design_patterns.chain_of_responsibility;
+package org.lwl.designpatterns.chainofresponsibility;
 
 import java.util.List;
 

src/main/java/org/lwl/data_structure/listnode/ListNode.java renamed to src/main/java/org/lwl/datastructure/listnode/ListNode.java

@@ -1,4 +1,4 @@
-package design_patterns.chain_of_responsibility;
+package org.lwl.designpatterns.chainofresponsibility;
 
 //建造者模式构建请假请求
 public class Request {

src/main/java/org/lwl/data_structure/listnode/MiddleNode.java renamed to src/main/java/org/lwl/datastructure/listnode/MiddleNode.java

@@ -1,4 +1,4 @@
-package design_patterns.chain_of_responsibility;
+package org.lwl.designpatterns.chainofresponsibility;
 
 /**
  * 类描述：结果对象

src/main/java/org/lwl/data_structure/listnode/ReverseKNode.java renamed to src/main/java/org/lwl/datastructure/listnode/ReverseKNode.java

@@ -1,4 +1,4 @@
-package design_patterns.observer;
+package org.lwl.designpatterns.observer;
 
 /**
  * @program: javaProjects
@@ -11,7 +11,7 @@ public class Client {
 
     public static void main(String[] args) {
         Subject concreteSubject = new ConcreteSubject();
-        Observer concreteObserver = new ConcreteObserver();
+        Observer concreteObserver = new org.lwl.designpatterns.observer.ConcreteObserver();
 
         concreteSubject.attach(concreteObserver);
         concreteSubject.notifyObservers("new message llll");

src/main/java/org/lwl/data_structure/listnode/ReverseNode.java renamed to src/main/java/org/lwl/datastructure/listnode/ReverseNode.java

@@ -1,4 +1,4 @@
-package design_patterns.observer;
+package org.lwl.designpatterns.observer;
 
 /**
  * @program: javaProjects

src/main/java/org/lwl/data_structure/listnode/SingleLinkedList.java renamed to src/main/java/org/lwl/datastructure/listnode/SingleLinkedList.java

@@ -1,4 +1,4 @@
-package design_patterns.observer;
+package org.lwl.designpatterns.observer;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/org/lwl/data_structure/string/Palindrome.java renamed to src/main/java/org/lwl/datastructure/string/Palindrome.java

@@ -1,5 +1,4 @@
-package design_patterns.observer;
-
+package org.lwl.designpatterns.observer;
 public interface Observer {
     void doThing(String message);
 }

src/main/java/org/lwl/data_structure/tree/BinTree.java renamed to src/main/java/org/lwl/datastructure/tree/BinTree.java

@@ -1,4 +1,4 @@
-package design_patterns.observer;
+package org.lwl.designpatterns.observer;
 
 /**
  * @program: javaProjects

src/main/java/org/lwl/design_patterns/adapter/class_dapter/Adapter.java renamed to src/main/java/org/lwl/designpatterns/adapter/class_dapter/Adapter.java

@@ -0,0 +1,53 @@
+package org.lwl.javacommon.collections;
+
+import com.google.common.collect.Sets;
+
+import java.util.HashSet;
+import java.util.Iterator;
+import java.util.Set;
+
+public class ConcurrentHashSet {
+
+    private Set<Long> manageBizIds = Sets.newHashSet(1L,2L,3L);
+    public static void main(String[] args) {
+        ConcurrentHashSet concurrentHashSet = new ConcurrentHashSet();
+
+        for (long j = 0; j < 10; j++) {
+            final long j1 = j;
+            new Thread(new Runnable() {
+                @Override
+                public void run() {
+                    try {
+                        Thread.sleep(500);
+                    } catch (InterruptedException e) {
+                        throw new RuntimeException(e);
+                    }
+                    System.out.println("线程:" + Thread.currentThread().getName() + ", j1 = " + j1);
+                    concurrentHashSet.test3(1L);
+                }
+            }).start();
+        }
+    }
+
+    private void test2(Long bizId){
+        manageBizIds.remove(bizId); // 在迭代之前先移除一个元素
+
+        Iterator<Long> iterator = manageBizIds.iterator();
+        while (iterator.hasNext()) {
+            Long manageBizId = iterator.next();
+            System.out.println("Processing: " + manageBizId);
+            iterator.remove(); // 使用 Iterator.remove() 安全地移除元素
+        }
+    }
+
+    private void test3(Long bizId) {
+        manageBizIds.remove(bizId); // 在迭代之前先移除一个元素
+
+        Set<Long> newManageBizIds = new HashSet<>(manageBizIds);
+        for (Long manageBizId : newManageBizIds) {
+            System.out.println("Processing: " + manageBizId);
+            manageBizIds.remove(manageBizId); // 在新集合上迭代，原集合上移除元素
+        }
+    }
+
+}

src/main/java/org/lwl/design_patterns/adapter/class_dapter/Client.java renamed to src/main/java/org/lwl/designpatterns/adapter/class_dapter/Client.java

@@ -1,4 +1,4 @@
-package java_common.threads;
+package org.lwl.javacommon.threads;
 
 import java.util.concurrent.Callable;
 import java.util.concurrent.FutureTask;

src/main/java/org/lwl/design_patterns/adapter/class_dapter/Ps.java renamed to src/main/java/org/lwl/designpatterns/adapter/class_dapter/Ps.java

@@ -1,4 +1,4 @@
-package java_common.threads;
+package org.lwl.javacommon.threads;
 
 import com.google.common.collect.Lists;
 
@@ -31,7 +31,9 @@ public static void main(String[] args) throws Exception {
 //        test1(false);
 //        test2();
 
-        test222();
+//        test222();
+//        test3();
+        test4();
     }
 
     private static int count = 0;
@@ -127,6 +129,50 @@ private static void test2(){
         }).join();
     }
 
+    private static void test3(){
+        long start = System.currentTimeMillis();
+        List<CompletableFuture<String>> targetList = new ArrayList<>();
+        for (int i = 0; i < 10; i++) {
+            final int i1 = i;
+            CompletableFuture<String> completableFuture = CompletableFuture.supplyAsync(()->{
+                try {
+                    Thread.sleep(10);
+                } catch (InterruptedException e) {
+                    e.printStackTrace();
+                }
+                System.out.println("i1 = " + i1);
+                return String.valueOf(i1);
+            }, commonExecutor);
+            targetList.add(completableFuture);
+        }
+        CompletableFuture.allOf(targetList.toArray(new CompletableFuture[0])).whenComplete((r, t) -> {
+            if (t != null) {
+                System.out.println("e = " + t);
+            }
+        }).join();
+
+        targetList.forEach(t -> {
+            System.out.println("t = " + t.toString());
+        });
+        System.out.println("耗时 time = " + (System.currentTimeMillis() - start));
+    }
+    private static void test4(){
+        long start = System.currentTimeMillis();
+        List<String> targetList = new ArrayList<>();
+        for (int i = 0; i < 10; i++) {
+            try {
+                Thread.sleep(10);
+            } catch (InterruptedException e) {
+                e.printStackTrace();
+            }
+            targetList.add(String.valueOf(i));
+        }
+        targetList.forEach(t -> {
+            System.out.println("t = " + t);
+        });
+        System.out.println("耗时 time = " + (System.currentTimeMillis() - start));
+    }
+
     private static void doSomethingForValue(List<Integer> list){
         System.out.println("逻辑处理");
         list.forEach(t -> {

src/main/java/org/lwl/design_patterns/adapter/class_dapter/Ps2.java renamed to src/main/java/org/lwl/designpatterns/adapter/class_dapter/Ps2.java

@@ -1,9 +1,8 @@
-package java_common.threads;
+package org.lwl.javacommon.threads;
 
 import java.io.File;
 import java.io.FileOutputStream;
 import java.io.IOException;
-import java.io.ObjectOutputStream;
 
 public class DeadLockTest {
 

src/main/java/org/lwl/design_patterns/adapter/class_dapter/Usb.java renamed to src/main/java/org/lwl/designpatterns/adapter/class_dapter/Usb.java

@@ -1,4 +1,4 @@
-package java_common.threads;
+package org.lwl.javacommon.threads;
 
 import com.google.common.collect.Lists;
 import com.google.common.collect.Maps;