摘要：
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.解决思路： 决定阶乘末尾零的个数其实... 阅读全文
摘要：
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 t... 阅读全文
摘要：
Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 22; return 1.Example2: version1==”11.22.33”,... 阅读全文
摘要：
Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists: A: ... 阅读全文
摘要：
项目主页：http://grinninglizard.com/tinyxml2docs/index.html tinyxml2.h /*Original code by Lee Thomason (www.grinninglizard.com)This software is provided... 阅读全文
摘要：
Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1-... 阅读全文
摘要：
Maximum Depth of Binary Tree Total Accepted: 63668 Total Submissions: 141121 My Submissions Question Solution Given a binary tree, find it... 阅读全文
摘要：
Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers.Have you thought about this?... 阅读全文
摘要：
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. • push(x) – Push element x onto stack. • p... 阅读全文
摘要：
http://www.cnblogs.com/sleepwalker/p/3676600.html?utm_source=tuicoolhttp://blog.csdn.net/carson2005/article/details/9502053 Retinex理论Retinex理论始于Lan... 阅读全文