- 博客(16)
- 收藏
- 关注
RSS订阅原创 Ubuntu-OpenBlas for Caffe
openblas 解压进入目录 cd openblas make sudo make install sudo gedit /etc/profile 添加 export LD_LIBRARY_PATH=/opt/OpenBLAS/lib/
2017-09-17 19:13:32
231
原创 UBUNTU14.04-CUDA 7.5安装
准备： 1.安装文档 2.安装包 步骤 1.安装检查 2.安装 3.确认状态 1.安装检查 执行安装包2.1-2.4所有步骤，对于Ubuntu主要有 (1)显卡检查 $lspci | grep -i nvidia (2)GCC检查，原装Ubuntu14.04是gcc4.8没问题，之前折腾过旧版本的一定要换成4.8 $ gcc --version (3)检查K
2017-09-16 15:47:48
248
原创 Emacs
批量转换KITTI数据集到VOC的方法 1.Emacs法 2.matlab脚本 1.Emacs法 http://www.cnblogs.com/linkboy1980/p/6527394.html 内容需要更改 改schema为
2017-09-13 15:00:55
208
原创 Add to List 67
Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". 实值相加会有问题，超过int上限就会报错，代码如下：class Solution { public: string addBinary(string a, st
2017-06-27 09:51:54
431
原创 LeetCode 66. Plus One
题目： Given a non-negative integer represented as a non-empty array of digits, plus one to the integer. You may assume the integer do not contain any leading zero, except the number 0 itself. T
2017-06-26 17:45:02
202
原创 Leecode-58. Length of Last Word
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, return 0. Note: A word is
2017-06-20 19:59:22
179
原创 Leecode-53. Maximum Subarray
贪心法： 前部分和大于0则有继续相加价值，小于0重置。 class Solution { public: int maxSubArray(vector& nums) { int sum=nums[0]; int t=0; for(int i=0;i<nums.size();i++) { if(t
2017-06-20 19:13:05
213
原创 Leecode- 38. Count and Say
The count-and-say sequence is the sequence of integers with the first five terms as following: 1. 1 2. 11 3. 21 4. 1211 5. 111221 1 is read off as "one 1" or 11. 11 is read
2017-06-14 15:55:55
215
原创 Leecode-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.Here
2017-06-12 17:05:05
182
原创 Leecode-Remove Duplicates from Sorted Array
class Solution { public: int removeDuplicates(vector& nums) { int length=nums.size(); if(length== 0) return 0; map hmap; int len=1; hmap.insert(pair(
2017-06-04 11:13:29
189
原创 Leecode-21. Merge Two Sorted Lists
Total Accepted: 219857Total Submissions: 567355Difficulty: EasyContributor: LeetCode Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together
2017-06-03 10:51:04
197
原创 Leecode-Valid Parentheses
\class Solution { public: bool isValid(string s) { int length = s.size(); bool validstring = false; std::stack latests; for (int i = 0; i < length; i++) { switch (s[i]){ case '(': lat
2017-06-02 16:46:37
175
原创 LEECODE-Roman to Integer
class Solution { public: int romanToIntChar(char c) { int data=0; switch(c) { case 'I': { data=1; return data;
2017-06-01 10:22:24
200
原创 7 reverse
class Solution { public: int reverse(int x) { int index; bool isminus=false; int res=0; if(x<0) { x=-x; isminus=true; }
2017-05-25 21:41:24
208
原创 leetcode.-1.Two Sum
class Solution { public: vector twoSum(vector& nums, int target) { map hmap; int n=sizeof(nums)/sizeof(int);// vector Res; for(int i=0;i {
2017-05-25 20:48:23
173
原创 2016-6-14Kinect学习
Enhanced Computer Vision with Microsoft Kinect Sensor: A Review 摘要：Kinect介绍，使用kinect的计算机视觉算法和应用，这些方法以计算机视觉类别分类，包含preprocessing, object tracking and recognition, human activity analysis, hand gestur
2016-06-14 14:36:44
716
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人