图
Object_in_java
这个作者很懒,什么都没留下…
展开
-
C语言(邻接矩阵,邻接表实现dfs,bfs)
dfs1.邻接矩阵#include<stdio.h>#include<string.h>#define MVNum 10 //最大顶点数 typedef struct{ char vexs[MVNum]; //顶点表 int arcs[MVNum][MVNum]; //邻接矩阵 int vexnum,arcnum; }AMGraph; int visited[MVNum];void原创 2020-06-08 10:38:28 · 1603 阅读 · 0 评论 -
力扣79(单词搜索)dfs回溯算法 (3)java
class Solution { public boolean exist(char[][] board, String word) { for(int i = 0;i < board.length;i++) for(int j = 0;j < board[0].length;j++) if(dfs(board,word,i,j,0)) return true;原创 2020-10-11 17:26:08 · 97 阅读 · 0 评论 -
力扣79(单词搜索)dfs回溯算法 (2)java
class Solution{private char[] words;private String word;private int n,m;private char[][] board;private int[][] direction ={{0,-1},{1,0},{0,1},{-1,0}};public boolean exist(char[][] board, String word) { this.word = word; words = word.toCharA原创 2020-10-11 16:56:31 · 102 阅读 · 0 评论 -
力扣79(单词搜索)dfs回溯算法 java
// "static void main" must be defined in a public class.class Solution { private char [][] board; private String word; private int [][] direction; private int n,m; private boolean [][] marked; public boolean exist(char[][] bo原创 2020-10-11 16:10:12 · 175 阅读 · 0 评论