我如何...执行以下问题 [英] How do I...perform following problems

问题描述

一个寻宝游戏，其中有* n网格，我们必须找到该网格的附属网格，有宝藏

解决方案

轻松 - 写一些代码



将您的网格视为（可能）整数的（mxn）矩阵，也许整数的一个值代表单元格中的任何内容，一个值代表宝藏，搜索通过查找代表'宝贝'的所有数字



当你遇到特定问题时回复，除了'请为我做我的工作'

a treasure hunt game where a m*n grid is there and we have to find the adjency grid of that grid having treasure

解决方案

easy - write some code

think about your grid as an (m x n) matrix of (possibly) integers, maybe one value for an integer represents nothing in the cell, one value represents treasure, and searching through that looking for all the numbers that represent 'treasure'

post back when you have a specific issue, other than 'please do my work for me'

这篇关于我如何...执行以下问题的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！