Count the number of equal elements in two-dimensional arrays & traverse the two-dimensional matrix

Count the number of equal elements in two arrays (one-dimensional linear method is required)

1. IntArray_count (Int* Array1,Int* Array2)
2. {
3. IntI = 0, j = 0, Count = 0;
4. While(I <num1 & J <num2)
5. {
6. If(Array1 [I] <array2 [J])
7. I ++;
8. Else If(Array1 [I]> array2 [J])
9. J ++;
10. Else
11. {
12. I ++;
13. J ++;
14. Count ++;
15. }
16. }
17. ReturnCount;
18. }

Search and traverse the output two-dimensional array as shown in.

1. # Include <stdio. h>
3. Int m_print (INT ** data, int N)
4. {
5. Int I = 0, j = 0;
6. // Indicates the exploration sign in the lower left. If the value is 0, the exploration is performed in the upper right corner.
7. Int downleft = 1;
8. // Count is used for loop exit
9. Int num = 0;
10. // Number of array elements
11. Int loop = N * n-1;
12. // Parity mark of n, where 0 is an even number and 1 is an odd number
13. Int even = n % 2;
15. // Print the first element
16. Printf ("% d", * (int *) (data) + I * n + j ));
18. While (1)
19. {
20. // Located at the upper boundary. (J! = N-1 |! Even) is used to process the special situations of the upper-right elements based on the parity of N.
21. If (I = 0 & (J! = N-1 |! Even ))
22. {
23. // Explore to the right
24. J ++;
25. // Output Element
26. Printf ("% d", * (int *) (data) + I * n + j ));
27. // Exit the loop after the output is complete.
28. If (++ num> = loop) break;
29. // Set it to lower left to explore
30. Downleft = 1;
31. }
32. // At the bottom boundary
33. If (I = n-1)
34. {
35. // Explore to the right
36. J ++;
37. // Output Element
38. Printf ("% d", * (int *) (data) + I * n + j ));
39. If (++ num> = loop) break;
40. // Set it to exploration in the upper right corner
41. Downleft = 0;
42. }
43. // At the left boundary
44. If (j = 0)
45. {
46. // Explore down
47. I ++;
48. // Output Element
49. Printf ("% d", * (int *) (data) + I * n + j ));
50. If (++ num> = loop) break;
51. // Set it to exploration in the upper right corner
52. Downleft = 0;
53. }
54. // On the right boundary
55. If (j = n-1 & (I! = 0 | even ))
56. {
57. // Explore down
58. I ++;
59. // Output Element
60. Printf ("% d", * (int *) (data) + I * n + j ));
61. // Exit the loop after the output is complete.
62. If (++ num> = loop) break;
63. // Set it to lower left to explore
64. Downleft = 1;
65. }
66. // Explore at the bottom left
67. If (downleft)
68. {
69. I ++;
70. J --;
71. }
72. // Explore in the upper-right corner
73. Else
74. {
75. I --;
76. J ++;
77. }
78. // Output Element
79. Printf ("% d", * (int *) (data) + I * n + j ));
80. // Exit the loop after the output is complete.
81. If (++ num> = loop) break;
82. }
83. Return 0;
84. }
86. Int data2 [2] [2] =
87. {
88. {1, 2 },
89. {3, 4}
90. };
92. Int data3 [3] [3] =
93. {
94. {1, 2, 6 },
95. {3, 5, 7 },
96. {4, 8, 9}
97. };
99. Int data4 [4] [4] =
100. {
101. {1, 2, 6, 7 },
102. {3, 5, 8, 13 },
103. {4, 9, 12, 14 },
104. {10, 11, 15, 16}
105. };
107. Int data5 [5] [5] =
108. {
109. {1, 2, 6, 7, 15 },
110. {3, 5, 8, 14,16 },
111. {4, 9, 13, 17, 22 },
112. {10, 12, 18, 21, 23 },
113. {11,19, 20,24, 25}
114. };
116. Int data6 [6] [6] =
117. {
118. {1, 2, 6, 7, 15, 16 },
119. {3, 5, 8, 14,17, 26 },
120. {4, 9, 13, 18, 25, 27 },
121. },
122. },
123. {, 31}
124. };
126. Int main ()
127. {
128. M_print (INT **) data2, 2 );
129. Printf ("/N ");
130. M_print (INT **) data3, 3 );
131. Printf ("/N ");
132. M_print (INT **) data4, 4 );
133. Printf ("/N ");
134. M_print (INT **) data5, 5 );
135. Printf ("/N ");
136. M_print (INT **) data6, 6 );
137. Printf ("/N ");
138. Return 0;
139. }