摘要：
项目主页：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... 阅读全文
摘要：
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: ... 阅读全文
摘要：
Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 22; return 1.Example2: version1==”11.22.33”,... 阅读全文
摘要：
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... 阅读全文
摘要：
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.解决思路： 决定阶乘末尾零的个数其实... 阅读全文
摘要：
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,... 阅读全文
摘要：
Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100)... 阅读全文
摘要：
实现效果：这个其实是一个非常常见的功能，大家都会考虑给自己简单的工程做一个背景界面。其实只要在view类中重载OnEraseBkgnd（）这个函数就好了。代码如下：BOOL CdddView::OnEraseBkgnd(CDC* pDC){ // TODO: 在此添加消息处理程... 阅读全文
摘要：
今天看了一个华为西安研究院的一个女生代码大神的总结很有感悟，下面这句话送给大家：只有好的程序员才能写出人类可以理解的代码You are a professional robber planning to rob houses along a street. Each house ha... 阅读全文
摘要：
Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occ... 阅读全文
摘要：
Climbing Stairs You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps... 阅读全文
摘要：
Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive intege... 阅读全文
摘要：
image算法测试iteratoralgorithmfeatures原创文章，转载请注明出处：http://blog.csdn.net/crzy_sparrow/article/details/7391511文章目录：一、Harris角点检测基本理论二、opencv代码实现三、改进的Harris角... 阅读全文
摘要：
http://www.cnblogs.com/sleepwalker/p/3676600.html?utm_source=tuicoolhttp://blog.csdn.net/carson2005/article/details/9502053 Retinex理论Retinex理论始于Lan... 阅读全文
摘要：
问题来源：http://bbs.csdn.net/topics/390998279?page=1#post-398983061 // Only_once.cpp : 定义控制台应用程序的入口点。////请参考>#include "StdAfx.h"#include #include usi... 阅读全文
摘要：
话不多说，上代码： #include #include #include using namespace std;const int DO = 261;const int RE = 293;const int MI = 329;const int FA = 349;const int SO = 39... 阅读全文