算法
AWeakShark
no problem
展开
-
Jump Game(C++)
class Solution { public: bool isJumpable = false; bool canJump(vector<int>& nums) { int distance = 0; for(vector<int>::iterator it = nums.end() - 1 ; it >= nums.begin(); it--,distance++){原创 2020-12-01 10:47:50 · 258 阅读 · 0 评论 -
二叉树层次遍历(C++)
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} *原创 2020-11-30 13:34:27 · 351 阅读 · 0 评论