- 博客(169)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 Paper概括：On the use of Deep Learning for Image Quality Assessment
Paper概括：On the use of Deep Learning for Image Quality Assessment1. Introduction: 介绍了数码图像可能因光照，噪点，镜头等原因产生图片质量低下的情况。图片质量预测算法就是为了能够帮助在图片获取过程中提高图片质量。图片的质量通常以人类对其评分的平均值为准。近年来的图片质量算法通常分为full-reference, ...
2019-06-23 13:55:06
620
转载 ubuntu统计某文件夹下文件的个数
统计某文件夹下文件的个数ls -l |grep “^-”|wc -l统计某文件夹下目录的个数ls -l |grep “^ｄ”|wc -l统计文件夹下文件的个数，包括子文件夹里的ls -lR|grep “^-”|wc -l如统计/home/han目录(包含子目录)下的所有js文件则：ls -lR /home/han|grep js|wc -l 或 ls -l “/home/han”|g...
2019-05-09 11:52:47
1570
原创 配置tmux鼠标操作
在Terminal输入vi ~/.tmux.conf创建一个配置文件, 并在文件中输入set -g mouse on并保存.随后在Terminal中输入tmux进入tmux模式, 进入后按Ctrl+b+:, 此时tmux底部会变颜色. 在此输入source ~/.tmux.conf并回车即可....
2019-05-09 01:04:52
4336
原创 Ubuntu下查看CUDA和CUDNN版本的方法
cuda 版本cat /usr/local/cuda/version.txtcudnn 版本cat /usr/local/cuda/include/cudnn.h | grep CUDNN_MAJOR -A 2这个结果就表示我的CUDA版本为8.0.44, cuDNN版本为5.1.10
2019-05-09 00:50:25
25179
8
原创 Ubuntu sudo 安装报错 (Could not get lock /var/lib/dpkg/lock-frontend)
Could not get lock /var/lib/dpkg/lock-frontend – open (11: Resource temporarily unavailable)E: Unable to acquire the dpkg frontend lock (/var/lib/dpkg/lock-frontend)这是我在用sudo apt-get upgrade时显示的报错, ...
2019-05-09 00:27:06
920
原创 新手的Pytorch入门笔记（一）
新手的Pytorch入门笔记（一）pytorch的安装因为工作原因，最近开始学习PyTorch，为了方便自己日后查阅，在次记录一下自己学习的一些心得以及学习中遇到的一些坑，愿与诸位共勉。pytorch的安装安装过程十分简单，直接上pytorch的官网：https://pytorch.org/根据自己的系统选择对应的版本复制命令行。这里不建议使用conda，因为我在用conda安装pyto...
2019-04-28 21:11:27
3552
1
原创 ubuntu下更改默认python版本
输入vi ~/.bashrc如果要将默认改为python2在底下添加alias python='/usr/bin/python2'要改为python3就加alias python='/usr/bin/python3'修改完成之后输入. ~/.bashrc就可以了...
2018-10-23 00:15:57
335
原创 Lintcode 54. String to Integer (atoi) (Medium) (Python).md
String to Integer (atoi)Description:Implement function atoi to convert a string to an integer.If no valid conversion could be performed, a zero value is returned.If the correct value is out of the...
2018-09-30 19:21:29
217
原创 Lintcode 134. LRU Cache (Medium) (Python)
LRU CacheDescription:Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be posi...
2018-09-30 18:39:38
261
原创 Lintcode 131. The Skyline Problem (Super Hard) (Python) (未完成)
The Skyline ProblemDescription:Given N buildings in a x-axis，each building is a rectangle and can be represented by a triple (start, end, height)，where start is the start position on x-axis, end is ...
2018-09-30 17:57:18
431
原创 Lintcode 86. Binary Search Tree Iterator (Hard) (Python)
Binary Search Tree IteratorDescription:Design an iterator over a binary search tree with the following rules:Elements are visited in ascending order (i.e. an in-order traversal)next() and hasNext(...
2018-09-30 13:59:52
214
原创 Lintcode 65. Median of two Sorted Arrays (Hard) (Python)
Median of two Sorted ArraysDescription:There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays.ExampleGiven A=[1,2,3,4,5,6] and B=[2,3,4,5], the ...
2018-09-30 12:45:11
184
原创 Lintcode 1076. Minimum ASCII Delete Sum for Two Strings (Python) (Medium)
Minimum ASCII Delete Sum for Two StringsDescription:Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.ExampleExample 1:Input: s1 = “sea”, s2 = “e...
2018-09-30 11:16:30
180
原创 Lintcode 545. Top k Largest Numbers II (Medium) (Python)
Top k Largest Numbers IIDescription:Implement a data structure, provide two interfaces:add(number). Add a new number in the data structure. topk(). Return the top k largest numbers in this data...
2018-09-14 06:33:40
256
原创 Lintcode 159. Find Minimum in Rotated Sorted Array (Medium) (Python)
Find Minimum in Rotated Sorted ArrayDescription: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).Find the minimum elem...
2018-09-14 05:21:07
208
原创 Lintcode 544. Top k Largest Numbers (Medium) (Python)
Top k Largest NumbersDescription:Given an integer array, find the top k largest numbers in it.Example Given [3,10,1000,-99,4,100] and k = 3. Return [1000, 100, 10].Code:class Solution:...
2018-09-14 03:44:27
320
原创 Lintcode 383. Container With Most Water (Medium) (Python)
Container With Most WaterDescription:Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of lin...
2018-09-14 02:57:56
196
原创 Lintcode 886. Convex Polygon (Medium) (Python)
Convex PolygonDescription:Given a list of points that form a polygon when joined sequentially, find if this polygon is convex (Convex polygon definition).Example Given points = [[0, 0], [0, 1],...
2018-09-13 13:55:53
233
原创 Lintcode 904. Plus One Linked List (Medium) (Python)
Plus One Linked ListDescription:Given a non-negative integer represented as non-empty a singly linked list of digits, plus one to the integer.You may assume the integer do not contain any leadin...
2018-09-13 12:00:29
138
原创 Lintcode 617. Maximum Average Subarray II (Medium) (Python)
Maximum Average Subarray IIDescription:Given an array with positive and negative numbers, find the maximum average subarray which length should be greater or equal to given length k.Example Giv...
2018-09-12 16:20:07
329
原创 Lintcode 1001. Asteroid Collision (Medium) (Python)
Asteroid CollisionDescription:We are given an array asteroids of integers representing asteroids in a row.For each asteroid, the absolute value represents its size, and the sign represents its d...
2018-09-12 08:57:16
347
原创 Lintcode 1259. Integer Replacement (Medium) (Python)
Integer ReplacementDescription:Given a positive integer n and you can do operations as follow:1.If n is even, replace n with n/2. 2.If n is odd, you can replace n with either n + 1 or n - 1.W...
2018-09-11 10:31:25
162
原创 Lintcode 148. Sort Colors (Medium) (Python)
Sort ColorsDescription: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, ...
2018-09-11 03:16:09
166
原创 Lintcode 178. Graph Valid Tree (Medium) (Python)
Graph Valid TreeDescription:Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree....
2018-09-11 02:20:34
380
原创 Lintcode 78. Longest Common Prefix (Medium) (Python)
Longest Common PrefixDescription:Given k strings, find the longest common prefix (LCP).Example For strings “ABCD”, “ABEF” and “ACEF”, the LCP is “A”For strings “ABCDEFG”, “ABCEFG” and “ABCEFA...
2018-09-10 11:31:38
140
原创 Lintcode 16. Permutations II (Medium) (Python)
Permutations IIDescription:Given a list of numbers with duplicate number in it. Find all unique permutations.Example For numbers [1,2,2] the unique permutations are:[ [1,2,2], [2,1,2], ...
2018-09-10 09:57:36
179
原创 Lintcode 61. Search for a Range (Medium) (Python)
Search for a RangeDescription:Given a sorted array of n integers, find the starting and ending position of a given target value.If the target is not found in the array, return [-1, -1].Example...
2018-09-10 02:07:25
156
原创 Lintcode 15. Permutations (Medium) (Python)
PermutationsDescription:Given a list of numbers, return all possible permutations.Example For nums = [1,2,3], the permutations are:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2]...
2018-09-09 14:37:35
176
原创 Lintcode 191. Maximum Product Subarray (Medium) (Python)
Maximum Product SubarrayDescription:Find the contiguous subarray within an array (containing at least one number) which has the largest product.Example For example, given the array [2,3,-2,4], ...
2018-09-09 14:22:08
149
原创 Lintcode 424. Evaluate Reverse Polish Notation (Medium) (Python)
Evaluate Reverse Polish NotationDescription:Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another ex...
2018-09-09 11:09:12
116
原创 Lintcode 392. House Robber (Medium) (Python)
House RobberDescription:You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of...
2018-09-09 10:43:24
139
原创 Lintcode 1195. Find Largest Value in Each Tree Row (Medium) (Python)
Find Largest Value in Each Tree RowDescription:You need to find the largest value in each row of a binary tree.Example Input: [1,3,2,5,3,#,9] Output: [1, 3, 9]Code:"""Definition of Tree...
2018-09-09 04:04:51
219
原创 Lintcode 388. Permutation Sequence (Medium) (Python)
Permutation SequenceDescription:Given n and k, return the k-th permutation sequence.Example For n = 3, all permutations are listed as follows:“123” “132” “213” “231” “312” “321” If k = ...
2018-09-09 01:20:02
116
原创 Lintcode 418. Integer to Roman (Medium) (Python)
Integer to RomanDescription:Given an integer, convert it to a roman numeral.The number is guaranteed to be within the range from 1 to 3999.Example 4 -> IV12 -> XII21 -> XXI99 -...
2018-09-08 23:28:14
181
原创 Lintcode 442. Implement Trie (Prefix Tree) (Medium) (Python)
Implement TrieDescription:Implement a trie with insert, search, and startsWith methods.Example insert(“lintcode”) search(“code”) false startsWith(“lint”) true ...
2018-09-08 08:39:18
212
原创 Lintcode 421. Simplify Path (Medium) (Python)
Simplify PathDescription:Given an absolute path for a file (Unix-style), simplify it.Example “/home/”, => “/home”“/a/./b/../../c/”, => “/c”Challenge Did you consider the case where p...
2018-09-07 15:15:07
147
原创 Lintcode 137. Clone Graph (Medium) (Python)
Clone GraphDescription:Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.How we serialize an undirected graph:Nodes are labeled uniquely.We use #...
2018-09-07 12:37:39
182
原创 Lintcode 124. Longest Consecutive Sequence (Medium) (Python)
Longest Consecutive SequenceDescription:Given an unsorted array of integers, find the length of the longest consecutive elements sequence.Example Given [100, 4, 200, 1, 3, 2], The longest cons...
2018-09-06 12:35:45
261
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人