The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.

The count-and-say sequence is the sequence of integers with the first five terms as following:

Given an unsorted integer array, find the first missing positive integer.

Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2.

Determine whether an integer is a palindrome. Do this without extra space.

Given an integer, convert it to a roman numeral.

Given a roman numeral, convert it to an integer.

Given a 32-bit signed integer, reverse digits of an integer.

上篇文章讲了下线程的创建及一些常用的方法，但是在使用的时候，大多数是采用了线程池来管理线程的创建，运行，销毁等过程。本篇将着重讲线程池的基础内容，包括通过线程池创建线程，线程池的基本信息等。...

使用雪花算法随机生成的id，使用Long类型存储到redis的时候，反序列化为Object类型，对于数值类型，取出后统一转为Object,导致泛型类型丢失，数值自动转为了Integer类型，range of int (-2147483648 - 2147483647)。...