├── .gitignore
├── README.md
├── java-algorithm
├── pom.xml
└── src
│ └── main
│ └── java
│ └── com
│ └── wdbyte
│ ├── leetcode
│ ├── L001_TwoSum.java
│ ├── L002_AddTwoNumbers.java
│ ├── L003_LongestSubstringWithoutRepeatingCharacters.java
│ └── Leetcode1047.java
│ ├── offer
│ ├── Lab2_Singleton.java
│ ├── Lab3_FindRepeatNumber.java
│ ├── Lab4_FindInTwoArray.java
│ ├── Lab5_ConvertLinkedList.java
│ └── Lab7_TwoStackAsQueue.java
│ └── other
│ ├── FindNumber.java
│ ├── JiTu.java
│ ├── LoadBalancingByIpHash.java
│ ├── LoadBalancingByOneByOne.java
│ ├── LoadBalancingByOneByOneByWeight.java
│ ├── LoadBalancingByRandom.java
│ ├── LoadBalancingByRandomWeight.java
│ ├── SplitString.java
│ ├── StringCombo.java
│ └── StringSplit.java
├── java-decompiler
├── pom.xml
└── src
│ └── main
│ └── java
│ └── com
│ └── wdbyte
│ └── decompiler
│ ├── CFRTest.java
│ ├── FernflowerTest.java
│ ├── HardCode.java
│ ├── JDCoreTest.java
│ ├── JMHTest.java
│ └── ProcyonTest.java
├── java-lab
├── pom.xml
└── src
│ └── main
│ ├── java
│ └── com
│ │ └── wdbyte
│ │ └── lab
│ │ ├── classloader
│ │ ├── BaseManager.java
│ │ ├── ClassLoadTest.java
│ │ ├── LoadInfo.java
│ │ ├── ManagerFactory.java
│ │ ├── MsgHandle.java
│ │ ├── MyClasslLoader.java
│ │ └── MyManager.java
│ │ ├── io
│ │ ├── aio
│ │ │ ├── AioSocketServer.java
│ │ │ ├── SocketClient.java
│ │ │ └── SocketClientRequestThread.java
│ │ ├── bio
│ │ │ ├── SocketClient.java
│ │ │ ├── SocketClientRequestThread.java
│ │ │ ├── SocketServer.java
│ │ │ └── SocketServerThread.java
│ │ ├── jdknio
│ │ │ ├── NioBuffer.java
│ │ │ ├── NioChannel.java
│ │ │ ├── NioSelector.java
│ │ │ └── NioSocketServer.java
│ │ └── nio
│ │ │ ├── SocketServerNioListen.java
│ │ │ ├── SocketServerNioListenAndRead.java
│ │ │ └── SocketServerNioListenThread.java
│ │ ├── jdk
│ │ ├── ModCountExceptionDemo.java
│ │ ├── annotation
│ │ │ ├── JdkAnnotation.java
│ │ │ └── PersonAnon.java
│ │ └── thread
│ │ │ ├── CallableFutureTest.java
│ │ │ └── ExecutorTest.java
│ │ ├── jvm
│ │ ├── ConsumeCpu.java
│ │ ├── DeadLock.java
│ │ ├── MonitoringTest.java
│ │ ├── OOMObject.java
│ │ ├── RuntimeExec.java
│ │ ├── StackOverflow.java
│ │ └── SynAddRunalbe.java
│ │ ├── other
│ │ └── GeneratorTextImage.java
│ │ ├── rmi
│ │ ├── Search.java
│ │ ├── SearchClient.java
│ │ ├── SearchQuery.java
│ │ ├── SearchServer.java
│ │ └── User.java
│ │ └── tree
│ │ └── BitTree.java
│ └── resources
│ └── banner.jpg
├── java-rmi
├── pom.xml
└── src
│ └── main
│ └── java
│ └── com
│ └── wdbyte
│ └── rmi
│ ├── client
│ └── RmiClient.java
│ └── server
│ ├── RmiServer.java
│ ├── User.java
│ ├── UserService.java
│ └── UserServiceImpl.java
├── kryo-start
└── src
│ └── main
│ └── java
│ └── SomeClass.java
├── poc-log4j2
├── Log4jTest.class
├── pom.xml
└── src
│ └── main
│ └── java
│ └── Log4j2.java
├── pom.xml
├── web-arthas
├── pom.xml
└── src
│ └── main
│ ├── java
│ └── com
│ │ └── wdbyte
│ │ └── arthas
│ │ ├── Arthas.java
│ │ ├── ArthasApplication.java
│ │ ├── HotCode.java
│ │ ├── controller
│ │ └── UserController.java
│ │ └── service
│ │ └── UserServiceImpl.java
│ └── resources
│ ├── application.yml
│ └── logback.xml
└── web-goodskill
├── README.md
├── pom.xml
└── src
└── main
├── java
├── README.md
└── com
│ └── wdbyte
│ └── goodskill
│ ├── BootApplication.java
│ ├── controller
│ └── SkillController.java
│ ├── service
│ ├── SkillService.java
│ └── impl
│ │ └── SkillServiceImpl.java
│ └── utils
│ ├── KeyUtil.java
│ └── RedisLock.java
└── resources
├── application.yml
└── logback.xml
/.gitignore:
--------------------------------------------------------------------------------
1 | .DS_store
2 | .idea/
3 | target/
4 | */target/
5 | *.iml
6 | pom.xml.tag
7 | pom.xml.releaseBackup
8 | pom.xml.versionsBackup
9 | pom.xml.next
10 | release.properties
11 | dependency-reduced-pom.xml
12 | buildNumber.properties
13 | .mvn/timing.properties
14 |
15 | # Avoid ignoring Maven wrapper jar file (.jar files are usually ignored)
16 | !/.mvn/wrapper/maven-wrapper.jar
17 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | Java 有趣实验室，**原创文章每周更新**。公众号首发。技术文字在写的过程中难免会有纰漏，或者细节不够完善。大家发现问题，可以及时给我 PR 反馈，也可以去 [**公众号**](https://github.com/niumoo/JavaNotes#%E5%85%AC%E4%BC%97%E5%8F%B7) 给我留言，或者加我 [微信](https://github.com/niumoo/JavaNotes#联系我) 直接说明，我都会及时更正，哪怕是一个错别字。加油！奥利给！
2 |
3 | Lab Notes
4 |
5 | 
6 | 
7 | 
8 | 
9 | 
10 | 
11 | 
12 |
13 |
14 | 这个仓库主要是记录一些有趣有意思的东西，以**源码**为主，每一个源码基本上都会对应一篇文章说明，文章可以在我的 [公众号](https://github.com/niumoo/JavaNotes#%E5%85%AC%E4%BC%97%E5%8F%B7) 或者仓库 [Github:niumoo/JavaNotes](https://github.com/niumoo/JavaNotes) 查看。
15 |
16 | ### ☕ 实验室
17 | - [Java 热加载的手动实现](https://github.com/niumoo/lab-notes/blob/master/java-lab/src/main/java/com/wdbyte/lab/classloader)
18 | - [Java 同步阻塞模式(Blocking IO)](https://github.com/niumoo/lab-notes/blob/master/java-lab/src/main/java/com/wdbyte/lab/io/)
19 | - [Java 同步非阻塞模式(Non-Blocking IO)](https://github.com/niumoo/lab-notes/blob/master/java-lab/src/main/java/com/wdbyte/lab/io/)
20 | - [Java 多路复用模式(Selector Non-Blocking IO)](https://github.com/niumoo/lab-notes/blob/master/java-lab/src/main/java/com/wdbyte/lab/io/)
21 | - [Java 简单的秒杀系统](https://github.com/niumoo/lab-notes/blob/master/web-goodskill/)
22 | - [Java 图片转字符图案](https://github.com/niumoo/lab-notes/blob/master/java-lab/src/main/java/com/wdbyte/lab/other/GeneratorTextImage.java)
23 | - [Java 性能分析工具使用案例 - Arthas](https://github.com/niumoo/lab-notes/blob/master/web-arthas/)
24 | - [Java 性能分析工具使用案例 - async-profiler](https://github.com/niumoo/lab-notes/blob/master/web-arthas/src/main/java/com/wdbyte/arthas/HotCode.java)
25 | - [常见的负载均衡算法](https://github.com/niumoo/lab-notes/blob/master/java-algorithm/src/main/java/com/wdbyte/other/)
26 | - [三种并发修改异常的绕过方式](https://github.com/niumoo/lab-notes/blob/master/java-lab/src/main/java/com/wdbyte/lab/jdk/ModCountExceptionDemo.java)
27 |
28 | ### 🍭 剑指Offer算法题目
29 | - [剑指 Offer 002：单例模式](https://github.com/niumoo/lab-notes/blob/master/java-algorithm/src/main/java/com/wdbyte/offer/)
30 | - [剑指 Offer 003：查找重复数字](https://github.com/niumoo/lab-notes/blob/master/java-algorithm/src/main/java/com/wdbyte/offer/)
31 | - [剑指 Offer 004：矩阵查找数字是否存在](https://github.com/niumoo/lab-notes/blob/master/java-algorithm/src/main/java/com/wdbyte/offer/)
32 | - [剑指 Offer 005：反转链表](https://github.com/niumoo/lab-notes/blob/master/java-algorithm/src/main/java/com/wdbyte/offer/)
33 | - [剑指 Offer 007：两个栈实现一个队列](https://github.com/niumoo/lab-notes/blob/master/java-algorithm/src/main/java/com/wdbyte/offer/)
34 |
35 | ### ⏳ 小算法
36 | - [字符串均匀分批](https://github.com/niumoo/lab-notes/blob/master/java-algorithm/src/main/java/com/wdbyte/other)
37 | - [字符串排列组合](https://github.com/niumoo/lab-notes/blob/master/java-algorithm/src/main/java/com/wdbyte/other)
38 |
39 | ### 联系我
40 |
41 | 可以添加我的微信 wn8398 一起交流。
42 |
43 | 
44 |
45 | ### 公众号
46 |
47 | 有帮助可以点「**赞**」在看或 :star: **Star**，谢谢你！
48 |
49 | 如果大家想要实时关注我更新的文章以及分享的干货的话，可以关注「 **未读代码** 」公众号。
50 |
51 | 
52 |
--------------------------------------------------------------------------------
/java-algorithm/pom.xml:
--------------------------------------------------------------------------------
1 |
2 |
5 |
6 | lab-notes
7 | com.wdbyte
8 | 1.0-SNAPSHOT
9 |
10 | 4.0.0
11 |
12 | java-algorithm
13 |
14 |
--------------------------------------------------------------------------------
/java-algorithm/src/main/java/com/wdbyte/leetcode/L001_TwoSum.java:
--------------------------------------------------------------------------------
1 | package com.wdbyte.leetcode;
2 |
3 | import java.util.HashMap;
4 |
5 | /**
6 | *
7 | * 给定一个整数数组，返回两个数字的索引，使它们相加到特定目标。 您可以假设每个输入只有一个解决方案，并且您可能不会两次使用相同的元素。
8 | * Example:
9 | * Given nums = [2, 7, 11, 15], target = 9,
10 | * Because nums[0] + nums[1] = 2 + 7 = 9,
11 | * return [0, 1].
12 | *
13 | * @Author niujinpeng
14 | * @Date 2018/10/31 18:12
15 | */
16 | public class L001_TwoSum {
17 |
18 | public static void main(String[] args) {
19 | int[] nums = {2, 7, 11, 15};
20 | int target = 9;
21 | // int[] ints = new TwoSum().twoSum(nums, target);
22 | int[] ints = new L001_TwoSum().twoSumByHash(nums, target);
23 | for (int anInt : ints) {
24 | System.out.println(anInt);
25 |
26 | }
27 | }
28 |
29 | /**
30 | * 暴力破解法
31 | *
32 | * @param nums
33 | * @param target
34 | * @return
35 | */
36 | public int[] twoSum(int[] nums, int target) {
37 | for (int i = 0; i < nums.length; i++) {
38 | for (int j = i + 1; j < nums.length; j++) {
39 | if ((nums[i] + nums[j]) == target) {
40 | int[] result = {i, j};
41 | return result;
42 | }
43 | }
44 | }
45 | return null;
46 | }
47 |
48 | /**
49 | * HashMap方法
50 | * 99.3% over
51 | *
52 | * @param nums
53 | * @param target
54 | * @return
55 | */
56 | public int[] twoSumByHash(int[] nums, int target) {
57 | HashMap hashMap = new HashMap<>();
58 | for (int i = 0; i < nums.length; i++) {
59 | if (hashMap.containsKey(target - nums[i])) {
60 | Integer value = hashMap.get(target - nums[i]);
61 | return new int[] {value, i};
62 | }
63 | hashMap.put(nums[i], i);
64 | }
65 | return null;
66 | }
67 |
68 | }
69 |
--------------------------------------------------------------------------------
/java-algorithm/src/main/java/com/wdbyte/leetcode/L002_AddTwoNumbers.java:
--------------------------------------------------------------------------------
1 | package com.wdbyte.leetcode;
2 |
3 | /**
4 | *
5 | * 您将获得两个非空链表，表示两个非负整数。数字以相反的顺序存储，
6 | * 每个节点包含一个数字。添加两个数字并将其作为链接列表返回。 您
7 | * 可以假设这两个数字不包含任何前导零，除了数字0本身。
8 | *
9 | * Example:
10 | * Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
11 | * Output: 7 -> 0 -> 8
12 | * Explanation: 342 + 465 = 807.
13 | *
14 | * @Author niujinpeng
15 | * @Date 2018/11/1 16:56
16 | */
17 | public class L002_AddTwoNumbers {
18 |
19 | public static void main(String[] args) {
20 | ListNode l1 = new ListNode(2);
21 | ListNode l11 = new ListNode(4);
22 | ListNode l111 = new ListNode(3);
23 | l11.next = l111;
24 | l1.next = l11;
25 |
26 | ListNode l2 = new ListNode(5);
27 | ListNode l22 = new ListNode(6);
28 | ListNode l222 = new ListNode(4);
29 | l22.next = l222;
30 | l2.next = l22;
31 |
32 | ListNode listRes = new L002_AddTwoNumbers().addTwoNumbers2(l1, l2);
33 | while (listRes != null) {
34 | System.out.print(listRes.val);
35 | listRes = listRes.next;
36 | }
37 |
38 | }
39 |
40 | /**
41 | * 算数解法
42 | * 像小学算术一样去解决这个问题，
43 | * isCarry用于记录溢出位
44 | *
45 | * @param l1
46 | * @param l2
47 | * @return
48 | */
49 | public ListNode addTwoNumbers2(ListNode l1, ListNode l2) {
50 | ListNode listRes = null;
51 | ListNode listTemp = null;
52 | boolean isCarry = false;
53 | while (l1 != null || l2 != null) {
54 | int n1 = l1 != null ? l1.val : 0;
55 | int n2 = l2 != null ? l2.val : 0;
56 | int value = n1 + n2;
57 | if (isCarry) {
58 | value++;
59 | isCarry = false;
60 | }
61 | if (value > 9) {
62 | isCarry = true;
63 | value = value % 10;
64 | }
65 | ListNode listNode = new ListNode(value);
66 | if (listRes == null) {
67 | listRes = listNode;
68 | } else {
69 | listTemp.next = listNode;
70 | }
71 | listTemp = listNode;
72 | l1 = l1 != null ? l1.next : null;
73 | l2 = l2 != null ? l2.next : null;
74 | }
75 | if (isCarry) {
76 | listTemp.next = new ListNode(1);
77 | }
78 | return listRes;
79 | }
80 | }
81 |
82 | class ListNode {
83 | int val;
84 | ListNode next;
85 |
86 | ListNode(int x) {
87 | val = x;
88 | }
89 | }
--------------------------------------------------------------------------------
/java-algorithm/src/main/java/com/wdbyte/leetcode/L003_LongestSubstringWithoutRepeatingCharacters.java:
--------------------------------------------------------------------------------
1 | package com.wdbyte.leetcode;
2 |
3 | import java.util.LinkedList;
4 | import java.util.List;
5 |
6 | /**
7 | * 没有重复字符的最长子串
8 | *
9 | * 给定一个字符串，找到最长子字符串的长度而不重复字符。
10 | *
11 | * Example 1:
12 | *
13 | * Input: "abcabcbb"
14 | * Output: 3
15 | * Explanation: The answer is "abc", with the length of 3.
16 | * Example 2:
17 | *
18 | * Input: "bbbbb"
19 | * Output: 1
20 | * Explanation: The answer is "b", with the length of 1.
21 | * Example 3:
22 | *
23 | * Input: "pwwkew"
24 | * Output: 3
25 | * Explanation: The answer is "wke", with the length of 3.
26 | * Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
27 | *
28 | * @Author niujinpeng
29 | * @Date 2018/11/2 17:51
30 | */
31 | public class L003_LongestSubstringWithoutRepeatingCharacters {
32 | public static void main(String[] args) {
33 | // int length = lengthOfLongestSubstringByChar("abcabcbb");
34 | // System.out.println(length);
35 | }
36 |
37 | /**
38 | * 找最大子串，如果已保存的结果中有相同的，清除，然后报错最大长度。
39 | *
40 | * @param s
41 | * @return
42 | */
43 | public static int lengthOfLongestSubstring(String s) {
44 | if (s.length() == 0) {
45 | return 0;
46 | }
47 | String[] sarr = s.split("");
48 | int max = 0;
49 | LinkedList list = new LinkedList<>();
50 | for (String s1 : sarr) {
51 | if (list.contains(s1)) {
52 | while (!list.isEmpty()) {
53 | if (list.get(0).equals(s1)) {
54 | list.remove(0);
55 | break;
56 | }
57 | list.remove(0);
58 | }
59 | }
60 | list.add(s1);
61 | max = list.size() > max ? list.size() : max;
62 | }
63 | return max;
64 | }
65 |
66 | /**
67 | * 使用字符串解决
68 | *
69 | * @param s
70 | * @return
71 | */
72 | public static int lengthOfLongestSubstringByString(String s) {
73 | int max = 0;
74 | int start = 0;
75 | for (int i = 0; i < s.length(); i++) {
76 | // 当前字符
77 | String ch = s.substring(i, i + 1);
78 | // 缓存字符串
79 | String tempStr = s.substring(start, i);
80 | // 缓存包含当前字符
81 | if (tempStr.contains(ch)) {
82 | // 找到字符去除
83 | int indexOf = tempStr.indexOf(ch);
84 | start = indexOf + 1;
85 | }
86 | max = (i + 1) - start > max ? (i + 1) - start : max;
87 | }
88 | return max;
89 | }
90 |
91 | public static int lengthOfLongestSubstringByHashSet(String s) {
92 | int max = 0;
93 | List