摘要：
class Solution { public: TreeNode* constructMaximumBinaryTree(vector& nums) { if (nums.size() == 0) return NULL; else if (nums.size() == 1) ... 阅读全文
posted @ 2018-10-07 23:42
Sempron2800+
阅读(106)
评论(0)
推荐(0)
摘要：
class Solution { public: int maxIncreaseKeepingSkyline(vector>& grid) { //找出每一行的最大值 const int N = 50; int ROW_HEIGHT[N]; int COL_HEIGHT[N]; int MIX_HEIGHT[... 阅读全文
posted @ 2018-10-07 23:29
Sempron2800+
阅读(94)
评论(0)
推荐(0)
摘要：
class Solution { public: string reverseOnlyLetters(string S) { int len = S.length(); queue Q; stack ST; vector V; for (int i = 0; i = 97 && c = 65 && c <= ... 阅读全文
posted @ 2018-10-07 21:08
Sempron2800+
阅读(119)
评论(0)
推荐(0)
摘要：
这问题很不好。。。 阅读全文
posted @ 2018-10-07 17:17
Sempron2800+
阅读(81)
评论(0)
推荐(0)
浙公网安备 33010602011771号