- 博客(36)
- 资源 (1)
- 收藏
- 关注
原创 Spring学习
Spring 学习6、依赖注入6.1、构造器注入6.2、Set方式注入(重点)·依赖注入:set注入~ 依赖:bean对象的创建依赖于容器~ bean对象中的所有属性,由容器来注入!1、复杂类型package com.shy.pojo;public class Address { private String address; public String getAddress() { return address; } pub
2021-09-05 22:18:03
67
原创 网络编程学习
1.1 IPIP 在java中的classInetAddress 无构造器 无需newpackage com.shy.lesson1;import java.net.InetAddress;import java.net.UnknownHostException;public class TestInetAddress { public static void main(String[] args) { try { ///查询本机地址
2020-11-06 14:22:18
98
原创 PAT甲级 1118 Birds in Forest
#include<iostream>#include<vector>#include<queue>#include<cstdio>#include<unordered_set>#include<string>using namespace std;int trees=0;int ans_birds[10000][2];vector<int>v[10001];unordered_set<int>
2020-08-27 11:23:26
101
原创 PAT甲级 1115 Counting Nodes in a BST
先用bfs层序遍历 并且存储每一层的节点数 以及最高的层数 最后输出#include<iostream>#include<queue>using namespace std;struct node{ int key; int lchild=-1; int rchild=-1;};int count[1001]={0};int max_censhu=1;node nodes[1010];queue<int>q;queue<int>le
2020-08-25 17:05:49
79
原创 PAT甲级1114 Family Property
#include<iostream>#include<set> #include<cstdio>#include<vector>#include<queue>#include<algorithm>using namespace std;struct family{ int id,number; double avg_area,avg_set;};bool comp(family x,family y){ if(x
2020-08-25 16:04:08
86
原创 PAT甲级1109 Group Photo
#include<iostream>#include<vector>#include<string>#include<algorithm>using namespace std;struct student{ string name; int height;};bool comp(student x,student y){ if(x.height!=y.height) return x.height>y.height; retur
2020-08-24 20:10:50
67
原创 PAT甲级1110 Complete Binary Tree
#include<iostream>#include<queue>#include<set>using namespace std;struct node{ int lchild,rchild;};node nodes[21];queue<int>q;int the_last;bool flag=true;void bfs(int cur){if(nodes[cur].lchild!=-1){ q.push(nodes[cur].
2020-08-24 20:09:41
66
原创 PAT甲级1108 Finding Average
sprintf() 和sscanf()要用char*作为参数 strlen(char[] ) 可以获得字符串的长度#include<iostream>#include<cstring>using namespace std;int main(){ char a[50],b[50]; double temp; double sum; int cnt=0; int n; cin>>n; for(int i=0;i
2020-08-24 16:21:09
106
原创 PAT甲级1106 Lowest Price in Supply Chain
bfs#include<iostream>#include<queue>#include<cstdio>#include<vector>#include<math.h>using namespace std;vector<int>v[100000];queue<int>q;queue<int>d;int mindis=1000000;int total;void bfs(int cur,
2020-08-23 16:39:49
78
原创 PAT甲级1105 Spiral Matrix
#include<iostream>#include<cstdio>#include<vector>#include<algorithm>#include<math.h>using namespace std;bool comp(int x,int y){ return x>y;}int main(){ int ans[800][800]; int N; cin>>N; vector<i
2020-08-23 16:03:46
60
原创 PAT 甲级1103 Integer Factorization
#include<iostream>#include<math.h>#include<vector>using namespace std;vector<int>ans,ans1;vector<int>v;//存储备选数据int n,k,p;int maxsum;void dfs(int cur,int sum,int cursum,int depth){ if(sum==n){if(sum==n&&m
2020-08-23 14:02:57
138
原创 PAT甲级1104 Sum of Number Segments 测试点2
由于测试点2的数据很大,超出了double类型,所以将其转为long long类型#include<iostream>#include<cstdio>using namespace std;int main(){ double num[100005]; int n; cin>>n; for(int i=0;i<n;i++) {scanf("%lf",&num[i]); } long lo
2020-08-23 14:01:22
298
1
原创 1102 Invert a Binary Tree PAT甲级
#include<iostream>#include<queue>#include<vector>#include<algorithm>using namespace std;struct node{ int leftchild; int rightchild;};vector<int>ans1;vector<int>ans2;node nodes[10];queue<int>q;void
2020-08-23 11:37:07
71
原创 PAT甲级1099 Build A Binary Search Tree
利用中序遍历法构造二叉搜索树,再用bfs的思想 对构造的树进行层序遍历#include<iostream>#include<algorithm>#include<vector>#include<queue>using namespace std;struct node{int key;int right,left;};node num[100];int keys[100];int now=0;vector <int> a
2020-08-22 15:27:13
57
原创 PAT甲级1098 Insertion or Heap Sort
#include<iostream>#include<algorithm>using namespace std;int n;int num1[10000];int num2[10000];void swap(int i,int j){ int temp; temp=num2[i]; num2[i]=num2[j]; num2[j]=temp;}void heap(int cur,int last){//last指的最后一个索引 if(cur>las
2020-08-22 14:34:27
77
原创 PAT甲级1097 Deduplication on a Linked List
#include<iostream>#include<cstdio>#include<math.h>using namespace std;struct node{ int key; int next;};int main(){ int n; node number[100000]; int cunzai[10001]; int start; cin>>start>>n; int po,k,ne; for(in
2020-08-22 12:49:13
87
原创 PAT甲级1094 The Largest Generation
利用bfs遍历#include<iostream>#include<queue>#include<vector>using namespace std;vector<int>child[111];int maxp=0;int level=0;int people[100]={0};queue<int>id;//queue<int>peoplequeue<int>leve;void bfs(int c
2020-08-20 16:18:06
62
原创 PAT 1093 Count PAT‘s
基本思路,每找到一个A,只需将该A前的P和后面的T数出来,两者相乘得到这个A可以组成的PAT 再加到总数即可#include<iostream>using namespace std;int main(){ string s; cin>>s; long long ppp=0; long long count=0; long long numT=0; for(int i=0;i<s.size();i++){
2020-08-20 15:50:56
69
原创 PAT甲级1091Acute Stroke
#include<iostream>#include<vector>#include<algorithm>#include<queue>using namespace std;int n,m,l,t;int d[1290][190][61];int visited[1290][190][61];struct node{ int x; int y; int z;};int X[6]={0,0,-1,1,0,0};int Y[6]={1
2020-08-20 13:15:48
107
原创 PAT甲级1090 Highest Price in Supply Chain
用DFS#include<iostream>#include<vector>#include<cstdio>#include<queue>using namespace std;vector<int>v[100001];//存放下一层的数据;double maxprice;int count=0;int root;double p,r;void dfs(int cur,double curprice){ if(curpric
2020-08-19 19:02:02
91
原创 PAT甲级1089 Insert or Merge
#include<iostream>#include<algorithm> using namespace std;int a[100],b[100];int c[100];int n;int main(){ cin>>n; int k=0;//0代表插入排序 for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n;i++) cin>>b[i]; int j=0; w
2020-08-19 19:00:16
79
原创 LeetCode每日一题 109. 有序链表转换二叉搜索树
给定一个单链表,其中的元素按升序排序,将其转换为高度平衡的二叉搜索树。本题中,一个高度平衡二叉树是指一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1。示例:给定的有序链表: [-10, -3, 0, 5, 9],一个可能的答案是:[0, -3, 9, -10, null, 5], 它可以表示下面这个高度平衡二叉搜索树: 0 / \-3 9/ /-10 5来源:力扣(LeetCode)链接:https://leetcode-cn.com/problems/con
2020-08-18 15:57:45
112
原创 pat甲级1008 Elevator
#include<iostream>using namespace std;int main(){ int N; int a[100]; cin>>N; int time=N*5; int now=0; for(int i=0;i<N;i++){ cin>>a[i]; if(now<a[i]) time+=6*(a[i]-now); else time+=4*(
2020-08-18 14:52:17
104
原创 PAT甲级1007 Maximum Subsequence Sum
#include<iostream>using namespace std;int main(){int result=-2;int t=0;int m=0;int k;cin>>k;int n[10000];int dp[10000];dp[-1]=-1;for(int i=0;i<k;i++){ cin>>n[i]; if (n[i]>0||n[i]==0) m++ ;}if(m==0){ cout<&l
2020-08-18 14:51:38
61
原创 PAT甲级1006 Sign In and Sign Out
#include<iostream>#include<string>using namespace std;string out_time[100];string in_time[100];string name[100];int main(){ int k; cin>>k; int i=0; while(i<k){ cin>>name[i]; cin>>in_tim
2020-08-18 14:50:25
61
原创 PAT 甲级1005 Spell It Right
#include<iostream>#include<string>using namespace std;int main(){string danci[10]={"zero","one","two","three","four","five","six","seven","eight","nine"}; int c; int sum=0;while(isdigit(c=getchar())){sum+=c-'0';} string tem
2020-08-18 14:49:32
70
原创 PAT甲级 1087 All Roads Lead to Rome
#include<iostream>#include<map>#include<vector>#include<string>#include<limits.h>#include<algorithm>using namespace std;struct city{ string name; int happiness;};struct road{ vector<int>cc;
2020-08-18 13:45:18
93
原创 PAT甲级1003 Emergency
DFS遍历#include<iostream>#include<vector>#include<limits.h>using namespace std;int N,M,C1,C2;int num_of_team[500];int dis[500][500],mindis[500],paths,team;vector<int> v[500];void dfs(int curcity,int curlen,int curteam){ if
2020-08-18 12:34:09
64
原创 PAT甲级1002 A+B for Polynomials
#include<iostream>#include<map>#include<cstdio>using namespace std;int main(){ map<int,double> xishu; int k; cin>>k; while(k--){ int n; double d; cin>>n>>d; xishu
2020-08-18 12:32:21
66
原创 PAT甲级1001 A+B Format
#include<iostream>#include<vector>using namespace std;int main(){ int a,b; cin>>a>>b; int sum=a+b; vector<int> v; if(sum==0){ cout<<0; return 0; } if(sum<0){ cout<<"-"; sum=sum*(-1); } while
2020-08-18 12:31:14
54
原创 pat甲级1086 Tree Traversals Again
#include<iostream>#include<cstdio>#include<stack>using namespace std;struct node{ int key; node*r=NULL; node*l=NULL;};int tt;void houxutravel(node *root){ if(root!=NULL) { houxutravel(root->l); houxutravel(root->r);
2020-08-18 11:52:42
84
原创 PAT甲级 1085 Perfect Sequence
#include<iostream>#include<algorithm>using namespace std;int main(){ int length=0; int n; long long p; cin>>n>>p; long long a[100000]; for(int i=0;i<n;i++) cin>>a[i]; sort(a,a+n); for(int i
2020-08-17 20:50:41
67
原创 PAT甲级1084 Broken Keyboard
#include<set>#include<string>#include<iostream>using namespace std;int main(){string s1,s2; getline(cin,s1); getline(cin,s2); //cin>>s1>>s2; int i=0; int j=0; for(int k=0;k<s1.size();k++){
2020-08-17 20:19:47
114
原创 2020春季PAT甲级做题
1 Prime Day (20分)#include<iostream>#include<string>using namespace std;bool isprime(int k){ if(k==1||k==0) return false; if(k==2) return true; for(int i=2;i*i<=k;i++){ if(k%i==0){ return false; break; } } return true;
2020-08-17 20:17:22
123
原创 PAT甲级 1076
标题这里写自定义目录标题标题欢迎使用Markdown编辑器新的改变功能快捷键合理的创建标题,有助于目录的生成如何改变文本的样式插入链接与图片如何插入一段漂亮的代码片生成一个适合你的列表创建一个表格设定内容居中、居左、居右SmartyPants创建一个自定义列表如何创建一个注脚注释也是必不可少的KaTeX数学公式新的甘特图功能,丰富你的文章UML 图表FLowchart流程图导出与导入导出导入欢迎使用Markdown编辑器你好! 这是你第一次使用 Markdown编辑器 所展示的欢迎页。如果你想学习如何
2020-08-17 18:36:46
83
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人