- 博客(6)
- 资源 (1)
- 收藏
- 关注
转载 vs2013编译旧版本程序出错
VS2013多字节工程问题 使用VS2013编译旧版VC++程序时,提示Building an MFC project for a non-Unicode character set is deprecated,微软提供了解决方案。 一、错误信息 [cpp] view plaincopyprint? "font-famil
2015-12-05 13:06:05 937
原创 【Leetcode】之Search Insert Position
一.问题描述Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array
2015-12-04 09:44:16 327
原创 【Leetcode】之Search for a Range
一.问题描述Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm’s runtime complexity must be in the order of O(log n).If the target is not found in
2015-12-03 16:40:11 335
原创 【Leetcode】之Search in Rotated Sorted Array
一.问题描述Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array return its
2015-12-02 10:58:35 353
原创 【机器学习算法】之SVM
一.算法介绍SVM分为线性SVM和非线性SVM,非线性SVM实际上也只是通过核函数变换到特征空间。这里我主要针对线性SVM进行说明。 模型:线性SVM主要用于解决线性可分的问题,所建立的模型实际上就是f(x)=sign(wx+b)。这和感知机所建立的模型实际上是一致的,即SVM希望学习到线性空间的一个超平面,在这个超平面两侧的数据点有着不同的类别。之前说过的logistic回归模型实际上也是希望学
2015-12-01 10:49:11 537
原创 【Leetcode】之Longest Valid Parentheses
一.问题描述Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.For “(()”, the longest valid parentheses substring is “()”, whi
2015-12-01 09:56:18 297
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人