冰糖咖啡910-CSDN博客

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has on

2015-09-11 09:41:14 317

原创 LeetCode 263----Ugly Number

Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly si

2015-09-09 17:03:54 385

原创 LeetCode 278--First Bad Versionx先判断

You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the

2015-09-08 20:11:18 276

原创 LeetCode 13-----Roman to Integer

Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.相同的数字连写，所表示的数等于这些数字相加得到的数，如 Ⅲ=3；小的数字在大的数字的右边，所表示的数等于这些数字相加得到的数，如 Ⅷ=8、Ⅻ=12；小的数字（限

2015-09-08 09:45:10 341

原创 LeetCode58----Length of Last Word

LeetCode敲的第一题，小菜鸟一只，纪念一下~~Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist

2015-09-07 17:00:01 288

原创 C++学习——vector

vector是一种实体化对象，其内存为连续的。一维vector： vector<int>a(10,0) 声明向量a为int型，其初始长度为10，值为0二维vector： vector<vector<int>>a(m,vector(n)) 定义二维向量a，大小为m*n 基本函数： a.size() //获取向量中的元素个数 a

2015-08-23 16:47:56 377

原创图像处理ORB特征学习笔记（1）

关键点：使用Harris角点检测寻找FAST关键点。初始时，选取低阀值，使获取的关键点数目大于N。再根据Harris测量，为关键点排序，选取测量值高的N个点做关键点。Harris角滤波器丢弃边缘。用质心法分析角方向（主方向）。

2015-03-16 13:12:07 1690

原创 vs2010的gsl配置

网上有很多配置的blog，

2014-11-13 16:43:42 903 1

ZXC的专栏

原创 LeetCode 437. Path Sum III 题解和固定的二叉树路径数目

原创 LeetCode 415. Add Strings题解字符串加和

原创 Andrew机器学习笔记2：逻辑回归 logistic regression

原创 Andrew机器学习笔记1：线性回归 linear regression

原创 LeetCode 168. Excel Sheet Column Title

原创 LeetCode 201. Bitwise AND of Numbers Range

原创 LeetCode 231. Power of Two ---- 2的幂

原创 LeetCode----223. Rectangle Area 2个矩形和

原创 LeetCode----344. Reverse String 字符串反转

原创 LeetCode 292----Nim Game

原创 LeetCode 242----Valid Anagram

原创 LeetCode 283----Move Zeroes

原创 LeetCode 235----Lowest Common Ancestor of a Binary Search

原创 LeetCode 191----Number of 1 Bits

原创 LeetCode 226----Invert Binary Tree

原创 LeetCode 100-----Same Treed

原创 LeetCode 104----Maximum Depth of Binary Tree

原创 LeetCode 237----Delete Node in a Linked List

原创 LeetCode 258----Add Digits