Ye (Ethan) Yuan

56题java版代码： ```java class Solution { public int[][] merge(int[][] intervals) { int n = intervals.length; LinkedList res = new LinkedList(); Arrays.sort(intervals, (a, b) -> { if(a[0]!=b[0]) return a[0]-b[0]; else return b[1]-a[1];...

【Java版空间压缩代码供参考】 能力有限所以没有实现@[**dreamer2q**](https://github.com/dreamer2q) 同学的严格O(min(M,N))空间复杂度，不过马虎一下毕竟还是把复杂度降低了一个数量级（ ```java // 空间压缩版代码 class Solution { public int minDistance(String word1, String word2) { int m = word1.length(), n = word2.length(); int[] dp = new int[n + 1];...

Java版nSum模板及4Sum调用示例： ``` Java public List fourSum(int[] nums, int target) { Arrays.sort(nums); return nSum(nums, 4, 0, target); } private List nSum(int[] nums, int n, int start, int target) { int len...

优化版和为 k 的子数组理解： 1. 首先将“统计和为k区间”等价转化为“统计0->j前缀和” `sum0_j = sum0_i - k` 2. 接下来不断右移i，增加前缀和(0->i)，在每个case下继续维护HashMap，并更新答案

Hi, my name is Ye Yuan and will attend Open Source Day '23. I'm interested in this issue!

> I believe domain socket support was added to Java in version 16 with [JEP-380](https://openjdk.java.net/jeps/380). As a consequence, if we want to support older versions of Java as well, we...

thanks! good to know