m0_73715432 2023-07-02 13:10 采纳率: 0%
浏览 76
已结题

双网格模型网格重叠处如何用网格坐标找到该位置多个网格的网格id

请问如果同一位置有两套网格,比如热非平衡模型双网格法(dual cell),如何用坐标去搜索两套网格在同一坐标的网格id

  • 写回答

15条回答 默认 最新

  • Watch the clown 2023-07-02 14:58
    关注
    获得4.50元问题酬金

    我通过遍历两个网格来查找与目标坐标匹配的网格id,未找到匹配的网格输出-1。

    img

    
    #include <stdio.h>
    
    #define N 10
    
    int main() {
        int grid1[N][N] = {
            {1, 2, 3, 4, 5, 6, 7, 8, 9, 10},
            {11, 12, 13, 14, 15, 16, 17, 18, 19, 20},
            {21, 22, 23, 24, 25, 26, 27, 28, 29, 30},
            {31, 32, 33, 34, 35, 36, 37, 38, 39, 40},
            {41, 42, 43, 44, 45, 46, 47, 48, 49, 50},
            {51, 52, 53, 54, 55, 56, 57, 58, 59, 60},
            {61, 62, 63, 64, 65, 66, 67, 68, 69, 70},
            {71, 72, 73, 74, 75, 76, 77, 78, 79, 80},
            {81, 82, 83, 84, 85, 86, 87, 88, 89, 90},
            {91, 92, 93, 94, 95, 96, 97, 98, 99, 100}
        };
    
        int grid2[N][N] = {
            {101, 102, 103, 104, 105, 106, 107, 108, 109, 110},
            {111, 112, 113, 114, 115, 116, 117, 118, 119, 120},
            {121, 122, 123, 124, 125, 126, 127, 128, 129, 130},
            {131, 132, 133, 134, 135, 136, 137, 138, 139, 140},
            {141, 142, 143, 144, 145, 146, 147, 148, 149, 150},
            {151, 152, 153, 154, 155, 156, 157, 158, 159, 160},
            {161, 162, 163, 164, 165, 166, 167, 168, 169, 170},
            {171, 172, 173, 174, 175, 176, 177, 178, 179, 180},
            {181, 182, 183, 184, 185, 186, 187, 188, 189, 190},
            {191, 192, 193, 194, 195, 196, 197, 198, 199, 200}
        };
    
        int targetX = 3; 
        int targetY = 4;
    
        int grid1_id = -1; 
        int grid2_id = -1; 
    
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                if (i == targetX && j == targetY) {
                    grid1_id = grid1[i][j];
                    break; 
                }
            }
            if (grid1_id != -1) {
                break;
            }
        }
    
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                if (i == targetX && j == targetY) {
                    grid2_id = grid2[i][j];
                    break; 
                }
            }
            if (grid2_id != -1) {
                break;
            }
        }
    
        printf("Grid1 ID: %d\n", grid1_id);
        printf("Grid2 ID: %d\n", grid2_id);
    
        return 0;
    }
    
    评论

报告相同问题?

问题事件

  • 系统已结题 7月10日
  • 创建了问题 7月2日