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...

设计一个支持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...

/** * 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; }...

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

/** * 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; }...

/** * 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[] subSort(int[] nums) { if (nums.length == 0) return new int[] { -1, -1 }; // 从左扫描到右寻找逆序对（正序：逐渐变大） int max = nums[0]; // 用来记录最右的那个逆序对位置 int r = -1; for (int i = 1; i < nums.length; i...

/* * 一个只包含0、1、2的整型数组，要求对它进行【原地】排序 * 你能想出一个仅使用常数空间的一趟扫描算法吗？ * * 空间复杂度O(1)，时间复杂度O(n) */class Solution { public void sortColors(int[] nums) { int i = 0; int l = 0; int r = nums.length - 1; while (i <= r) { if (n...

class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { // nums1 = [1,3,5,0,0,0], m = 3 // nums2 = [2,4,6], n = 3 int i1 = m - 1; int i2 = n - 1; int cur = nums1.length - 1; while (i2 >.

* 去以root为根节点的二叉树中查找p、q的最近公共祖先 * ① 如果p、q同时存在于这棵二叉树中，就能成功返回它们的最近公共祖先 * ② 如果p、q都不存在于这棵二叉树中，返回null * ③ 如果只有p存在于这棵二叉树中，返回p * ④ 如果只有q存在于这棵二叉树中，返回q下面的这种写法是错误的/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeN.

class Solution { public String longestPalindrome(String s) { if (s == null) return null; char[] cs = s.toCharArray(); if (cs.length <= 1) return s; // 最长回文子串的长度（至少是1） int maxLen = 1; // 最长回文子串的开始索引 int begin = 0;

暴力法动态规划解法class Solution { public String longestPalindrome(String s) { if (s == null) return null; char[] cs = s.toCharArray(); if (cs.length <= 1) return s; // 最长回文子串的长度（至少是1） int maxLen = 1; // 最长...

前序遍历的方式/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNod...

class Solution { public int minDistance(String word1, String word2) { if (word1 == null || word2 == null) return 0; char[] cs1 = word1.toCharArray(); char[] cs2 = word2.toCharArray(); int[][] dp = new int[cs1.lengt...

class Solution { public int maxProfit(int[] prices) { if (prices == null || prices.length == 0) return 0; // 前面扫描过的最小价格 int minPrice = prices[0]; // 前面扫描过的最大利润 int maxProfit = 0; // 扫描所有的价格 for (int i = 1; i &l...

class Solution { public int maxValue(int[][] grid) { int rows = grid.length; int cols = grid[0].length; int[][] dp = new int[rows][cols]; dp[0][0] = grid[0][0]; // 第0行 for (int col = 1; col < cols; col++) { ...

class Solution { public int lengthOfLongestSubstring(String s) { if (s == null) return 0; char[] chars = s.toCharArray(); if (chars.length == 0) return 0; // 用来保存每一个字符上一次出现的位置 Map<Character, Integer> prevIdxe...

消除字符串中的多余空格class Solution { public static String reverseWords(String s) { if (s == null) return ""; char[] chars = s.toCharArray(); // 消除多余的空格 // 字符串最终的有效长度 int len = 0; // 当前用来存放字符的位置 int cur = 0;

class Solution { public int maxSubArray(int[] nums) { if (nums == null || nums.length == 0) return 0; int[] dp = new int[nums.length]; dp[0] = nums[0]; int max = dp[0]; for (int i = 1; i < dp.length; i++) { int prev = dp[i - 1];...

class Solution { public int coinChange(int[] coins, int amount) { if(amount==0) return 0; if (coins == null || coins.length == 0) return -1; int[] dp = new int[amount + 1]; for (int i = 1; i <= amount; i++) { int min = Integer.M...

解法1 – 暴力出奇迹穷举出所有可能的连续子序列，并计算出它们的和，最后取它们中的最大值空间复杂度：O(1)，时间复杂度：O （n 3）class Solution { public int maxSubArray(int[] nums) { if (nums == null || nums.length == 0) return 0; int max = Integer.MIN_VALUE; for (int begin =...

package com.dym;public class Queens { public static void main(String[] args) { // TODO Auto-generated method stub new Queens().placeQueens(4); } /** * 数组索引是行号，数组元素是列号 */ int[] cols; /** * 一共有多少种摆法 */ int ways; void placeQueens(in.

UnionFind.javapackage com.dym.union;public abstract class UnionFind { protected int[] parents; public UnionFind(int capacity) { if (capacity < 0) { throw new IllegalArgumentException("capacity must be >= 1"); } parents = new ...

package com.dym;import java.io.BufferedReader;import java.io.File;import java.io.FileInputStream;import java.io.FileNotFoundException;import java.io.FileWriter;import java.io.IOException;import java.io.InputStreamReader;import java.io.Unsupported.

//第二种方式在添加英雄时，根据排名将英雄插入到指定位置 //(如果有这个排名，则添加失败，并给出提示) public void addByOrder(HeroNode heroNode) { //因为头节点不能动，因此我们仍然通过一个辅助指针(变量)来帮助找到添加的位置 //因为单链表，因为我们找的temp 是位于 添加位置的前一个节点，否则插入不了 HeroNode temp = head; boolean f...

SingleLinkedListDemo.javapackage com.dym.linkedlist;import java.util.Stack;public class SingleLinkedListDemo { public static void main(String[] args) { //进行测试 //先创建节点 HeroNode hero1 = new HeroNode(1, "宋江", "及时雨"); HeroNode hero2 = new ...

将数组看做是一个环形的。(通过取模的方式来实现即可)分析说明：1)尾索引的下一个为头索引时表示队列满，即将队列容量空出一个作为约定,这个在做判断队列满的时候 需要注意 (rear + 1) % maxSize == front 满] 2)rear == front [空]...

数组模拟队列出队列操作getQueue显示队列的情况showQueue查看队列头元素headQueue退出系统exitArrayQueueDemo.javapackage com.dym.queue;import java.util.Scanner;public class ArrayQueueDemo { public static void main(String[] args) { //测试一把 //创建一个队列 .

不稳稳不不稳不稳稳稳