提示:文章
文章目录
前言
前期疑问:
本文目标:
一、背景
最近
二、
2.1 HJ83 二维数组操作
#include <stdio.h>
#include "stdbool.h"
#define ARRAY_MAX 9
int row = 0, line = 0;
void printResult(bool flag)
{
if(flag)
{
printf("0\n");
}else {
printf("-1\n");
}
}
bool jundgeArrayIsValid(int row, int line)
{
bool flag = false;
if(row <= 9 && line <= 9)
{
flag = true;
}
printResult(flag);
return flag;
}
bool jundgeExchangeIsValid(int x1, int y1, int x2, int y2)
{
bool flag = false;
if(x1 < row && y1 < line && x2 < row && y2 < line)
{
flag = true;
}
printResult(flag);
return flag;
}
bool jundgeAddRowIsValid(int rowNum)
{
bool flag = false;
if(row + 1 <= ARRAY_MAX)
{
flag = true;
}
printResult(flag);
return flag;
}
bool jundgeAddLineIsValid(int lineNum)
{
bool flag = false;
if(line + 1 <= ARRAY_MAX)
{
flag = true;
}
printResult(flag);
return flag;
}
bool jundgeQueryIsValid(int queryRow, int queryLine)
{
bool flag = false;
if(queryRow < row && queryLine < line)
{
flag = true;
}
printResult(flag);
return flag;
}
int main() {
while (scanf("%d %d", &row, &line) != EOF) { // 注意 while 处理多个 case
// 64 位输出请用 printf("%lld") to
// printf("%d %d\n", row, line);
jundgeArrayIsValid(row, line);
//int array[row][line];
int x1 = 0, y1 = 0, x2 = 0, y2 = 0;
scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
jundgeExchangeIsValid(x1, y1, x2, y2);
int rowNum = 0;
scanf("%d", &rowNum);
jundgeAddRowIsValid(rowNum);
int lineNum = 0;
scanf("%d", &lineNum);
jundgeAddLineIsValid(lineNum);
int queryRow = 0, queryLine = 0;
scanf("%d %d", &queryRow, &queryLine);
jundgeQueryIsValid(queryRow, queryLine);
}
return 0;
}
测试用例
9 8
10 1 8 6
4
5
4 1
6 7
4 5 1 6
2
0
2 2
正确结果
0
-1
-1
0
0
0
0
0
0
0
实际
0
-1
-1
-1
0
0
0
0
0
0
测试用例
5 9
4 4 1 7
3
1
0 7
7 3
2 2 4 0
4
4
6 2
预期输出
0
0
0
-1
0
0
0
0
-1
0
实际输出
0
0
0
-1
0
0
0
0
0
0
测试用例
7 4
2 2 1 0
5
4
7 4
6 6
2 2 1 3
5
2
1 4
正确输出
0
0
0
-1
-1
0
0
0
0
0
实际输出
0
0
0
0
-1
0
0
0
0
0
#include <stdio.h>
#include "stdbool.h"
#define ARRAY_MAX 9
int row = 0, line = 0;
void printResult(bool flag)
{
if(flag)
{
printf("0\n");
}else {
printf("-1\n");
}
}
bool jundgeArrayIsValid(int row, int line)
{
bool flag = false;
if(row <= 9 && line <= 9)
{
flag = true;
}
printResult(flag);
return flag;
}
bool jundgeExchangeIsValid(int x1, int y1, int x2, int y2)
{
bool flag = false;
if(x1 < row && y1 < line && x2 < row && y2 < line)
{
flag = true;
}
printResult(flag);
return flag;
}
bool jundgeAddRowIsValid(int rowNum)
{
bool flag = false;
if(rowNum < row && row + 1 <= ARRAY_MAX)
{
flag = true;
}
printResult(flag);
return flag;
}
bool jundgeAddLineIsValid(int lineNum)
{
bool flag = false;
if(lineNum < line && line + 1 <= ARRAY_MAX)
{
flag = true;
}
printResult(flag);
return flag;
}
bool jundgeQueryIsValid(int queryRow, int queryLine)
{
bool flag = false;
if(queryRow < row && queryLine < line)
{
flag = true;
}
printResult(flag);
return flag;
}
int main() {
while (scanf("%d %d", &row, &line) != EOF) { // 注意 while 处理多个 case
// 64 位输出请用 printf("%lld") to
// printf("%d %d\n", row, line);
jundgeArrayIsValid(row, line);
//int array[row][line];
int x1 = 0, y1 = 0, x2 = 0, y2 = 0;
scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
jundgeExchangeIsValid(x1, y1, x2, y2);
int rowNum = 0;
scanf("%d", &rowNum);
jundgeAddRowIsValid(rowNum);
int lineNum = 0;
scanf("%d", &lineNum);
jundgeAddLineIsValid(lineNum);
int queryRow = 0, queryLine = 0;
scanf("%d %d", &queryRow, &queryLine);
jundgeQueryIsValid(queryRow, queryLine);
}
return 0;
}
前后两段代码对比就是增加了一点细节的限制,比如此文中最后一个测试用例,数组为7行4列,插入一个第四行,题目中表述是第四行不存在,7行4列其实只存在第三列。
总结
未完待续