<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[VigorQQ的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/VigorQQ</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; VigorQQ]]></copyright><item><title><![CDATA[leetcode-29-divide two integer]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/82020163</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/82020163</guid><author>VigorQQ</author><pubDate>Fri, 24 Aug 2018 15:53:05 +0800</pubDate><description><![CDATA[
class Solution {
public:
    int divide(int dividend, int divisor) {
        bool flag = (dividend&amp;lt;0 &amp;amp;&amp;amp; divisor&amp;gt;0) || (dividend&amp;gt;0 &amp;amp;&amp;amp; divisor&amp;lt;0);
        long long tmp1 = a...]]></description><category></category></item><item><title><![CDATA[leetcode-24-swap nodes in pairs]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/82016124</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/82016124</guid><author>VigorQQ</author><pubDate>Fri, 24 Aug 2018 12:40:16 +0800</pubDate><description><![CDATA[
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* s...]]></description><category></category></item><item><title><![CDATA[leetcode-22-generate parantheses]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/82014635</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/82014635</guid><author>VigorQQ</author><pubDate>Fri, 24 Aug 2018 11:10:18 +0800</pubDate><description><![CDATA[
class Solution {
public:
    vector&amp;lt;string&amp;gt; generateParenthesis(int n) {
        vector&amp;lt;string&amp;gt; result;
        searchDfs(n, n, &quot;&quot;, result);
        return result;
    }
    
    void sea...]]></description><category></category></item><item><title><![CDATA[leetcode-19-remove Nth node from end of list]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/82012659</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/82012659</guid><author>VigorQQ</author><pubDate>Fri, 24 Aug 2018 10:08:19 +0800</pubDate><description><![CDATA[
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* r...]]></description><category></category></item><item><title><![CDATA[leetcode-18-4sum]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81984218</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81984218</guid><author>VigorQQ</author><pubDate>Thu, 23 Aug 2018 17:01:10 +0800</pubDate><description><![CDATA[
class Solution {
public:
    vector&amp;lt;vector&amp;lt;int&amp;gt;&amp;gt; fourSum(vector&amp;lt;int&amp;gt;&amp;amp; nums, int target) {
        if(nums.size() &amp;lt; 4){
            return {};
        }
        vector&amp;lt;vect...]]></description><category></category></item><item><title><![CDATA[leetcode-17-combinations of a phone number]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81977533</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81977533</guid><author>VigorQQ</author><pubDate>Thu, 23 Aug 2018 11:16:29 +0800</pubDate><description><![CDATA[
class Solution {
public:
    vector&amp;lt;string&amp;gt; letterCombinations(string digits) {

        vector&amp;lt;string&amp;gt; ans;
        if(digits.size() == 0)
            return ans;

        int depth = di...]]></description><category></category></item><item><title><![CDATA[leetcode-16-3sum closest]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81949973</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81949973</guid><author>VigorQQ</author><pubDate>Wed, 22 Aug 2018 19:51:55 +0800</pubDate><description><![CDATA[
class Solution {
public:
    vector&amp;lt;vector&amp;lt;int&amp;gt;&amp;gt; threeSum(vector&amp;lt;int&amp;gt;&amp;amp; nums) {
        if(nums.size() &amp;lt; 3){
            return {};
        }
        vector&amp;lt;vector&amp;lt;int&amp;g...]]></description><category></category></item><item><title><![CDATA[leetcode-15-3sum]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81947753</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81947753</guid><author>VigorQQ</author><pubDate>Wed, 22 Aug 2018 17:20:07 +0800</pubDate><description><![CDATA[
class Solution {
public:
    vector&amp;lt;vector&amp;lt;int&amp;gt;&amp;gt; threeSum(vector&amp;lt;int&amp;gt;&amp;amp; nums) {
        if(nums.size() &amp;lt; 3){
            return {};
        }
        vector&amp;lt;vector&amp;lt;int&amp;g...]]></description><category></category></item><item><title><![CDATA[leetcode-12-integer to roman]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81944596</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81944596</guid><author>VigorQQ</author><pubDate>Wed, 22 Aug 2018 15:12:55 +0800</pubDate><description><![CDATA[
class Solution {
public:
    string intToRoman(int num) {
        string result = &quot;&quot;;
        vector&amp;lt;int&amp;gt; val{1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
        vector&amp;lt;string&amp;gt;...]]></description><category></category></item><item><title><![CDATA[leetcode-11-container with most water]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81944414</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81944414</guid><author>VigorQQ</author><pubDate>Wed, 22 Aug 2018 15:04:51 +0800</pubDate><description><![CDATA[
class Solution {
public:
    int maxArea(vector&amp;lt;int&amp;gt;&amp;amp; height) {
        int i = 0;
        int j = height.size()-1;
        int result = 0;
        while(i &amp;lt; j){
            result = max...]]></description><category></category></item><item><title><![CDATA[leetcode-8-string to integer(atoi)]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81940497</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81940497</guid><author>VigorQQ</author><pubDate>Wed, 22 Aug 2018 11:08:05 +0800</pubDate><description><![CDATA[
class Solution {
public:
    int myAtoi(string str) {
        
        int len = str.size();
        long long result = 0;
        int index;
        bool flag = false;
        for(int i=0; i&amp;lt;len;...]]></description><category></category></item><item><title><![CDATA[leetcode-6-zigzag conversion]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81938639</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81938639</guid><author>VigorQQ</author><pubDate>Wed, 22 Aug 2018 09:56:53 +0800</pubDate><description><![CDATA[
class Solution {
public:
    string convert(string s, int numRows) {
        
        if(s.size() == 1 || numRows == 1){
            return s;
        }
        
        int len = s.size();
        i...]]></description><category></category></item><item><title><![CDATA[leetcode-191-number of 1 bits]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81937796</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81937796</guid><author>VigorQQ</author><pubDate>Wed, 22 Aug 2018 09:05:53 +0800</pubDate><description><![CDATA[
class Solution {
public:
    int hammingWeight(uint32_t n) {
        int result = 0;
        
        for(int i=0; i&amp;lt;32; i++){
            if(n == 0){
                break;
            }
        ...]]></description><category></category></item><item><title><![CDATA[leetcode-190-reverse bits]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81937656</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81937656</guid><author>VigorQQ</author><pubDate>Wed, 22 Aug 2018 08:54:10 +0800</pubDate><description><![CDATA[
class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        uint32_t result = 0;
        
        for(int i=0; i&amp;lt;32; i++){
            if(n &amp;amp; 1 == 1){
                result = (res...]]></description><category></category></item><item><title><![CDATA[leetcode-189-rotate array]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81937532</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81937532</guid><author>VigorQQ</author><pubDate>Wed, 22 Aug 2018 08:42:16 +0800</pubDate><description><![CDATA[
class Solution {
public:
    void rotate(vector&amp;lt;int&amp;gt;&amp;amp; nums, int k) {
        if( nums.empty() || (k %= nums.size()) == 0){
            return;
        }
        
        int n = nums.size()...]]></description><category></category></item><item><title><![CDATA[leetcode-172-Factorial Trailing Zeroes]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81270825</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81270825</guid><author>VigorQQ</author><pubDate>Sun, 29 Jul 2018 14:17:31 +0800</pubDate><description><![CDATA[
class Solution {
public:
    int trailingZeroes(int n) {
        int i = 1;
        int result = 0;
        while(pow(5,i)&amp;lt;=n){
            result += (n / pow(5,i));
            i++;
        }
   ...]]></description><category></category></item><item><title><![CDATA[leetcode-171-excel sheet column number]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81270728</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81270728</guid><author>VigorQQ</author><pubDate>Sun, 29 Jul 2018 14:04:04 +0800</pubDate><description><![CDATA[
class Solution {
public:
    int titleToNumber(string s) {
        int len = s.size();
        char single = 64;
        int p;
        int sum=0;
        for(int i=len-1;i&amp;gt;=0;i--){
            p ...]]></description><category></category></item><item><title><![CDATA[leetcode-169-majority element]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81270639</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81270639</guid><author>VigorQQ</author><pubDate>Sun, 29 Jul 2018 13:53:35 +0800</pubDate><description><![CDATA[
class Solution {
public:
    int majorityElement(vector&amp;lt;int&amp;gt;&amp;amp; nums) {
        int len = nums.size();
        map&amp;lt;int,int&amp;gt; result;
        for(int i=0;i&amp;lt;len;i++){
            result...]]></description><category></category></item><item><title><![CDATA[leetcode-168-excel sheet column title]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81269278</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81269278</guid><author>VigorQQ</author><pubDate>Sun, 29 Jul 2018 11:19:39 +0800</pubDate><description><![CDATA[
class Solution {
public:
    string convertToTitle(int n) {
        string result = &quot;&quot;;
        while(n)
        {
            result = (char)((n-1)%26+'A') + result;
            n = (n-1)/26;
      ...]]></description><category></category></item><item><title><![CDATA[leetcode-167-two sum II- input array is sorted]]></title><link>https://blog.youkuaiyun.com/VigorQQ/article/details/81268758</link><guid>https://blog.youkuaiyun.com/VigorQQ/article/details/81268758</guid><author>VigorQQ</author><pubDate>Sun, 29 Jul 2018 10:42:48 +0800</pubDate><description><![CDATA[
class Solution {
public:
    vector&amp;lt;int&amp;gt; twoSum(vector&amp;lt;int&amp;gt;&amp;amp; numbers, int target) {
        int len = numbers.size();
        vector&amp;lt;int&amp;gt; result={};
        int i = 0, j = len-1...]]></description><category></category></item></channel></rss>