四郎别认输-CSDN博客

原创算法笔记

目录基础数学问题质因子分解例题基础数学问题质因子分解质因子分解是指将一个正整数n写成一个或多个质数的乘积的形式。思路：可以先把素数表打印出来定义一个结构体数组factor用来存放质因子struct factor{ int x,cnt; //x为质因子，cnt为其个数}fac[10];思路枚举1到sqrt(n)的所有质因子p,判断p是否是n的因子,是则加入，不是跳过如果最后的n不等于1，说明有一个大于sqrt(n)的质因子，也要加入例题1096

2021-02-02 11:52:48 140

原创 TP框架的Container容器类源码分析

TP框架的Container源码分析版本：5.1.39TLSContainer的结构导图Container结构图Container中的属性$instance——用于容器自身实例化 $instances——一个用于存放容器中的对象实例的数组 $name——容器表示别名 $bind——容器绑定标识$bind的初始值 /** * 容器绑定标识 * @var array */ protected $bind = [ 'a

2020-08-22 15:22:46 859

原创 fastadmin开发插件的基本流程

什么是fastadmin？FastAdmin是一款基于ThinkPHP5+Bootstrap的极速后台开发框架。fastadmin开发基础管理插件步骤以一个学校管理插件为例开发环境与工具PHPSTORMphpstudynginx1.15.11mysql8.0php7.3.4准备工作配置站点我的域名设置为fast51admin.localhost....

2020-05-02 11:12:31 4482 1

原创 Mysql的B+树索引

目录MySQL索引机制索引的本质索引的目标索引的工作流程wMySQL支持的索引的数据结构hash索引B+树索引为什么MySQL选择B+树作为索引的数据结构平衡二叉搜索树使用平衡二叉搜索树的弊端B-树（多路平衡树）发散思考为什么不是什么字段都适合添加索引为什么MySQL推荐我们使用自增id作为主键索引B+树（B-树加强版）I/O能力强于...

2020-01-06 16:11:46 830 1

原创 kmp算法

#include <iostream>#include <string>#include <vector>using namespace std;int nexts[100];int Index_KMP(string s,string t,int pos){ int sl=s.size(); int tl=t.size(); int i=pos; int j=0; while(i<sl&&j.

2021-03-12 17:54:27 246

原创 1039 Course List for Student

Zhejiang University has 40000 students and provides 2500 courses. Now given the student name lists of all the courses, you are supposed to output the registered course list for each student who comes for a query.Input Specification:Each input file cont

2021-02-07 23:14:37 237

原创 1024 Palindromic Number

A number that will be the same when it is written forwards or backwards is known as aPalindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.Non-palindromic numbers can be paired with palindromi.

2021-02-03 21:33:52 232

原创 1023 Have Fun with Numbers

Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 246913578, which happens to be another 9-digit number consisting exactly the numbers from 1 to 9, only in a diffe

2021-02-03 20:30:06 150

原创 1059 Prime Factors

Given any positive integerN, you are supposed to find all of its prime factors, and write them in the formatN=p1k1×p2k2×⋯×pmkm.Input Specification:Each input file contains one test case which gives a positive integerNin...

2021-02-02 13:10:26 85

原创 1096 Consecutive Factors

Among all the factors of a positive integer N, there may exist several consecutive numbers. For example, 630 can be factored as 3×5×6×7, where 5, 6, and 7 are the three consecutive numbers. Now given any positive N, you are supposed to find the maximum num

2021-02-02 11:51:05 105

原创 1015 Reversible Primes (20分)

Areversible primein any number system is a prime whose "reverse" in that number system is also a prime. For example in the decimal system 73 is a reversible prime because its reverse 37 is also a prime.Now given any two positive integersN(<105)...

2021-01-31 17:01:15 90

原创 1078 Hashing (25分)

The task of this problem is simple: insert a sequence of distinct positive integers into a hash table, and output the positions of the input numbers. The hash function is defined to beH(key)=key%TSizewhereTSizeis the maximum size of the hash table. Qua...

2021-01-31 15:17:48 90

原创 1081 Rational Sum (20分)

GivenNrational numbers in the formnumerator/denominator, you are supposed to calculate their sum.Input Specification:Each input file contains one test case. Each case starts with a positive integerN(≤100), followed in the next lineNrational numb...

2021-01-26 20:47:40 98 1

原创 1008 Elevator (20分)

The highest building in our city has only one elevator. A request list is made up withNpositive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to..

2021-01-25 19:06:55 83

原创 1101 Quick Sort (25分)

There is a classical process namedpartitionin the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then the elements less than the pivot are moved to its left and those larger than the pivot to its right. GivenN...

2021-01-25 09:20:41 88

原创 93 Count PAT‘s (25分)

The stringAPPAPTcontains twoPAT's as substrings. The first one is formed by the 2nd, the 4th, and the 6th characters, and the second one is formed by the 3rd, the 4th, and the 6th characters.Now given any string, you are supposed to tell the number of...

2021-01-24 21:52:38 111 1

原创王道——顺序表编程题

1.从顺序表中删除具有最小值的元素（假设唯一）并有函数返回被删元素的值。空出的位置由最后一个元素填补，若顺序表为空则显示出错信息并退出运行。struct ll{ int nums[10]= {1,3,4,9,7,5,2,6,8,0}; int length=10; int max_size=10; int del_min() { if(length==0) { cout<<"顺序表为空".

2021-01-17 17:52:32 840

原创 1029 Median (25分)

1029Median(25分)Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 = { 9, 10, 15, 16, 17 } is 15. The median of two sequences is d..

2021-01-15 21:52:14 122

原创 1089 Insert or Merge (25分)

According to Wikipedia:Insertion sortiterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, a.

2021-01-15 21:30:16 97

原创 1048 Find Coins (25分)

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for eac

2021-01-14 16:54:08 108

原创快速幂模板

递归版本typedef long long ll;//求a^b%m得快速幂的递归写法ll binaryPow(ll a,ll b,ll m){ if(b==0) return 1; //如果b为0，那么a^0=1; //b为奇数，转为b-1 if(b&1) //替换b%2==1,位与操作速度更快 return a*binaryPow(a,b-1)%m; else{ //b为偶数，转为b/2 ll m

2021-01-14 11:27:14 98

原创解决寻找有序序列第一个满足某条件的元素的位置的固定模板（二分思想）

//解决“寻找有序序列第一个满足某条件的元素的位置”问题的固定模板//二分区间为[left,right]，初值必须能覆盖解的所有可能取值int solve(int left,int right){ int mid; while(left<right) { mid=(left+right)/2; if(条件成立) //第一个满足该条件的元素的位置<=mid { right=mid;//搜左区..

2021-01-14 10:08:04 113

原创 1067 Sort with Swap(0, i) (25分)

Given any permutation of the numbers {0, 1, 2,...,N−1}, it is easy to sort them in increasing order. But what ifSwap(0, *)is the ONLY operation that is allowed to use? For example, to sort {4, 0, 2, 1, 3} we may apply the swap operations in the followin...

2021-01-13 16:01:55 107

原创 1037 Magic Coupon (25分)

The magic shop in Mars is offering some magic coupons. Each coupon has an integerNprinted on it, meaning that when you use this coupon with a product, you may getNtimes the value of that product back! What is more, the shop also offers some bonus produ...

2021-01-13 14:28:11 117

原创 1005 Spell It Right (20分)

Given a non-negative integerN, your task is to compute the sum of all the digits ofN, and output every digit of the sum in English.Input Specification:Each input file contains one test case. Each case occupies one line which contains anN(≤10100)...

2021-01-10 21:12:20 117 1

原创 1025 PAT Ranking (25分)

Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your

2021-01-10 20:53:58 76

原创王道数据结构错题总结——第一章

1.可以用（抽象数据类型）定义一个完整的数据结构。解析：抽象数据类型（ADT）描述了数据的逻辑结构和抽象运算，通常用（数据对象，数据关系，基本操作集）这样的三元组来表示，从而构成一个完整的数据结构定义。2.数据的逻辑结构独立于其逻辑结构。解析：数据的逻辑结构是从面向实际问题的角度出发的，只采用抽象表达方式，独立于存储结构，数据的存储方式有多种不同的选择；而数据的存储结构是逻辑结构在计算机上的映射，它不能独立于逻辑结构二存在。3.对于不同的数据结构，逻辑结构和物理结构可以完全相同。

2021-01-10 18:41:06 1424

原创 java复习整理——第4章

继承子类重写父类时不能定比它更高的访问权限super关键字可以访问父类的成员变量和成员方法在子类的构造方法中可以使用这个关键字访问父类的构造方法final关键字特性final修饰的类不能被继承 final修饰的方法不能被子类重写 final修饰的变量是常量，只能赋值一次抽象类当定义方法但不写方法体时可以定义为抽象类，关键字是abstract。抽象方法一定在抽象类中，但抽象类不一定有抽象方法接口函数型接口只有一个抽象方法使用接口的目的是克服单继承的限制，一

2020-12-27 20:33:18 127

原创 java复习整理——第三章

面向对象的三个特性封装性、继承性、多态性对象定义A a = new A();变量a的内存中存放A对象的内存地址，即指向对象A变量为null表示该变量不指向任何对象构造方法满足条件：方法名与类名相同，在方法名的前面没有返回值类型的声明，在方法中不能使用return语句返回一个值，但是可以单独写return语句作为方法的结束。this关键字指代当前对象可以在一个类的构造方法中使用this(参数1，参数2...)的方式调用其他构造方法但要注意只能在构造方法中使用t

2020-12-27 17:26:54 805

原创 java复习整理——第二章

java中的常量整型常量浮点数常量——单精度末尾以F或f结尾，双精度末尾以D或d结尾，不加默认是double型字符常量，Java采用Unicode字符集字符串常量布尔常量 null常量java中的变量类型基本数据类型：整数类型，浮点类型，字符型，布尔型引用数据类型：类，接口，数组，枚举，注解整数类型——byte，short，int，longbyte占8个字节，给long赋值时要在后面加上L(l)后缀（如果数据长度超过int的话）浮点数类型——double，f.

2020-12-27 15:33:17 272

原创算法分析与设计(王秋芬)(1)——贪心法

贪心法贪心法的基本思想每个阶段面临选择时，贪心法都做出对眼前情况的最优解，不考虑后续影响。每个阶段的决策一旦做出，不可以更改，不能回溯贪心法是根据贪心策略来逐步构造问题的解，策略不同结果不同贪心法具有高效性和不稳定性，它可以很快得到解，但不一定是最优解。贪心算法的好坏关键在于贪心策略的选择贪心法的基本要素（适合的问题）最优子结构性质——当一个问题的最优解一定包含其子问题的最优解时，则该问题具有最优子结构性质贪心选择性质——所求问题的整体最优解可以通过一系列局部最优的选择获得

2020-12-17 20:30:45 789

原创 1004 Counting Leaves (30分)

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.Input Specification:Each input file contains one test case. Each case starts with a line containing0<N<100, the number of nod.

2020-12-11 09:56:58 86

原创 1003 Emergency (25分)——迪杰斯特拉模板题

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked

2020-12-10 09:46:55 205

空空如也

空空如也