2018年11月
419. Battleships in a Board
摘要： class Solution { public: int countBattleships(vector>& board) { int res = 0; for (int i = 0; i 0 && board[i-1][j] == 'X' || j > 0 && board[i][j-1] == 'X') ... 阅读全文
posted @ 2018-11-27 17:03 JTechRoad 阅读(82) 评论(0) 推荐(0)
779. K-th Symbol in Grammar
摘要： class Solution { public: int kthGrammar(int N, int K) { return helper(N, K, false); } int helper(int n, int k, bool reverse) { if (n == 1) return reverse; int tota... 阅读全文
posted @ 2018-11-27 05:42 JTechRoad 阅读(105) 评论(0) 推荐(0)
783. Minimum Distance Between BST Nodes
摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla... 阅读全文
posted @ 2018-11-27 05:33 JTechRoad 阅读(99) 评论(0) 推荐(0)