LeetCode:419. Battleships in a Board
今天還想再刷一道題，作算法題好像心都靜下來了！算法 Given an 2D board, count how many battleships are in it. The battleships are represented with 'X's, empty slots are represented with'.'s. You may assume the following rules:
相關文章
- 1. 419. Battleships in a Board
- 2. [Swift]LeetCode419. 甲板上的戰艦 | Battleships in a Board
- 3. [LeetCode] 419. Battleships in a Board
- 4. LeetCode——419. Battleships in a Board
- 5. 【leetcode】419.Battleships in a Board
- 6. Leetcode題解：419. Battleships in a Board
- 7. 計算戰艦的個數 Battleships in a Board
- 8. STM32 Tutorial: #1 Buy a board
- 9. Leetcode 512, Mouse in a maze
- 10. Board
- 更多相關文章...
- • SQL IN 操作符 - SQL 教程
- • Swift for-in 循環 - Swift 教程
- • Kotlin學習（一）基本語法
- • C# 中 foreach 遍歷的用法
相關標籤/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
最新文章
歡迎關注本站公眾號,獲取更多信息
相關文章
- 1. 419. Battleships in a Board
- 2. [Swift]LeetCode419. 甲板上的戰艦 | Battleships in a Board
- 3. [LeetCode] 419. Battleships in a Board
- 4. LeetCode——419. Battleships in a Board
- 5. 【leetcode】419.Battleships in a Board
- 6. Leetcode題解：419. Battleships in a Board
- 7. 計算戰艦的個數 Battleships in a Board
- 8. STM32 Tutorial: #1 Buy a board
- 9. Leetcode 512, Mouse in a maze
- 10. Board