qq_39368007的博客

class LRUCache { class Node{ public int key; public int value; public Node prev; public Node next; public Node(){} public Node(int key,int value){ this.key=key; this.value=value;.

class Solution { public ListNode mergeKLists(ListNode[] lists) { if(lists==null||lists.length==0) return null; for(int i=1;i<lists.length;i++){ lists[i]=mergeTwoLists(lists[i],lists[i-1]); } return lists[.

class Solution { // f(n, m) = (f(n – 1, m) + m) % n public int lastRemaining(int n, int m) { return (n == 1) ? 0 : (lastRemaining(n - 1, m) + m) % n; }}

class Solution { // T(n) = T(n/2) + O(1) = O(logn) public double myPow(double x, int n) { if (n == 0) return 1; if (n == -1) return 1 / x; double half = myPow(x, n >> 1); half *= half; // 是否为奇数 .

root 是一棵错误的二叉搜索树（有2个节点被错误交换）发生在逆序对的头，尾这两个位置第2个错误节点：最后一个逆序对中较小的那个节点 second/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNode(int val) { this.val = val; } * ListNode(int val, ListNode next) { this.val = val; this.next = next; } *...

class Solution { public int[] twoSum(int[] nums, int target) { if (nums == null) return null; Map<Integer, Integer> map = new HashMap<>(); for (int i = 0; i < nums.length; i++) { Integer idx = map.g...

CAS 算法解析图什么叫偏移量？要用cas修改某个对象属性的值->，首先要知道属性在对象的内存空间的哪个位置，必须知道属性的偏移量UnsafeInstance.javapackage com.dym.utils;import sun.misc.Unsafe;import java.lang.reflect.Field;public class UnsafeInstance { public static Unsafe reflectGetUns...

package com.dym.atomic;import java.util.concurrent.CountDownLatch;import java.util.concurrent.atomic.AtomicInteger;public class T1_AtomicInteger { public static int total = 0; static AtomicInteger atomic = new AtomicInteger(0); public s.

import java.util.concurrent.*;class MyTask extends RecursiveTask<Integer> { //拆分差值不能超过10，计算10以内运算 private static final Integer VALUE = 10; private int begin ;//拆分开始值 private int end;//拆分结束值 private int result ; //返回结果 ...

Producer.javapackage com.dym.one2many;//发送消息import org.apache.rocketmq.client.exception.MQBrokerException;import org.apache.rocketmq.client.exception.MQClientException;import org.apache.rocketmq.client.producer.DefaultMQProducer;import org.apache

pom.xml<?xml version="1.0" encoding="UTF-8"?><project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache..

主从架构是前提读写分离主从切换都是需要中间件去处理的但是前提的条件就是首先需要搭建主从架构的mysql的集群

设计一个支持push，pop，top操作，并能在常数时间内检索到最小元素的栈。class MinStack { /* 用来存放正常数据 */ private Stack<Integer> stack; /* 用来存放最小数据 */ private Stack<Integer> minStack; /** initialize your data structure here. */ public MinStack() { ...

/** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public class Solution { public boolean hasCycle(ListNode head)...

使用递归的方式/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNode(int val) { this.val = val; } * ListNode(int val, ListNode next) { this.val = val; this.next = n..

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */class Solution { public void deleteNode(ListNode node) { node.val = node.next.val; node.next = n...

UsbSell.javapackage com.dym.service;//目标接口public interface UsbSell { float sell(int amount); void print();}UsbKingFactory.javapackage com.dym.factory;import com.dym.service.UsbSell;//目标类public class UsbKingFactory implements Us..

每一页显示100条数据, pageSize一共有999999条数据, n请问有多少页 pageCount = (n + pageSize - 1) / pageSize

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNode(int val) { this.val = val; } * ListNode(int val, ListNode next) { this.val = val; this.next = next; }...