leetcode 933.Number of Recent Calls 简单
leetcode 933.Number of Recent Calls 简单Number of Recent CallsWrite a class RecentCounter to count recent requests.It has only one method: ping(int t), where t represents some time in milliseconds.Re...
leetcode 933.Number of Recent Calls 简单Number of Recent CallsWrite a class RecentCounter to count recent requests.It has only one method: ping(int t), where t represents some time in milliseconds.Re...
41. First Missing Positive41. First Missing PositiveGiven an unsorted integer array, find the smallest missing positive integer.Example 1:Input: [1,2,0]Output: 3Example 2:Input: [3,4,-1,1]Output: 2...
leetcode 15.3sumGiven an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:The solution se...
java复习手册：多线程编程进程与线程多线程开发的本质是实质上是多个线程对同一类资源进行抢占。Thread类实现多线程package ali; public class Demo01 { public static void main(String[] args) { new MyThread("小明").start(); new...
使用异或运算符实现两个数交换原理可以使用异或运算符实现两个数交换#include <iostream> using namespace std; int main(){ int a = 4, b = 5; cout<<a<<" "<<b<<endl; a = a ^ b; b = ...