jt781861965的博客

Java实现，矩阵随机按列排序

NC86 矩阵元素查找3种解法

直接上算法实现及测试代码public class KMP { public static int getIndexOf(String s1, String s2) { if (s1 == null || s2 == null || s2.isEmpty() || s1.length() < s2.length()) { return -1; } char[] str1 = s1.toCharArray();

合并K个有序链表（附带leetcode测试地址）源码package suanfa.lianbiao;import java.util.PriorityQueue;// 测试链接：https://leetcode.com/problems/merge-k-sorted-lists/public class MergeKSortedListsTest { public static ListNode mergeKLists(ListNode[] lists) { if (

合并2个有序链表（附带leetcode测试地址）源码package suanfa.lianbiao;// 测试链接：https://leetcode.com/problems/merge-two-sorted-listspublic class MergeTwoSortedListsTest { public static ListNode mergeTwoLists(ListNode l1, ListNode l2) { if (l1 == null || l2 ==

双链表的3中反转方式，附带简单测试。源码package suanfa.lianbiao;import java.util.Stack;public class ReverseDoubleTest { public static void main(String[] args) { DoubleNode doubleNode1 = new DoubleNode(1, null); DoubleNode doubleNode2 = new DoubleNod

单链表的3中反转方式，附带简单测试。源码package suanfa.lianbiao;import java.util.Stack;public class ReverseListTest { public static void main(String[] args) { Node node1 = new Node(1, null); Node node2 = new Node(2, node1); Node node3 = new

选择排序（Selection Sort）动图演示地址（https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html）代码结构源码前置条件：父接口和测试类从上篇文章获取（https://blog.youkuaiyun.com/jt781861965/article/details/117051443）package suanfa.paixu;public class XuanZeTest implements Sort {

堆排序（Heap Sort）动图演示地址（https://www.cs.usfca.edu/~galles/visualization/HeapSort.html）代码结构源码前置条件：父接口和测试类从上篇文章获取（https://blog.youkuaiyun.com/jt781861965/article/details/117051443）package suanfa.paixu;public class DuiTest implements Sort { public sta

桶排序（Bucket Sort）动图演示地址（https://www.cs.usfca.edu/~galles/visualization/BucketSort.html）代码结构源码前置条件：父接口和测试类从上篇文章获取（https://blog.youkuaiyun.com/jt781861965/article/details/117051443）package suanfa.paixu;import java.util.ArrayList;import java.util.Collec

基数排序（Radix Sort）动图演示地址（https://www.cs.usfca.edu/~galles/visualization/RadixSort.html）代码结构源码前置条件：父接口和测试类从上篇文章获取（https://blog.youkuaiyun.com/jt781861965/article/details/117051443）package suanfa.paixu;public class RadixSort implements Sort { public

冒泡排序（Bubble Sort）动图演示地址（https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html）代码结构源码前置条件：父接口和测试类从上篇文章获取（https://blog.youkuaiyun.com/jt781861965/article/details/117051443）package suanfa.paixu;public class MaoPaoTest implements Sort {

快速排序（Quick Sort）动图演示地址（https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html）代码结构源码前置条件：父接口和测试类从上篇文章获取（https://blog.youkuaiyun.com/jt781861965/article/details/117051443）package suanfa.paixu;public class KuaiPaiTest implements Sort { p

奇偶排序（Parity Sort）参考地址（https://blog.youkuaiyun.com/lemon_tree12138/article/details/50605563?spm=1001.2014.3001.5501）代码结构源码前置条件：父接口和测试类从上篇文章获取（https://blog.youkuaiyun.com/jt781861965/article/details/117051443）package suanfa.paixu;public class JiOuTest implem

归并排序（Merge Sort）动图演示地址（https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html）代码结构源码前置条件：父接口和测试类从上篇文章获取（https://blog.youkuaiyun.com/jt781861965/article/details/117051443）package suanfa.paixu;public class GuiBingTest implements Sort {

计数排序（Counting Sort）动图演示地址（https://www.cs.usfca.edu/~galles/visualization/CountingSort.html）（动图里面多了一步累加和）代码结构源码前置条件：父接口和测试类从上篇文章获取（https://blog.youkuaiyun.com/jt781861965/article/details/117051443）package suanfa.paixu;public class CountSort implement

插入排序（Insertion Sort）动图演示地址（https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html）代码结构源码前置条件：父接口和测试类从上篇文章获取（https://blog.youkuaiyun.com/jt781861965/article/details/117051443）package suanfa.paixu;public class ChaRuTest implements Sort {

排序算法类的父接口和测试工具类代码结构源码package suanfa.paixu;public class DuiShuQi { public static int[] getArr(int maxL, int maxV) { int l = (int) (Math.random() * maxL); int[] arr = new int[l]; for (int i = 0; i < l; i++) {

byte a = 10000 0001byte b = -11000 00011000 00001111 1111byte c = 00000 00001000 00101000 00011111 1110其实感觉也就是一个大环形，减了一下一样，环的大小应该就是最大位数1 0000 0000为了和正数共用一套算法...

异或：^7^13=107: 011113: 110110: 1010 相同为0，不同为1（无进位相加）0^N=NN^N=0AB=BA(AB)C=A(BC)两数交换(不能是同一个内存地址)A=A^B （A=A^B）B=A^B （B=ABB=A）A=A^B （A=ABA=B）上面的限制也适用于下面的代码A=A+B （A=A+B）B=A-B （B=A+B-B=A）A=A-B （A=A+B-A=B）得到最左侧的非0数值A&(-A)=A&(~A+1)...