<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/xyqcl</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; xyqcl]]></copyright><item><title><![CDATA[LeetCode - 108	Convert Sorted Array to Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/48627187</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/48627187</guid><author>xyqcl</author><pubDate>Mon, 21 Sep 2015 15:35:19 +0800</pubDate><description><![CDATA[class Solution {
public:
    TreeNode *fun(vector &num,int i,int j)
    {
        if(i>j){
            return NULL;
        }
        else{
            int mid=(i+j)/2;
            TreeNode *t=new Tre]]></description><category></category></item><item><title><![CDATA[LeetCode - 98 Validate Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/48526033</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/48526033</guid><author>xyqcl</author><pubDate>Thu, 17 Sep 2015 19:06:12 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool isValidBST(TreeNode* root) {
        if(root==NULL){
            return true;
        }
        vector res=inOrderTraverse(root);
        for(auto it=res.begin();it<r]]></description><category></category></item><item><title><![CDATA[LeetCode - 110	Balanced Binary Tree]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/47735787</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/47735787</guid><author>xyqcl</author><pubDate>Mon, 17 Aug 2015 23:56:01 +0800</pubDate><description><![CDATA[class Solution {
public:
    int depth(TreeNode *p){
        if(p==NULL){
            return 0;
        }
        int a=depth(p->left);
        int b=depth(p->right);
        if(a==-1||b==-1||fabs(a-b]]></description><category></category></item><item><title><![CDATA[LeetCode - 257	Binary Tree Paths]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/47705093</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/47705093</guid><author>xyqcl</author><pubDate>Sun, 16 Aug 2015 19:23:30 +0800</pubDate><description><![CDATA[class Solution {
public:
    string make_path(stack st){
        string s,temp;
        TreeNode *pre=st.top()->left;
        while(!st.empty()){
            TreeNode *cur=st.top();
            if(cur]]></description><category></category></item><item><title><![CDATA[LeetCode - 219	Contains Duplicate II]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/47704155</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/47704155</guid><author>xyqcl</author><pubDate>Sun, 16 Aug 2015 18:01:07 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool containsNearbyDuplicate(vector& nums, int k) {
        map> f;
        for(int i=0;i<nums.size();i++){
            f[nums[i]].push_back(i);
        }
        for(auto]]></description><category></category></item><item><title><![CDATA[LeetCode - 236	Lowest Common Ancestor of a Binary Tree]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/47400635</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/47400635</guid><author>xyqcl</author><pubDate>Mon, 10 Aug 2015 16:32:11 +0800</pubDate><description><![CDATA[class Solution {
public:
    stack postOrderSearch(TreeNode *root,TreeNode *p){
        stack res;
        stacks;
        if(root==NULL){
            return res;
        }
        TreeNode *pre=root;]]></description><category></category></item><item><title><![CDATA[LeetCode - 242	Valid Anagram]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/47394317</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/47394317</guid><author>xyqcl</author><pubDate>Mon, 10 Aug 2015 10:00:00 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool isAnagram(string s, string t) {
        int a[26]{},b[26]{},i;
        if(s.size()!=t.size()){
            return false;
        }
        for(i=0;i<s.size();i++){]]></description><category></category></item><item><title><![CDATA[LeetCode - 118	Pascal's Triangle]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46969741</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46969741</guid><author>xyqcl</author><pubDate>Mon, 20 Jul 2015 16:12:13 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector> generate(int numRows) {
        vector> res;
        for(int i=0;i<numRows;i++){
            vector cur{1};
            if(!i){
                res.push_back(cur);]]></description><category></category></item><item><title><![CDATA[LeetCode - 226	Invert Binary Tree]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46969569</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46969569</guid><author>xyqcl</author><pubDate>Mon, 20 Jul 2015 16:03:33 +0800</pubDate><description><![CDATA[class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        stack s;
        s.push(root);
        while(!s.empty()){
            TreeNode *cur=s.top();
            s.pop();
          ]]></description><category></category></item><item><title><![CDATA[LeetCode - 231 Power of Two]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46962629</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46962629</guid><author>xyqcl</author><pubDate>Mon, 20 Jul 2015 04:19:07 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool isPowerOfTwo(int n) {
        return (n>0)&&(!(n&(n-1)));
    }
};]]></description><category></category></item><item><title><![CDATA[LeetCode - 228	Summary Ranges]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46962593</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46962593</guid><author>xyqcl</author><pubDate>Mon, 20 Jul 2015 04:10:21 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector summaryRanges(vector& nums) {
        vector res;
        if(nums.empty()){
            return res;
        }
        int start=nums[0],end=start;
        for(int i]]></description><category></category></item><item><title><![CDATA[LeetCode - 234	Palindrome Linked List]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46962557</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46962557</guid><author>xyqcl</author><pubDate>Mon, 20 Jul 2015 03:58:54 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool isPalindrome(ListNode* head) {
        int count=0;
        ListNode *p=head;
        while(p!=NULL){
            count++;
            p=p->next;
        }
        in]]></description><category></category></item><item><title><![CDATA[LeetCode - 36 Valid Sudoku]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46962441</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46962441</guid><author>xyqcl</author><pubDate>Mon, 20 Jul 2015 03:22:05 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool isValidSudoku(vector>& board) {
        int i,j,m,n;
        for(i=0;i<9;i++){
            unordered_set s;
            for(j=0;j<9;j++){
                if(board[i][]]></description><category></category></item><item><title><![CDATA[LeetCode - 38 Count and Say]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46961843</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46961843</guid><author>xyqcl</author><pubDate>Mon, 20 Jul 2015 01:55:52 +0800</pubDate><description><![CDATA[class Solution {
public:
    string countAndSay(int n) {
        string res="1";
        while(--n){
            res=say(res);
        }
        return res;
    }
    string say(string s){
        str]]></description><category></category></item><item><title><![CDATA[LeetCode - 223	Rectangle Area]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46960077</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46960077</guid><author>xyqcl</author><pubDate>Sun, 19 Jul 2015 23:37:37 +0800</pubDate><description><![CDATA[class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int x=0,y=0;
        if(A<=E){
            x=min(C-E,G-E);
        }
        else{
      ]]></description><category></category></item><item><title><![CDATA[LeetCode - 235	Lowest Common Ancestor of a Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46959511</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46959511</guid><author>xyqcl</author><pubDate>Sun, 19 Jul 2015 22:50:39 +0800</pubDate><description><![CDATA[class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        TreeNode *cur=root;
        while(1){
            if(p==cur||q==cur){
                re]]></description><category></category></item><item><title><![CDATA[LeetCode - 55 Jump Game]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46959143</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46959143</guid><author>xyqcl</author><pubDate>Sun, 19 Jul 2015 22:24:20 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool canJump(vector& nums) {
        int farest=0;
        for(int i=0;i<nums.size();i++){
            if(i+nums[i]>=nums.size()-1){
                return true;
         ]]></description><category></category></item><item><title><![CDATA[LeetCode - 232	Implement Queue using Stacks]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46958609</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46958609</guid><author>xyqcl</author><pubDate>Sun, 19 Jul 2015 21:40:26 +0800</pubDate><description><![CDATA[class Queue {
public:
    // Push element x to the back of queue.
    void push(int x) {
        s1.push(x);
        reverse(s1,s2);
    }

    // Removes the element from in front of queue.
    void ]]></description><category></category></item><item><title><![CDATA[LeetCode - 155 Min Stack]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46958397</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46958397</guid><author>xyqcl</author><pubDate>Sun, 19 Jul 2015 21:15:03 +0800</pubDate><description><![CDATA[class MinStack {
public:
    void push(int x) {
        if(s.empty()){
            MinS.push(x);
        }
        else{
            MinS.push(min(MinS.top(),x));
        }
        s.push(x);
    }

 ]]></description><category></category></item><item><title><![CDATA[LeetCode - 232	Implement Queue using Stacks]]></title><link>https://blog.youkuaiyun.com/xyqcl/article/details/46957769</link><guid>https://blog.youkuaiyun.com/xyqcl/article/details/46957769</guid><author>xyqcl</author><pubDate>Sun, 19 Jul 2015 20:11:25 +0800</pubDate><description><![CDATA[class Stack {
public:
    // Push element x onto stack.
    void push(int x) {
        q1.push(x);
    }

    // Removes the element on top of the stack.
    void pop() {
        if(!q1.empty()){
    ]]></description><category></category></item></channel></rss>