算法与数据结构
xdzzju
绝知此事要躬行
展开
-
LeetCode 69. Sqrt(x)
方法1:二分法(AC)class Solution { public: int mySqrt(int x) { //二分法 long long l=0,r=x; int count=0; while(l!=r){ long long mid=(l+r)/2;//用long long整型,保证l+r不会溢出原创 2017-04-23 13:58:13 · 205 阅读 · 0 评论 -
LeetCode 101. Symmetric Tree
判断一棵二叉树是否对称的递归和非递归方法原创 2017-04-23 15:34:10 · 185 阅读 · 0 评论 -
LeetCode 107. Binary Tree Level Order Traversal II
层序遍历二叉树 遍历时队列中存储的是指针,方便出队时找到其左右节点。class Solution { public: vector<vector<int>> levelOrderBottom(TreeNode* root) { vector<vector<int>> result; if(!root)return result; stack<原创 2017-04-23 16:15:15 · 195 阅读 · 0 评论 -
LeetCode 80. Remove Duplicates from Sorted Array II
class Solution {public:int removeDuplicates(vector& nums) {map hash;vector result;int i=0;while(i<nums.size()){if(hash.find(nums[i])!=hash.end()){if(hash[nums[i]]<2){hash[nums[i]]++;result.push_back(n原创 2017-04-24 21:44:17 · 153 阅读 · 0 评论