<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a8814828的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a8814828</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a8814828]]></copyright><item><title><![CDATA[[leetcode]C语言:169 Majority Element]]></title><link>https://blog.youkuaiyun.com/a8814828/article/details/44521417</link><guid>https://blog.youkuaiyun.com/a8814828/article/details/44521417</guid><author>a8814828</author><pubDate>Sat, 21 Mar 2015 20:08:48 +0800</pubDate><description><![CDATA[Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element always]]></description><category></category></item><item><title><![CDATA[[leetcode]C语言:171 Excel Sheet Column Number]]></title><link>https://blog.youkuaiyun.com/a8814828/article/details/44521391</link><guid>https://blog.youkuaiyun.com/a8814828/article/details/44521391</guid><author>a8814828</author><pubDate>Sat, 21 Mar 2015 20:05:40 +0800</pubDate><description><![CDATA[Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example:A -> 1
B -> 2
C -> 3
...
Z -> 26
AA -> 27
AB -> 28 
int]]></description><category></category></item><item><title><![CDATA[[leetcode]C语言:172 Factorial Trailing Zeroes]]></title><link>https://blog.youkuaiyun.com/a8814828/article/details/44309551</link><guid>https://blog.youkuaiyun.com/a8814828/article/details/44309551</guid><author>a8814828</author><pubDate>Mon, 16 Mar 2015 18:08:19 +0800</pubDate><description><![CDATA[**Given an integer n, return the number of trailing zeroes in n!. 
Note: Your solution should be in logarithmic time complexity.**int trailingZeroes(int n) 
{
    int s=0;
    while ((n/5)!=0)
    {]]></description><category></category></item><item><title><![CDATA[[leetcode]C语言:189 Rotate Array]]></title><link>https://blog.youkuaiyun.com/a8814828/article/details/44309287</link><guid>https://blog.youkuaiyun.com/a8814828/article/details/44309287</guid><author>a8814828</author><pubDate>Mon, 16 Mar 2015 17:44:26 +0800</pubDate><description><![CDATA[void rotate(int nums[], int n, int k) {
    int temp;
    int nums1[n];
    for (int y=0;y<n;y++){
    nums1[(y+k+n)%n]=nums[y+n%n];
    }
    for (int i=0;i<n;i++){
        nums[i]=nums1[i];}
}]]></description><category></category></item></channel></rss>