Given N integers, you are supposed to find the smallest positive integer that is NOT in the given list.

You are given two positive integers aa and bb.

1. 自动装箱：把基本类型转换为包装类类型int a =10;Integer i = new Integer(a);

You have an array aa of length nn. For every positive integer xx you are going to perform the following operation during the xx-th second:

You have integer nn. Calculate how many ways are there to fully cover belt-like area of 4n−24n−2 triangles with diamond shapes.

You have a large electronic screen which can display up to 998244353998244353 decimal digits. The digits are displayed in the same way as on different electroni...

Let's call an array of non-negative integers a1,a2,…,ana1,a2,…,an a kk-extension for some non-negative integer kk if for all possible pairs of indices 1≤i,j≤n1≤...

A. Alex and a Rhombus time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output While playing with geometric...

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integer...

Given a positive integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.