- 博客(76)
- 收藏
- 关注
RSS订阅原创 tensorflow安装
准备在实验室电脑上使用tensorflow仿真。由于之前已经安过cuda7.5,现在不够用了要升级，一步步来。1.升级cuda7.5到cuda8.0,安装cudnn5.1首先卸载cuda7.5cd /usr/local/cuda/binsudo ./uninstall_cuda_7.5.pl 在System Settings->Software & Updates->Ad
2017-04-20 20:52:21
516
1
原创 tensorflow加载部分层方法
一般使用saver.restore(sess, modeldir + "model.ckpt")即可加载已经训练好的网络，可是有时候想值使用部分层的参数，这时候可以选择在加载网络之后重新初始化剩下的层var_list = [weights['wd1'], weights['out'], biases['bd1'], biases['out'], global_step]initfc =
2017-04-10 16:02:15
7043
1
原创 github windows 新建repository
记录一下在已经配置好的win环境下提交新工程到github的过程1.创建Repository（仓库）1-1新建repository设置相应工程名字以及相应描述即可2.上传本地工程到github2-1 创建一个本地项目（1）在自己的工程文件目录下面打开cmd执行指令git init初始化成功后你会发现项目里多了一个隐藏文件夹.git这个目录是Git用来跟踪管理
2017-04-10 14:19:01
464
转载 字符编码笔记：ASCII，Unicode和UTF-8
在网上搜到的，感觉别人总结的很好，记录一下。1. ASCII码我们知道，在计算机内部，所有的信息最终都表示为一个二进制的字符串。每一个二进制位（bit）有0和1两种状态，因此八个二进制位就可以组合出256种状态，这被称为一个字节（byte）。也就是说，一个字节一共可以用来表示256种不同的状态，每一个状态对应一个符号，就是256个符号，从0000000到11111111。上个世
2017-03-25 21:00:20
403
原创 在ubuntu下使用github
最近需要公司学校两边跑，决定利用github做版本控制。1.git安装：（1）安装gitsudo apt-get install git git-core git-gui git-doc git-svn git-cvs gitweb gitk git-email git-daemon-run git-el git-arch（2）检查SSHssh -T [email protected]若
2017-03-04 15:06:22
472
原创 gitlab常用操作记录(公司)
已有repository，希望能够添加自己的文件先新建自己的projectGit global setupgit config --global user.name "lijingling"git config --global user.email "[email protected]"1.克隆自己的project到本地，然后把自己的文件复制进去，然后上传即可
2017-02-17 11:49:21
3944
原创 使用github和git进行版本控制
最近需要实验室和公司两边跑，所以希望能够版本控制自己的实验室项目以及公司里的工程项目。下面是windows下的配置教程。1.注册github账号2.git的安装（1）下载最新版本的git，直接搜索git windows即可，下载安装exe文件后使用默认配置安装git，一路next即可（2）github选择的默认通信方式为SSH，所以先要在git里面生成SHH Key，打开Git B
2017-02-16 16:18:13
924
原创 81. Search in Rotated Sorted Array II
problem:Suppose an array sorted in ascending order 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).Write a function to determine if
2017-02-11 16:07:11
283
原创 82. Remove Duplicates from Sorted List II
problem:Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example,Given 1->2->3->3->4->4->5, return 1->2->5
2017-02-11 10:28:11
428
原创 80. Remove Duplicates from Sorted Array II
problem：Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, wit
2017-02-10 21:29:51
342
原创 79. Word Search
problem：Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally
2017-02-10 20:58:59
270
原创 78. Subsets
problem：Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,3], a solution is:[
2017-02-10 16:27:33
256
原创 77. Combinations
problem：Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,
2017-02-10 15:54:29
229
原创 76. Minimum Window Substring
problem：Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T = "ABC"Minimum
2017-02-09 17:42:37
311
原创 75. Sort Colors
problem:Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the
2017-02-09 16:48:40
286
原创 74. Search a 2D Matrixp
problem:Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first i
2017-02-09 15:57:58
335
原创 73. Set Matrix Zeroes
problem：Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.Follow up:Did you use extra space?A straight forward solution using O(mn) space is
2017-02-09 11:18:57
382
原创 72. Edit Distance
problem：Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permit
2017-02-09 10:49:13
271
原创 71. Simplify Path
problem:Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"这道题的要求是简化一个Unix风格下的文件的绝对路径。需注意以下几种情况：1.重
2017-01-25 11:15:21
207
原创 70. Climbing Stairs
problem：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. In how many distinct ways can you climb to the top?Note: Given n
2017-01-15 14:11:16
225
原创 69. Sqrt(x)
problem:Implement int sqrt(int x).Compute and return the square root of x.本问题是完成开根号的操作。这道题使用二分查找，因为是求数x（x>=0) 的平方根， 因此，结果一定是小于等于x且大于等于0，所以用二分查找法肯定能搜到结果。以每一次的mid的平方来与target既数x相比：如
2017-01-15 13:56:27
337
原创 68. Text Justification
problem：Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.You should pack your words in a greedy ap
2017-01-15 13:46:30
250
原创 67. Add Binary
problem：Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".这道题首先补齐较短的那个字符串，然后循环遍历即可class Solution {public: string addBin
2017-01-08 21:13:52
241
原创 66. Plus One
problem：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 itsel
2017-01-08 20:56:26
262
原创 65. Valid Number
problem：Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement
2017-01-08 14:10:27
272
原创 64. Minimum Path Sum
problem：Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either do
2017-01-04 21:55:49
238
原创 63. Unique Paths II
problem：Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respecti
2017-01-04 21:01:54
184
原创 62. Unique Paths
problem：A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying t
2017-01-04 20:18:56
213
原创 黑板课爬虫闯关第四关
在第三关过了之后，一直卡在第三关，我还不太明白是怎么回事，直接靠网址调到第四关。http://www.heibanke.com/lesson/crawler_ex03/点击进入页面后也是和第三关一样，需要登录才能进行下一步操作（如果之前登录了，服务器会根据浏览器保存的cookie自动返回登录后的页面）。登录后的页面如图：根据提示，密码不再是之前的30以内的数字了，是需要
2017-01-04 14:19:45
428
原创 黑板课爬虫闯关第三关
在前两关结束之后，进入第三关，这里需要我们注册，注册后再登录页面题目说比上一关多了两层保护，我们可以看到顶部有个注销按钮，也就是说首先要先登录才能继续做题。首先观察在登录的时候除了用户名和密码到底还发送了些什么。打开chrome，在登录界面，右键点开Inspect，然后在昵称和密码区域分别输入自己的用户名和密码，点击登录，可以在Network中看到如下的变化，
2017-01-04 12:21:56
542
原创 黑板课爬虫闯关第二关
通过第一关后，可以看到第二关的提示，在这里需要我们循环尝试密码。查看html源码：这里需要涉及到requests的post请求，并在请求里加上用户名username和密码password即可。# coding=utf-8import requestswrongNotify = '您输入的密码错误, 请重新输入'website = 'http://www.he
2017-01-04 11:20:03
361
原创 黑板课爬虫闯关第一关
之前也没有系统的学习过python，看其他源码的时候也是似懂非懂的看着理解意思。最近比较有空，就想更系统的学习一下，在知乎上看到大神推荐了一个Python爬虫闯关网站，便想试试。下面是第一关的介绍，黑板课爬虫第一关。点击进入网站以后，如下图所示：做了一下尝试，先手动在网址后面输入数字14901，得到下面结果。这个时候提示，要将数字改成63668，可以理解
2017-01-04 09:46:01
2267
原创 ubuntu14.04下安装matlab2016b
最近重装了ubuntu系统，正好要再装一次matlab，就顺便记录一下安装过程。系统：ubuntu14.04matlab2016b在学校的bt网站上下载matlab2016b版本，下载后的Linux文件夹下会有三个文件，分别为：R2016b_glnxa64_dvd1.iso、R2016b_glnxa64_dvd2.iso和Matlab 2016b Linux64 Crack文件夹。
2016-12-20 19:35:27
2316
原创 CIFAR－10模型训练与可视化
通过caffe深度学习框架在cifar10数据集训练得到模型，观察并分析模型的train loss 、test loss及accuracy曲线，并对得到的caffemodel进行测试。数据集介绍：cifar-10是一个使用非常广泛的物体识别图像数据集，CIFAR-10数据中包含了60000张32×32的彩色图像，其中训练集50000张，测试集10000张。共有10类物体，分别是airpla
2016-12-19 21:54:34
3332
原创 vggnet学习资料整理
这两天已经把vggnet在caffe平台上训练，在等训练结果的同时，将网络的理论基础梳理明白。下面罗列一下自己需要看的资料。一、阅读资料：1.Caffe官方教程中译本http://pan.baidu.com/s/1miwIUta2.CS231n Convolutional Neural Networks for Visual Recognition http://cs231
2016-12-15 21:05:59
2169
1
原创 61. Rotate List
problem：Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.将链表首尾相连成环。寻找尾节点的同时可
2016-12-15 19:41:43
484
原创 60. Permutation Sequence
problem：The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""13
2016-12-15 16:50:18
240
原创 /usr/home/anaconda/lib/libcurl.so.4: no version information available (required by cmake)"
在安装了anaconda之后，想重装opencv，结果报错。解决办法为：conda remove curl
2016-12-15 16:35:23
5303
原创 59. Spiral Matrix II
problem：Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [
2016-12-14 21:10:19
268
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人