zyq_19960204的博客

文章目录项目问题数据回流架构数据流图设计总结成果你这个项目的QPS、订单量有多少如何解决超卖问题假如让你设计一个秒杀系统，怎么设计才能承受百万级并发秒杀系统场景特点秒杀架构设计理念架构方案设计思路前端方案浏览器端(js)：后端方案服务端控制器层(网关层)服务层数据库层讲讲数据库表怎么设计的为什么使用自增字段作主键spring里面的控制反转，IoC高频搜索关键词，每个文件1G，每个文件有多行 TopK问题一个列表，找出最长的字串，满足字串的每个元素相差不超过limitjwt优缺点优点缺点使用场景虚函数是什么逻

#include<stdio.h>const double EPSINON=1e-10;// 二分法控制精度 例子：求sqrt(2) 的精确值int main(){ double low=1.4; double high=1.5; double mid=(low+high)/2; while (high-low>EPSINON){...

题目描述查找和排序题目：输入任意（用户，成绩）序列，可以获得成绩从高到低或从低到高的排列,相同成绩      都按先录入排列在前的规则处理。   例示：   jack      70   peter     96   Tom       70   smith     67   从高到低  成绩               peter     96       jack      70       ...

       这次的题目用的是截图，我没有它的文档版，只是看这个题目有意思，发一下，自己也练习使用了vector，题目主要的思路就是构建序列+降序排序，题目卡人的地方就是对边界的处理，判断s与序列中元素个数的大小#include&lt;stdio.h&gt;#include&lt;string.h&gt;#include&lt;stdlib.h&gt;#include&lt;iostream...

TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 17117 Accepted: 8175DescriptionCalculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - t...

#include#include#include#define MAXNUM 60typedef struct{char ch;int weight; //权值，这个字符出现的频率int parent;int left;int right;}HuffNode;typedef struct{char code[MAXNUM];int start;}HuffCode

DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the seque

DescriptionA catenym is a pair of words separated by a period such that the last letter of the first word is the same as the last letter of the second. For example, the following are catenyms: d

DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzz

错排公式n各有序的元素应有n！种不同的排列。如若一个排列式的所有的元素都不在原来的位置上，则称这个排列为错排。核心递推公式：D(n) = (n-1) [D(n-2) + D(n-1)]特殊地，D(1) = 0, D(2) = 1.欧拉回路的判定一.无向图一个无向图存在欧拉路径，当且仅当 该图所有顶点的度数为偶数 或者 除了两个度数为奇数外其余的全是偶数。

DescriptionBessie's been appointed the new watch-cow for the farm. Every night, it's her job to walk across the farm and make sure that no evildoers are doing any evil. She begins at the barn, mak

#include #include #include #include #include #include using namespace std;const int MAXN = 410; //数字的最大长度，根据情况自己调整struct bign{ int len, s[MAXN]; bign () { memset(s, 0, sizeof(s));

儿童节那天有K位小朋友到小明家做客。小明拿出了珍藏的巧克力招待小朋友们。小明一共有N块巧克力，其中第i块是Hi x Wi的方格组成的长方形。为了公平起见，小明需要从这 N 块巧克力中切出K块巧克力分给小朋友们。切出的巧克力需要满足：1. 形状是正方形，边长是整数 2. 大小相同 例如一块6x5的巧克力可以切出6块2x2的巧克力或者2块3x3的巧克力。当然小朋

DescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is

Problem DescriptionThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj.For a given sequence of numbers a1, a2, ..., an, if we mov

DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of the c

DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 Fortunately, Bessie has a powerful weapon that can vaporize all the astero

DescriptionIt is well known that it is not easy to select courses in the college, for there is usually conflict among the time of the courses. Li Ming is a student who loves study every much, and

DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P s