Spring中Bean的种类及作用域
解决JDK版本导致JMeter无法启动问题
SomethingBeTrue:
修改后启动jmeter.bat，还会报一个WARNING，需要以管理员权限执行一次后，这个警告才不会再提示；
【搞定算法】找出数组中出现次数大于数组长度一半和 N/K 的数
m0_47471640:
看一下要求，要求空间复杂度o1
【手撕代码】多个线程交替打印
程序员的暴击:
在给你补一个
[code=java]
public class PrintByPark {
static Thread a;
static Thread b;
static Thread c;
public static void main(String[] args) {
ParkUnPark parkUnPark = new ParkUnPark(5);
a = new Thread(() -> parkUnPark.print("a", b));
b = new Thread(() -> parkUnPark.print("b", c));
c = new Thread(() -> parkUnPark.print("c", a));
a.start();
b.start();
c.start();
LockSupport.unpark(a);
}
}
class ParkUnPark{
private final int loopNum;
public ParkUnPark(int loopNum) {
this.loopNum = loopNum;
}
public void print(String content, Thread next){
for (int i = 0; i < loopNum; i++) {
LockSupport.park();
System.out.println(content);
LockSupport.unpark(next);
}
}
}
[/code]
【leetcode】第5题：最长回文子串
程序员的暴击:
[code=java]
public static String longestPalindrome(String str){
String reserveString = new StringBuilder(str).reverse().toString();
int len1 = str.length(),len2 = reserveString.length();
int[][] lenArr = new int[len1][len2];
int maxLen = 0,maxEndStrlen = 0;
for (int i = 0; i < len1; i++) {
for (int j = 0; j < len2; j++) {
if (str.charAt(i) == reserveString.charAt(j)){
if (i ==0 || j==0){
lenArr[i][j] = 0;
}
else {
lenArr[i][j] = lenArr[i-1][j-1] + 1;
}
}
if ( lenArr[i][j] > maxLen){
maxLen = lenArr[i][j];
maxEndStrlen = i;
}
}
}
return str.substring(maxEndStrlen - maxLen + 1 ,maxEndStrlen +1);
}
[/code]
字符串的排列与组合【Java 递归实现】
程序员的暴击:
全排列
[code=java]
public static List
List
backtrack(list, new LinkedList<>(), nums);
return list;
}
private static void backtrack(List
if (tempList.size() == nums.length) {
list.add(new ArrayList<>(tempList));
}
else {
for (int num : nums) {
if (tempList.contains(num)) {
continue;
}
tempList.add(num);
backtrack(list, tempList, nums);
tempList.removeLast();
}
}
}
[/code]