<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Chen_17]]></title><description><![CDATA[Code farmer]]></description><link>https://blog.youkuaiyun.com/rebornQ1</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; rebornQ1]]></copyright><item><title><![CDATA[Leetcode:Two Sum]]></title><link>https://blog.youkuaiyun.com/rebornQ1/article/details/78209482</link><guid>https://blog.youkuaiyun.com/rebornQ1/article/details/78209482</guid><author>rebornQ1</author><pubDate>Wed, 11 Oct 2017 22:46:30 +0800</pubDate><description><![CDATA[题目：

最先思路：
public class Solution {
    public int[] TwoSum(int[] nums, int target) {
            for (int i = 0; i < nums.Length; i++)
              {
                  for (int j = i + 1; j < nums]]></description><category></category></item><item><title><![CDATA[CodeWars:Most digits]]></title><link>https://blog.youkuaiyun.com/rebornQ1/article/details/78209127</link><guid>https://blog.youkuaiyun.com/rebornQ1/article/details/78209127</guid><author>rebornQ1</author><pubDate>Wed, 11 Oct 2017 22:12:02 +0800</pubDate><description><![CDATA[题目：

我的解：

public class Kata
{
  public static int FindLongest(int[] number)
  {
    // code here
    int max = number[0], maxIndex = number[0].ToString().Length;
            for (int i = 1; i < n]]></description><category></category></item><item><title><![CDATA[CodeWars:Sum of odd numbers]]></title><link>https://blog.youkuaiyun.com/rebornQ1/article/details/78208971</link><guid>https://blog.youkuaiyun.com/rebornQ1/article/details/78208971</guid><author>rebornQ1</author><pubDate>Wed, 11 Oct 2017 21:54:57 +0800</pubDate><description><![CDATA[题目：

我的解：

个人觉得最棒解：public static long rowSumOddNumbers(long n)
  {
    return n * n * n;
  }理由：
       ((n - 1) * n + 1) * n + (n - 1) * n
==>n * n * n]]></description><category></category></item><item><title><![CDATA[20170907 21:41]]></title><link>https://blog.youkuaiyun.com/rebornQ1/article/details/77887352</link><guid>https://blog.youkuaiyun.com/rebornQ1/article/details/77887352</guid><author>rebornQ1</author><pubDate>Thu, 07 Sep 2017 21:42:31 +0800</pubDate><description><![CDATA[随笔]]></description><category></category></item></channel></rss>