zsy112371的专栏

使用@PathVariable时可能会遇到的问题

主要思路来源于下面这个博客:https://blog.youkuaiyun.com/qq_42060170/article/details/104241823在细节上，做了一些修改：（1）定义了新的Comparator接口，使之能正确针对左闭右开区间进行排序（2）原文中的Point类对应于本文的Interval类，删除类原文中的Interval类（3）增加了控制台的输入和输出（4）原文...

/** * 用于排序一个满足以下条件的文件: * (1) 文件中只范围在0～1024*1024*8-1的整数 * (2) 每个数字只出现1次或0次 * 使用到的数组大小: * 约1MB * 排序时间复杂度: * O(n), n为文件中出现的数字总数 */public class BitMap { public static vo...

题目如下：Find the total area covered by two rectilinear rectangles in a2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Assume that th

题目如下；Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to

题目如下：Write a function to find the longest common prefix string amongst an array of strings.    给定一个String类型数组，要求写一个方法，返回数组中这些字符串的最长公共前缀。举个例子：假如数组为["123","12","4"]，经过这个方法返回的结果就应该是""。因为"123"，"12"，

题目如下：Remove all elements from a linked list of integers that have value val.ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 --> 3 --> 4 --> 5

题目如下：Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.    题目的意思很明确，我们只要知道罗马数字的计算规则就可以写出这道题的答案了，直接看百度百科关于罗马数字的解释就可以，链接在这里：http://bai

今天是中秋假期的第二天，上午打了一上午的炉石，买了30元十包的新手包，毫不意外地啥也没开出来......好了，言归正传。今天的习题是这样的：给定两个正整数（二进制形式表示）A和B，问把A变为B需要改变多少位（bit）？也就是说，整数A和B的二进制表示中有多少位是不同的？    解决这个问题的思路应该分两步走：（1）找到A和B中所有不同的位；（2）将找到的不同的位进行计数。    第

题目如下：Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?    题目还是很简单，判断一个链表是不是“回文链表”。然后稍微难一点的是是否能够用O(n)的时间复杂度和O(1)空间复杂度完成这个方

题目如下：You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adj

题目如下：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \

题目如下：Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.Note:Yo

题目如下：Write a function that takes a string as input and reverse only the vowels of a string.Example 1:Given s = "hello", return "holle".Example 2:Given s = "leetcode", return "leotced

题目如下：Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant

题目如下：Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.    题目内容也非常简单，给定一个二叉树的根结点

题目如下：Determine whether an integer is a palindrome. Do this without extra space.    判断一个数是否为“回文数”，禁止使用额外的存储空间。    按例奉上自己的Low B思路及已Accepted的代码。我第一眼看到这个题目的时候想法很简单，先查看给定数的最高位和最低位的数值是否相等，然后查看次高位和次低

题目如下：Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant spa

题目如下：Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are

题目如下：A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59).Each LED represents a zero or one, with the least significan

题目如下：Given a pattern and a stringstr, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter inpattern and a non-empty word in s

题目如下：We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I'll tell you whether the number i

题目如下：Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.    这道题还是很有意思的

题目如下：Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to gett.All occurrences of a character must be replaced wit

题目如下：Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?     题目的要求是判断一个链表中是否存在环。这个题目我还是想了很久的，最开始的思路是判断随着指针节点移动，其必然会与开始节点即head节点重合，如果重

题目如下：Given an integer n, return the number of trailing zeroes inn!.Note: Your solution should be in logarithmic time complexity    给定一个int类型的整数，求它的阶乘尾部有几个0。举例来说，如果输入是5，那么5!等于120，120尾部有一个0，所以

题目如下：Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...Note:n is positive and will fit within the range of a 32-bit signed integer (n 31).Exampl

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

题目如下：The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P

题目如下：Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired by this original tweet by

题目如下：You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provi

题目如下：Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.Examples:s = "leetcode"return 0.s = "loveleetcode",return 2.

题目如下：Given two arrays, write a function to compute their intersection.Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note:Each element in the result should a

题目如下：
Given
 an 
arbitrary
 ransom
 note
 string 
and 
another 
string 
containing 
letters from
 all 
the 
magazines,
 write 
a 
function 
that 
will 
return 
true 
if 
the 
ransom 
 note 
can

题目如下：Say you have an array for which the ith element is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the

题目如下：Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321

题目如下：Given two arrays, write a function to compute their intersection.Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].Note:Each element in the result must be uni

package hit.zsy.cn;import java.util.PriorityQueue;public class TestConPro { private int queueSize = 10; private PriorityQueue queue = new PriorityQueue(queueSize); public static void main(Str

package hit.zsy.cn;import java.util.concurrent.ArrayBlockingQueue;public class TestProCon2 { private int queueSize = 10; private ArrayBlockingQueue queue = new ArrayBlockingQueue(queueSize); p

作者：海子　　　　出处：http://www.cnblogs.com/dolphin0520/　　　　本博客中未标明转载的文章归作者海子和博客园共有，欢迎转载，但未经作者同意必须保留此段声明，且在文章页面明显位置给出原文连接，否则保留追究法律责任的权利。Java学习笔记（2）ThreadLocal什么是ThreadLocal：线程本地变量，T