leetcode
weixin_42295334
这个作者很懒,什么都没留下…
展开
-
快速排序
快速排序:https://blog.csdn.net/MoreWindows/article/details/6684558转载 2020-01-24 07:34:13 · 47 阅读 · 0 评论 -
KMP alg.
public class KMP { private int[][] dp; private String pat; public KMP(String pat) { this.pat = pat; int M = pat.length(); // dp[状态][字符] = 下个状态 dp = new in...转载 2019-12-26 16:13:13 · 44 阅读 · 0 评论 -
16.3sum closest
16.3sum closest import java.lang.Math; import java.util.*; class Solution { public int threeSumClosest(int[] nums, int target) { int clos_sum = nums[0]+nums[1]+nums[2]; int ini_diff= Math....原创 2019-11-18 06:17:44 · 69 阅读 · 0 评论