摘要:
//解法一:非递归版,最常见的一种二分查找算法 class Solution { public: int search(vector<int>& nums, int target) { int ret=-1; int begin=0; int end=nums.size()-1; while(beg 阅读全文
posted @ 2019-12-23 19:47
repinkply
阅读(8)
评论(0)
推荐(0)
摘要:
//解法一:递归版算法 /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), l 阅读全文
posted @ 2019-12-23 12:52
repinkply
阅读(6)
评论(0)
推荐(0)
摘要:
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), r 阅读全文
posted @ 2019-12-23 11:38
repinkply
阅读(6)
评论(0)
推荐(0)

浙公网安备 33010602011771号