- 博客(32)
- 资源 (9)
- 收藏
- 关注
原创 mybatis打印执行的sql语句
@Slf4j@Intercepts({ @Signature(type = StatementHandler.class, method = "prepare", args = {Connection.class, Integer.class})})public class MyPlugin implements Interceptor { Transaction transaction; //方法拦截 @Override public Obje..
2022-02-11 15:28:00
1143
原创 docker安装完启动失败(code=exited, status=1/FAILURE)错误解决办法
转载https://blog.youkuaiyun.com/qq_1365462762/article/details/80623524
2020-10-03 10:34:36
6716
原创 去掉浏览器多重滚动条
$("#iframe")[0].onload = function(){ $("#iframe")[0].style.height = $("#iframe")[0].contentWindow.document.body.offsetHeight + 180 + "px"; }
2020-05-22 11:00:02
289
原创 android将后台应用置顶及moveTaskToFront的用法
private void bring2Front() { ActivityManager activtyManager = (ActivityManager) getSystemService(Context.ACTIVITY_SERVICE); List<ActivityManager.RunningTaskInfo> runningTask...
2020-03-18 14:46:11
11000
原创 PhotoView单击事件
PhotoView是一个很好用的图片缩放库,github地址为https://github.com/chrisbanes/PhotoView为PhotoView添加单击事件的方法如下 PhotoView photoView = new PhotoView(container.getContext()); photoView.setBackgr...
2019-09-10 17:11:41
384
1
原创 spring下载地址
自从spring4后,官方推荐使用maven方式获取spring框架,找了很久终于找到下载spring zip文件的地址http://repo.spring.io/release/org/springframework/spring/
2015-07-21 14:31:49
463
翻译 蓝牙通信模块
package com.example.b2;import java.io.IOException;import java.io.InputStream;import java.io.OutputStream;import java.util.UUID;import android.bluetooth.BluetoothAdapter;import android.blueto
2013-12-13 18:07:09
1139
转载 Arrays.java
/**/package java.util;import java.lang.reflect.*;/**/public class Arrays { // private Arrays() {} /**/ /**/ public static void sort(int[] a) { DualPivotQuicksort.
2012-10-10 18:46:49
681
原创 Huffman编码问题
#include #include#include#define n 100#define m 2*n-1typedef struct { char ch; char bits[9]; int len;}CodeNode;typedef CodeNode HuffmanCode[n+1];typedef struct { int weight;
2012-07-08 14:36:52
1049
原创 创建一个链表
创建一个单链表,并且输出#include#includestruct list{ int data; struct list* next;};void CreateList(list*p){ int d; list* head; head=(list*)malloc(sizeof(list)); scanf("%d",&d); if(d!=-1) { head->
2012-05-30 08:08:24
674
原创 堆排序
#include #include#include#define max 100void swap(int *a,int* b){ int tmp; tmp=*a; *a=*b; *b=tmp;}void HeapAdjust(int array[], int i, int nLength){ for(int j=i;2*j+1<nLength;j++) {
2012-05-18 17:59:46
511
Mycat权威指南
2015-08-31
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人