2020年8月29日
递归合并两个有序链表
public ListNode mergeTwoLists(ListNode l1, ListNode l2) { if(l1 == null) { return l2; } if(l2 == null) { return l1; } if(l1.val < l2.val) { l1.next = Read More
posted @ 2020-08-29 22:36 soft.push("zzq") Views(132) Comments(0) Diggs(0) Edit
数组中重复的数字
class Solution { public int findRepeatNumber(int[] nums) { int temp; for(int i=0;i<nums.length;i++){ for (;nums[i]!=i;){ if(nums[i]==nums[nums[i]]){ r Read More
posted @ 2020-08-29 21:37 soft.push("zzq") Views(94) Comments(0) Diggs(0) Edit
逆序对，暴力破解
public int reversePairs(int[] nums) { int cnt = 0; int len = nums.length; for (int i = 0; i < len - 1; i++) { for (int j = i + 1; j < len; j++) { if ( Read More
posted @ 2020-08-29 21:33 soft.push("zzq") Views(162) Comments(0) Diggs(0) Edit
循环有序的数组进行二分查找
/** * 循环有序的数组进行二分查找 * @param A */ public static int find(int[] A, int n, int target){ if(n<=0) return -1; int left = 0, right = n-1; while(left<=right Read More
posted @ 2020-08-29 20:38 soft.push("zzq") Views(336) Comments(0) Diggs(0) Edit
字符串转换为int
public static int strToInt(String str) { char[] s = str.trim().toCharArray(); int len = s.length; // 去除空格后长度为0则返回0 if (len == 0) return 0; int sign = Read More
posted @ 2020-08-29 13:33 soft.push("zzq") Views(148) Comments(0) Diggs(0) Edit
redis基于用户访问限流
/** * * @param userId * @param period 窗口大小 * @param maxCount 最大频次限制 * @return */ public boolean isActionAllowed(String userId, int period, int maxCoun Read More
posted @ 2020-08-29 11:38 soft.push("zzq") Views(250) Comments(0) Diggs(0) Edit