【LeetCode】419. Battleships in a Board 解题报告(Python)
2018-02-28 17:14
519 查看
【LeetCode】419. Battleships in a Board 解题报告(Python)
标签(空格分隔): LeetCode题目地址:https://leetcode.com/problems/battleships-in-a-board/description/
题目描述:
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:You receive a valid board, made of only battleships or empty slots.
Battleships can only be placed horizontally or vertically. In other words, they can only be made of the shape 1xN (1 row, N columns) or Nx1 (N rows, 1 column), where N can be of any size.
At least one horizontal or vertical cell separates between two battleships - there are no adjacent battleships.
Example: X..X ...X ...X In the above board there are 2 battleships. Invalid Example: ...X XXXX ...X This is an invalid board that you will not receive - as battleships will always have a cell separating between them.
Follow up:
Could you do it in one-pass, using only O(1) extra memory and without modifying the value of the board?
题目大意
战列舰计数。第一遍看这个题的时候看不懂,看了别人的解答,我算是明白了,就是求用x组成的区域有几个。单独的一个或者连续的一条线都算一个。另外就是战列舰不会交叉,不会平行。解题方法
方法比较简单,直接数就行。如果一个位置有x,并且(这个位置在最左边或者不在最左边但是该位置左侧是.),并且(这个位置在最上边或者不在最上边但是该位置上侧是.),那么就是一个新的战列舰,计数即可。class Solution(object): def countBattleships(self, board): """ :type board: List[List[str]] :rtype: int """ if len(board) == 0 or len(board[0]) == 0: return 0 row, col = len(board), len(board[0]) count = 0 for i in xrange(row): for j in xrange(col): if board[i][j] == 'X' and (i == 0 or board[i - 1][j] == '.') and (j == 0 or board[i][j - 1] == '.'): count += 1 return count
Date
2018 年 2 月 28 日相关文章推荐
- Leetcode 399 python 解题报告
- 【LeetCode】240. Search a 2D Matrix II 解题报告(Python)
- 景岁的Leetcode解题报告:283. Move Zeroes(Python)
- 【LeetCode】2. Add Two Numbers 解题报告(Python)
- 【LeetCode】598. Range Addition II 解题报告(Python)
- 【LeetCode】783. Minimum Distance Between BST Nodes 解题报告(Python)
- 【LeetCode】451. Sort Characters By Frequency 解题报告(Python)
- 【LeetCode】319. Bulb Switcher 解题报告(Python)
- Leetcode 459 python 解题报告
- 【LeetCode】Group Anagrams 解题报告(Python & Java)
- 【LeetCode】413. Arithmetic Slices 解题报告(Python)
- 景岁的Leetcode解题报告:297. Serialize and Deserialize Binary Tree(Python)
- leetcode 416 python 解题报告
- Leetcode 435 python 解题报告
- Leetcode 529 python 解题报告
- 【LeetCode】526. Beautiful Arrangement 解题报告(Python)
- 【LeetCode】609. Find Duplicate File in System 解题报告(Python)
- 【LeetCode】672. Bulb Switcher II 解题报告(Python)
- [LeetCode] 419. Battleships in a Board 解题报告
- 【LeetCode】384. Shuffle an Array 解题报告(Python)