<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Polanwind]]></title><description><![CDATA[努力充实自己]]></description><link>https://blog.csdn.net/polanwind</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; polanwind]]></copyright><item><title><![CDATA[Codeforces 57C Array]]></title><link>https://blog.csdn.net/polanwind/article/details/89020099</link><guid>https://blog.csdn.net/polanwind/article/details/89020099</guid><author>polanwind</author><pubDate>Thu, 04 Apr 2019 12:53:56 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;math.h&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;
#define ll long lo...]]></description><category></category></item><item><title><![CDATA[Codeforces 295A Greg and Array]]></title><link>https://blog.csdn.net/polanwind/article/details/89002383</link><guid>https://blog.csdn.net/polanwind/article/details/89002383</guid><author>polanwind</author><pubDate>Wed, 03 Apr 2019 18:45:40 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;math.h&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;

using namespace s...]]></description><category></category></item><item><title><![CDATA[Codeforces 1143A The Doors]]></title><link>https://blog.csdn.net/polanwind/article/details/88962901</link><guid>https://blog.csdn.net/polanwind/article/details/88962901</guid><author>polanwind</author><pubDate>Tue, 02 Apr 2019 09:09:29 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;math.h&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;

using namespace s...]]></description><category></category></item><item><title><![CDATA[Codeforces 931A Friends Meeting]]></title><link>https://blog.csdn.net/polanwind/article/details/88943005</link><guid>https://blog.csdn.net/polanwind/article/details/88943005</guid><author>polanwind</author><pubDate>Mon, 01 Apr 2019 10:35:54 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;math.h&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;

using namespace s...]]></description><category></category></item><item><title><![CDATA[Leetcode 292 Nim Game]]></title><link>https://blog.csdn.net/polanwind/article/details/88942565</link><guid>https://blog.csdn.net/polanwind/article/details/88942565</guid><author>polanwind</author><pubDate>Mon, 01 Apr 2019 10:18:19 +0800</pubDate><description><![CDATA[class Solution {
    public boolean canWinNim(int n) {
       if(n%4==0){
           return false;
       } 
       else{
           return true;
       }
    }
}


]]></description><category></category></item><item><title><![CDATA[Codeforces 976A Minimum Binary Number]]></title><link>https://blog.csdn.net/polanwind/article/details/88932033</link><guid>https://blog.csdn.net/polanwind/article/details/88932033</guid><author>polanwind</author><pubDate>Sun, 31 Mar 2019 17:29:52 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;math.h&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;

using namespace s...]]></description><category></category></item><item><title><![CDATA[Leetcode 389 Find the Difference]]></title><link>https://blog.csdn.net/polanwind/article/details/88931833</link><guid>https://blog.csdn.net/polanwind/article/details/88931833</guid><author>polanwind</author><pubDate>Sun, 31 Mar 2019 17:19:45 +0800</pubDate><description><![CDATA[class Solution {
    public char findTheDifference(String s, String t) {
        char[] ch1 = s.toCharArray();
        char[] ch2 = t.toCharArray();
        int cnt1=0;
        int cnt2=0;
        fo...]]></description><category></category></item><item><title><![CDATA[Codeforces 1028A Find Square]]></title><link>https://blog.csdn.net/polanwind/article/details/88913487</link><guid>https://blog.csdn.net/polanwind/article/details/88913487</guid><author>polanwind</author><pubDate>Sat, 30 Mar 2019 15:40:01 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;math.h&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;

using namespace s...]]></description><category></category></item><item><title><![CDATA[Leetcode 590 N-ary Tree Postorder Traversal]]></title><link>https://blog.csdn.net/polanwind/article/details/88912623</link><guid>https://blog.csdn.net/polanwind/article/details/88912623</guid><author>polanwind</author><pubDate>Sat, 30 Mar 2019 14:56:52 +0800</pubDate><description><![CDATA[/*
// Definition for a Node.
class Node {
    public int val;
    public List&lt;Node&gt; children;

    public Node() {}

    public Node(int _val,List&lt;Node&gt; _children) {
        val = _val;
 ...]]></description><category></category></item><item><title><![CDATA[Codeforces 629A Far Relative’s Birthday Cake]]></title><link>https://blog.csdn.net/polanwind/article/details/88884279</link><guid>https://blog.csdn.net/polanwind/article/details/88884279</guid><author>polanwind</author><pubDate>Fri, 29 Mar 2019 09:31:56 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;math.h&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;

using namespace s...]]></description><category></category></item><item><title><![CDATA[Leetcode 182 Duplicate Emails]]></title><link>https://blog.csdn.net/polanwind/article/details/88883732</link><guid>https://blog.csdn.net/polanwind/article/details/88883732</guid><author>polanwind</author><pubDate>Fri, 29 Mar 2019 08:56:26 +0800</pubDate><description><![CDATA[select Email from Person group by Email having count(*) &gt; 1;


]]></description><category></category></item><item><title><![CDATA[Codeforces 1131A Sea Battle]]></title><link>https://blog.csdn.net/polanwind/article/details/88865218</link><guid>https://blog.csdn.net/polanwind/article/details/88865218</guid><author>polanwind</author><pubDate>Thu, 28 Mar 2019 11:24:58 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;math.h&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;

using namespace s...]]></description><category></category></item><item><title><![CDATA[Leetcode 494 Target Sum]]></title><link>https://blog.csdn.net/polanwind/article/details/88864053</link><guid>https://blog.csdn.net/polanwind/article/details/88864053</guid><author>polanwind</author><pubDate>Thu, 28 Mar 2019 10:48:10 +0800</pubDate><description><![CDATA[class Solution {
    int ans=0;
    public int findTargetSumWays(int[] nums, int S) {
        if (nums == null || nums.length == 0) return ans;
        dfs(nums, S, 0);
        return ans;
    }
    ...]]></description><category></category></item><item><title><![CDATA[Leetcode 589 N-ary Tree Preorder Traversal]]></title><link>https://blog.csdn.net/polanwind/article/details/88839324</link><guid>https://blog.csdn.net/polanwind/article/details/88839324</guid><author>polanwind</author><pubDate>Wed, 27 Mar 2019 11:04:53 +0800</pubDate><description><![CDATA[/*
// Definition for a Node.
class Node {
    public int val;
    public List&lt;Node&gt; children;

    public Node() {}

    public Node(int _val,List&lt;Node&gt; _children) {
        val = _val;
 ...]]></description><category></category></item><item><title><![CDATA[Codeforces 92A Chips]]></title><link>https://blog.csdn.net/polanwind/article/details/88838387</link><guid>https://blog.csdn.net/polanwind/article/details/88838387</guid><author>polanwind</author><pubDate>Wed, 27 Mar 2019 10:33:05 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;math.h&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;

using namespace s...]]></description><category></category></item><item><title><![CDATA[Codeforces 1009A Game Shopping]]></title><link>https://blog.csdn.net/polanwind/article/details/88812132</link><guid>https://blog.csdn.net/polanwind/article/details/88812132</guid><author>polanwind</author><pubDate>Tue, 26 Mar 2019 08:46:42 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;math.h&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;

using namespace s...]]></description><category></category></item><item><title><![CDATA[Leetcode 985 Sum of Even Numbers After Queries]]></title><link>https://blog.csdn.net/polanwind/article/details/88812083</link><guid>https://blog.csdn.net/polanwind/article/details/88812083</guid><author>polanwind</author><pubDate>Tue, 26 Mar 2019 08:39:28 +0800</pubDate><description><![CDATA[class Solution {
    public int[] sumEvenAfterQueries(int[] A, int[][] queries) {
        int len_A=A.length;
        int len_R=queries.length;
        int len_C=queries[0].length;
        int cnt=0;...]]></description><category></category></item><item><title><![CDATA[Codeforces 262A Roma and Lucky Numbers]]></title><link>https://blog.csdn.net/polanwind/article/details/88787496</link><guid>https://blog.csdn.net/polanwind/article/details/88787496</guid><author>polanwind</author><pubDate>Mon, 25 Mar 2019 10:33:35 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;math.h&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;

using namespace s...]]></description><category></category></item><item><title><![CDATA[Leetcode 922 Sort Array By Parity II]]></title><link>https://blog.csdn.net/polanwind/article/details/88787117</link><guid>https://blog.csdn.net/polanwind/article/details/88787117</guid><author>polanwind</author><pubDate>Mon, 25 Mar 2019 10:17:37 +0800</pubDate><description><![CDATA[class Solution {
    public int[] sortArrayByParityII(int[] A) {
        int el=0;
        int ol=1;
        int len=A.length;
        int[] ans=new int[len];
        for(int i=0;i&lt;len;++i){
     ...]]></description><category></category></item><item><title><![CDATA[Leetcode 700 Search in a Binary Search Tree]]></title><link>https://blog.csdn.net/polanwind/article/details/88781290</link><guid>https://blog.csdn.net/polanwind/article/details/88781290</guid><author>polanwind</author><pubDate>Sun, 24 Mar 2019 20:21:41 +0800</pubDate><description><![CDATA[/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    pub...]]></description><category></category></item></channel></rss>