2024-10-09 【PTA】【乙级】【题解4】

center = loc_t - loc_p - 1;

right = len - loc_t - 1;

if(left * center == right) {

printf(“YES\n”);

} else {

printf(“NO\n”);

}

}

return 0;

}

1007素数对猜想

---

#include <bits/stdc++.h>

using namespace std;

//1007 素数对猜想

const int maxn = 100010;

bool judge[maxn]; //判断是否为合数

int pri[maxn], cnt = 0,ans=0;

void getprime(int n)

{

for (int i = 2; i <= n; i++)

{

if (!judge[i])

pri[cnt++] = i;

for (int j = 0; j < cnt; j++)

{

if (i * pri[j] > n)

break;

judge[i * pri[j]] = 1; //标记合数

if (i % pri[j] == 0)

break;

}

}

}

int main()

{

int n;

cin >> n;

getprime(100005);

for (int i = 1;pri[i]<=n; i++)

{

if (pri[i] - pri[i - 1] == 2)

ans++;

}

cout << ans;

return 0;

}

1008 数组元素循环右移问题 (20 分)

---

#include<bits/stdc++.h>

using namespace std;

//1008 数组元素循环右移问题 (20 分)

int main(){

ios::sync_with_stdio(0);

int n, m;

int a[105],b[105];

cin >> n >> m;

for (int i = 0; i < n;i++){

cin >> a[i];

}

m %= n;

int k = 0;

for (int i = n-m; i < n;i++){

b[k++] = a[i];

}

for (int i = 0; i < n - m;i++){

b[k++] = a[i];

}

for (int i = 0; i < n;i++){

if(i==n-1)

cout << b[i];

else

cout << b[i] << " ";

}

return 0;

}

1009 说反话 (20 分)

---

#include<bits/stdc++.h>

using namespace std;

//1009 说反话 (20 分)

int main(){

vector s;

string a;

while(cin>>a){

s.push_back(a);

}

for (int i = s.size() - 1;i>=0; i–)

{

if(i!=0)

cout << s[i] << " ";

else

cout << s[i];

}

return 0;

}

1010 一元多项式求导 (25 分)

---

#include<bits/stdc++.h>

using namespace std;

//1010 一元多项式求导 (25 分)

int main(){

ios::sync_with_stdio(0);

int a, b;

vector<pair<int, int>> s;

int flag = 0;

while(cin>>a>>b){

if(b!=0){

a = a * b;

b -= 1;

s.push_back({a, b});

flag = 1;

一线互联网大厂Java核心面试题库

![image](https://up

必看视频！获取2024年最新Java开发全套学习资料 备注Java

load-images.jianshu.io/upload_images/24613101-71f045bc119646a2.png?imageMogr2/auto-orient/strip%7CimageView2/2/w/1240)

正逢面试跳槽季，给大家整理了大厂问到的一些面试真题，由于文章长度限制，只给大家展示了部分题目，更多Java基础、异常、集合、并发编程、JVM、Spring全家桶、MyBatis、Redis、数据库、中间件MQ、Dubbo、Linux、Tomcat、ZooKeeper、Netty等等已整理上传，感兴趣的朋友可以看看支持一波！