AviatorJeremy

2018年8月31日 #

[leetcode]79.word search

摘要: class Solution { boolean[][] used; public boolean exist(char[][] board, String word) { used = new boolean[board.length][board[0].length]; for(int i = 0; i = board.length || j ... 阅读全文

posted @ 2018-08-31 17:00 AviatorJeremy 阅读(108) 评论(0) 推荐(0) 编辑

导航