weixin_42295334的博客

转载 快速排序

快速排序：https://blog.csdn.net/MoreWindows/article/details/6684558

转载 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...

转载 Scanner

读取多行输入Scanner sc = new Scanner(System.in);Arraylist<Integer> list = new Arraylist<>();while(sc.hasNext()){ String str = sc.nextline(); list.add(Integer.valueof(str));}System.out.pri...

原创 int to string

class A{ public static void main(String args[]) { //Integer.toString int a = 1234; int b = -1234; String str1 = Integer.toString(a); String str2 = Integer.toString(b); S...

转载 list to array, both way

//要转换的list集合 List<String> testList = new ArrayList<String>(){{add("aa");add("bb");add("cc");}}; //使用toArray(T[] a)方法 String[] array2 = testList.toArray(new String[testList.size()]);/...

原创 Sorting complexity

原创 16.3sum closest

16.3sum closestimport 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....