c - 在二维数组中查找数字的位置

Question

我有两个数组。数组 A 和数组 B。现在我需要获取数组 B 中数组 A 中的序列所在的位置。我需要获取最后一个号码的位置，但我不知道如何获取。

A[4]={6,3,3,2};

B[10][18]={
{5,3,6,5,6,1,6,1,4,4,5,4,4,6,3,3,1,3},
{6,2,3,6,3,3,2,4,3,1,5,5,3,4,4,1,6,5},
{6,4,3,1,6,2,2,5,3,4,3,2,6,4,5,5,1,4},
{5,3,5,6,6,4,3,2,6,5,1,2,5,6,5,2,3,1},
{1,2,5,2,6,3,1,5,4,6,4,4,4,2,2,2,3,3},
{4,1,4,2,3,2,3,6,4,1,6,2,3,4,4,1,1,4},
{5,3,3,2,6,2,5,2,3,1,2,6,5,1,6,4,1,3},
{4,5,2,1,2,5,2,6,4,3,3,2,3,3,3,1,5,1},
{1,3,5,5,2,1,3,3,3,1,3,3,6,3,3,3,6,5},
{4,5,2,4,2,3,4,2,5,6,5,2,6,3,5,4,5,2}
};

例如:序列 6,3,3,2 从第二行第四列开始，到第七列结束。我需要得到 2 号的位置。我的结果应该是:行 = 2，列= 7

顺序并不总是成行的。它可以在列中。例如:3,2,4,3，我需要知道数字 4 的位置。

我知道如何在一维数组中搜索一个数字，但在这种情况下我没有解决方案。

语言是C。

Answer 1

您可以使用 memcmp 比较 block :

for (i = 0; i < rows; i++) { /* For each row */ 
    for (j = 0; j < cols - size; j++) { /* For each col until cols - 4 */
        if (memcmp(A, &B[i][j], sizeof(A)) == 0) { /* Compare entire block */

---

#include <stdio.h>
#include <string.h>

int main(void)
{
    int A[4] = {6,3,3,2};
    int B[10][18] = {
        {5,3,6,5,6,1,6,1,4,4,5,4,4,6,3,3,1,3},
        {6,2,3,6,3,3,2,4,3,1,5,5,3,4,4,1,6,5},
        {6,4,3,1,6,2,2,5,3,4,3,2,6,4,5,5,1,4},
        {5,3,5,6,6,4,3,2,6,5,1,2,5,6,5,2,3,1},
        {1,2,5,2,6,3,1,5,4,6,4,4,4,2,2,2,3,3},
        {4,1,4,2,3,2,3,6,4,1,6,2,3,4,4,1,1,4},
        {5,3,3,2,6,2,5,2,3,1,2,6,5,1,6,4,1,3},
        {4,5,2,1,2,5,2,6,4,3,3,2,3,3,3,1,5,1},
        {1,3,5,5,2,1,3,3,3,1,3,3,6,3,3,3,6,5},
        {4,5,2,4,2,3,4,2,5,6,5,2,6,3,5,4,5,2}
    };
    size_t i, j, size, rows, cols;
    int founded = 0;

    size = sizeof(A) / sizeof(A[0]);    
    rows = sizeof(B) / sizeof(B[0]);
    cols = sizeof(B[0]) / sizeof(B[0][0]);
    for (i = 0; i < rows; i++) {
        for (j = 0; j < cols - size; j++) {
            if (memcmp(A, &B[i][j], sizeof(A)) == 0) {
                founded = 1;
                break;
            }
        }
        if (founded) break;
    }
    if (founded) printf("Row: %zu Col: %zu\n", i + 1, j + size);
    return 0;
}