我是编程领域的新手(很高兴能成为其中的一员)。我相信我想要做的很简单,但是我找不到很多关于棋子文件编程的东西不是针对SA-MP的。我有一个'.p‘文件,它用来检查一个数组的夹心数和限定符数字数组。据我所知,我可以通过我的代码传递一个数组来检查它是否匹配。下面是我的数组:
+ new spec_bacon_plus[] = { 30500, 30100, 30400, 33100, 30300 }
+ new correct_spec_bacon_qual[] = { 9094400, 9013400, 9013400, 9093400, 9094400 }
+ new all_bacon_plus[] = {
9093400, /* add(1) bacon */
9013400, /* add(2) bacon */
9094400, /* add(3) bacon */
9095400, /* add(4) bacon */
9096400, /* add(6) bacon */
9097400, /* add(8) bacon */
}我的代码如下。我正在尝试检查是否发生了spec_bacon_plus,如果发生了,我的all_bacon_plus是否发生了?如果spec_bacon_plus中的数字与correct_spec_bacon_qual中的数字不一致,则显示错误。我相信,由于他们的立场,他们是相互“联系”的。(例如,30500是9094400,30100是9013400,30400是9013400,依此类推)。
for(k = 0; k < sizeof spec_bacon_plus; k++) {
if(p_plu == spec_bacon_plus[k]) { /* the sandwich we rung up is the kth bacon sandwich */
for(m = 0; m < sizeof all_bacon_plus; m++) { /* check if the qualifer was any of the bacons */
if (p_qualifier == correct_spec_bacon_qual[m] && k != m ) /* && not in the slot that we expect */
ok = 0; /*not cool*/
pos_popup_dialog("THIS BACON IS NOT OK!");
ok = 1;
check_spec_bacon_plu = p_plu;
check_spec_bacon_qual = p_qualifier;
check_spec_bacon_qual_should_be = correct_spec_bacon_qual[k];有什么想法吗?
发布于 2013-03-20 04:30:20
我想通了..。
for(k = 0; k < sizeof spec_bacon_plus; k++) {
if(p_plu == spec_bacon_plus[k]) { /* the sandwich we rung up is the kth bacon sandwich */
for(m = 0; m < sizeof all_bacon_plus; m++) { /* check if the qualifer was any of the bacons */
if (p_qualifier == all_bacon_plus[m]) /* && not in the slot that we expect */
for(l = 0; l < sizeof correct_spec_bacon_qual; l++) {
if (p_qualifier == correct_spec_bacon_qual[k])
pos_popup_dialog("THIS BACON IS OK!");
else pos_popup_dialog("THIS BACON NOT IS OK!");https://stackoverflow.com/questions/15480696
复制相似问题