摘要:
package com.yilan.leetcode; public class Solution { public static void main(String[] args) { int[] data = {1,2,3,3,3,3,4,5}; int k = 6; Solution so = 阅读全文
摘要:
class Solution { public boolean isUnique(String astr) { Set<Character> set = new HashSet<>(); for (int j = 0; j < astr.length(); j++) { if (!set.add(a 阅读全文
摘要:
package com.ll.cst; public class index { public static void main(String[] args) {// System.out.println(500%1000000007); Solution so = new Solution(); 阅读全文
摘要:
'''python实现冒泡排序'''def maopao(list): n = len(list) for i in range(1, n): #第几趟 for j in range(0, n-i): if list[j] > list[j+1]: temp = list[j] list[j] = 阅读全文
摘要:
'''二分查找:前提:数组是有序的时间复杂度:最优O(1) 最坏O(logN)'''def area(alist, targe): n = len(alist) left = 0 right = n - 1 while left <= right: mid = (left + right) // 2 阅读全文
摘要:
1.Error creating bean with name 'sqlSessionFactory' defined in class path resource [applicationContext.xml]:Invocation of init method failed 2.错误 [mai 阅读全文