<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sumIv1210的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sumIv1210</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sumIv1210]]></copyright><item><title><![CDATA[Set Matrix Zeros]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/78909251</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/78909251</guid><author>sumIv1210</author><pubDate>Wed, 27 Dec 2017 10:17:43 +0800</pubDate><description><![CDATA[class Solution {
public:
    void setZeroes(vector>& matrix) {
        int rowSize = matrix.size();
        int colSize = matrix[0].size();
        int col = 1;
        for (int i = 0; i]]></description><category></category></item><item><title><![CDATA[RAII 的妙用]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/78316093</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/78316093</guid><author>sumIv1210</author><pubDate>Mon, 23 Oct 2017 10:22:10 +0800</pubDate><description><![CDATA[RAII 就是为了防止 e.g 1) malloc 忘了 delete 2) open 忘了 close 3) acquire lock忘了 release
good link 
https://www.tomdalling.com/blog/software-design/resource-acquisition-is-initialisation-raii-explained/
http]]></description><category></category></item><item><title><![CDATA[Sort algorithm]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/78257680</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/78257680</guid><author>sumIv1210</author><pubDate>Tue, 17 Oct 2017 10:32:41 +0800</pubDate><description><![CDATA[Merge Sort / Insertion Sort/ bubble sort/ selection sort
#include 

using namespace std;

int CUTOFF = 7;
int arrAux[7];
void swap(int *xp, int *yp)
{
    int temp = *xp;
    *xp = *yp;
    *yp = tem]]></description><category></category></item><item><title><![CDATA[Hash Map / Hash Set]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/78202373</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/78202373</guid><author>sumIv1210</author><pubDate>Wed, 11 Oct 2017 12:33:02 +0800</pubDate><description><![CDATA[Two sum


Majority number]]></description><category></category></item><item><title><![CDATA[XOR usage]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/78154393</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/78154393</guid><author>sumIv1210</author><pubDate>Tue, 03 Oct 2017 12:42:27 +0800</pubDate><description><![CDATA[1. single number
https://leetcode.com/problems/single-number/description/



2. swap value]]></description><category></category></item><item><title><![CDATA[stack usage]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/78154122</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/78154122</guid><author>sumIv1210</author><pubDate>Tue, 03 Oct 2017 11:26:08 +0800</pubDate><description><![CDATA[1. Valid Parentheses
class Solution {
public:
    bool isValid(string s) {
        stack  st;
        for (char c : s)
        {
            switch (c)
            {
                case '(':
       ]]></description><category></category></item><item><title><![CDATA[Range based  for loop]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/78154027</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/78154027</guid><author>sumIv1210</author><pubDate>Tue, 03 Oct 2017 11:07:47 +0800</pubDate><description><![CDATA[Range-based for loop is better for container .
Strings, arrays,
 and all STL containers can be iterated over with the new range-based
 for loop already
https://www.cprogramming.com/c++11/c++11-ran]]></description><category></category></item><item><title><![CDATA[Max subarray]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/78153806</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/78153806</guid><author>sumIv1210</author><pubDate>Tue, 03 Oct 2017 10:25:44 +0800</pubDate><description><![CDATA[Good reference 
http://www.geeksforgeeks.org/largest-sum-contiguous-subarray/]]></description><category></category></item><item><title><![CDATA[stack-structured algorithm and queue-structured algorithm]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/78150392</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/78150392</guid><author>sumIv1210</author><pubDate>Mon, 02 Oct 2017 11:35:56 +0800</pubDate><description><![CDATA[https://www.ics.uci.edu/~eppstein/161/960215.html


http://www.egr.unlv.edu/~larmore/Courses/CSC477/bfsDfs.pdf]]></description><category></category></item><item><title><![CDATA[Merge two sorted linked list]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/78150383</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/78150383</guid><author>sumIv1210</author><pubDate>Mon, 02 Oct 2017 11:33:49 +0800</pubDate><description><![CDATA[method 1 dummy node
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
pub]]></description><category></category></item><item><title><![CDATA[2 sum]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/78149759</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/78149759</guid><author>sumIv1210</author><pubDate>Mon, 02 Oct 2017 08:17:28 +0800</pubDate><description><![CDATA[method 2. O(n2)的方法
class Solution {
public:
    vector twoSum(vector& nums, int target) {
        vector result;
        for (int i = 0; i < nums.size(); ++i)
        {
            for (int j = i+1;]]></description><category></category></item><item><title><![CDATA[Invert Binary (recursive and iterative)]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/51422255</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/51422255</guid><author>sumIv1210</author><pubDate>Mon, 16 May 2016 08:55:01 +0800</pubDate><description><![CDATA[两种做饭 递归相对好做
1. recursive
class Solution {
public:
    void swap(TreeNode** left, TreeNode** right)
    {
        TreeNode* temp = (*left);
        *left = *right;
        *right = temp;
    }
    Tr]]></description><category></category></item><item><title><![CDATA[Tree Traverse]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/51421677</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/51421677</guid><author>sumIv1210</author><pubDate>Mon, 16 May 2016 08:18:27 +0800</pubDate><description><![CDATA[Pre-Order tree Traverse.
1.中左右
两种方法
1. Recurisveclass Solution {
public:
    vector result;
    vector preorderTraversal(TreeNode* root) {
        if (root == nullptr)
            return result;]]></description><category></category></item><item><title><![CDATA[remove duplicate from sort array 2]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/51176915</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/51176915</guid><author>sumIv1210</author><pubDate>Mon, 18 Apr 2016 06:09:36 +0800</pubDate><description><![CDATA[这个貌似复杂了点
丑陋的代码
class Solution {
public:
    int removeDuplicates(vector& nums) {
        if (nums.size() < 3)
        {
            return nums.size();
        }
        int c = 0;
        int i = 1]]></description><category></category></item><item><title><![CDATA[Remove the duplicates from sorted array]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/51176883</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/51176883</guid><author>sumIv1210</author><pubDate>Mon, 18 Apr 2016 04:42:21 +0800</pubDate><description><![CDATA[其实这个题目有一个关键就是sorted array 
如果不是sorted的话 可以用array index bit的类似方法解决这个问题
Remove duplicates from sorted array 1
1. Do not allocate extra space for another array, you must do this in place with constant]]></description><category></category></item><item><title><![CDATA[Reverse Bit]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/50903767</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/50903767</guid><author>sumIv1210</author><pubDate>Wed, 16 Mar 2016 12:04:20 +0800</pubDate><description><![CDATA[这题很简单但是老是没过 因为 运算符优先级搞错
要有括号 
class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        if (n == 0)
            return 0;
        uint32_t bit;
        uint32_t result = 0;
        uin]]></description><category></category></item><item><title><![CDATA[Reorder Linked List]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/50882396</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/50882396</guid><author>sumIv1210</author><pubDate>Mon, 14 Mar 2016 03:30:50 +0800</pubDate><description><![CDATA[方法1 一次AC了
class Solution {
public:
    void reorderList(ListNode* head) {
        if (head == NULL || head->next == NULL || head->next->next == NULL)
        {
            return;
        }
        L]]></description><category></category></item><item><title><![CDATA[Palindrome 系列]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/50873569</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/50873569</guid><author>sumIv1210</author><pubDate>Sun, 13 Mar 2016 05:31:07 +0800</pubDate><description><![CDATA[1. Palindrome linked list
这个解法很不错呀 利用了reverse linked list的方法 + 两个指针

class Solution {
public:
    ListNode* reverse(ListNode* node)
    {
        ListNode* prev = NULL;
        while (node != NULL)]]></description><category></category></item><item><title><![CDATA[Remove Linked List Elements]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/50834616</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/50834616</guid><author>sumIv1210</author><pubDate>Wed, 09 Mar 2016 13:30:17 +0800</pubDate><description><![CDATA[dummy node的妙用
1.切记 用了dummy node以后 要head 从dummy开始，把他们连接起来
ListNode* dummy = new ListNode(0);
dummy->next  = head;
head = dummy;2. 用temp然后delete temp 完成删除
class Solution {
public:
    ListNode* remov]]></description><category></category></item><item><title><![CDATA[Odd even Linked list]]></title><link>https://blog.youkuaiyun.com/sumIv1210/article/details/50834345</link><guid>https://blog.youkuaiyun.com/sumIv1210/article/details/50834345</guid><author>sumIv1210</author><pubDate>Wed, 09 Mar 2016 13:23:50 +0800</pubDate><description><![CDATA[第一次出现了两次错误
class Solution {
public:
    ListNode* oddEvenList(ListNode* head) {
        bool flag = false;
        if (head == NULL || head->next == NULL)
        {
            return head;
        }]]></description><category></category></item></channel></rss>