2016年08月_Yingying_code

原创 15. 3Sum**

Given an array S of n integers, are there elements a,b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set must not contain du

2016-08-31 20:19:35 228

原创 228. Summary Ranges**

Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].My code:class Solution(object): def summaryRang

2016-08-31 17:01:08 165

原创 119. Pascal's Triangle II*

Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use only O(k) extra space?

2016-08-31 16:27:20 170

原创 118. Pascal's Triangle*

Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]My code:class Solution(o

2016-08-31 15:56:38 184

原创 Active learning by querying informative and representative examples

主题：QUIRE，基于active-learning的最小－最大原则，实现信息量大而具有代表性的数据筛选。Informativeness： measures the ability of an instance in reducing the uncertainty of a statistical model.忽视了数据间的潜在结构分布。Representativeness: meas

2016-08-30 13:51:44 784 2

原创 167. Two Sum II - Input array is sorted**

Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers

2016-08-29 21:32:27 389

原创 88. Merge Sorted Array*

Given two sorted integer arrays nums1 and nums2, merge nums2 intonums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal tom + n) to hold addit

2016-08-29 21:03:52 334

原创 27. Remove Element*

Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.The

2016-08-29 20:44:20 299

原创 66. Plus One*

Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.My code:class Solution

2016-08-29 20:16:53 311

原创 219. Contains Duplicate II *

Given an array of integers and an integer k, find out whether there are two distinct indicesi and j in the array such that nums[i] = nums[j] and the difference betweeni and j is at most k.My cod

2016-08-29 19:36:56 294

原创Ａｃtive learning ｌiterature Survey

Three main active learning scenarios

2016-08-29 11:17:37 1127

转载多任务深度学习代码

转载自：多任务深度学习基于Caffe实现多任务学习的小样例本节在目前广泛使用的深度学习开源框架Caffe的基础上实现多任务深度学习算法所需的多维标签输入。默认的，Caffe中的Data层只支持单维标签，为了支持多维标签，首先修改Caffe中的convert_imageset.cpp以支持多标签：这样我们就有了多任务的深度学习的基础部分数据输入。为了向上兼容Caffe框架，本文摒弃了部分

2016-08-29 11:09:56 4454 2

原创 153. Find Minimum 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).Find the minimum element.You may assume no duplicate exists in the arra

2016-08-28 19:57:50 390

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is

2016-08-28 16:59:26 327

原创 169. Majority Element*

Given an array of size n, find the majority element. The majority element is the element that appearsmore than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element alw

2016-08-28 16:28:24 337

原创 238. Product of Array Except Self **

Given an array of n integers where n > 1, nums, return an arrayoutput such that output[i] is equal to the product of all the elements ofnums except nums[i].Solve it without division and in O(n).

2016-08-28 15:45:53 427

原创 283. Move Zeroes *

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your

2016-08-28 15:31:23 370

原创 26. Remove Duplicates from Sorted Array *

Given a sorted array, remove the duplicates in place such that each element appear onlyonce and return the new length.Do not allocate extra space for another array, you must do this in place with

2016-08-27 17:09:04 365

转载 RNN 调参经验

作者：萧瑟链接：https://www.zhihu.com/question/41631631/answer/94816420来源：知乎著作权归作者所有，转载请联系作者获得授权。调了快1年的rnn, 深刻的感受到,深度学习是一门实验科学,下面是一些炼丹心得. 后面会不断补充. 有问题的地方,也请大家指正.参数初始化,下面几种方式,随便选一个,结果基本都差不多.

2016-08-26 09:31:46 10338 3

原创 Discriminative unsupervised feature learning with convolutional neural networks

NIPS2014思路：将unlabeled 图像进行旋转、平移、增强等操作，组成不同的数据集合（同一图像生成的图像为同一数据集合）。利用CNN 将不同数据集合区分开。目标：区分不同图像，保证平移等变换的鲁棒性。网络结构：small: two convolutional layers with 64 filters each followed by a fully conne

2016-08-25 14:53:46 2349

转载 CVPR 2016论文快讯：目标检测领域的新进展

转载自：目标检测领域的新进展－孔涛前言 2016年的CVPR会议目标检测（在这里讨论的是2D的目标检测，如图1所示）的方法主要是基于卷积神经网络的框架，代表性的工作有ResNet[1]（Kaiming He等）、YOLO[5]（Joseph Redmon等）、LocNet[7]（Spyros Gidaris等）、HyperNet[3]（Tao Kong等）、ION[2]（Sean

2016-08-24 15:04:24 1634

原创 Embedding label structures for fine-grained features representation

Two contributions1. jointly optimize the classification loss(softmax) and the similarity loss(triplet) om CNN, which can generate both categorization resultsand discriminative feature representat

2016-08-22 14:55:05 932 1

原创 Facial landmark detection by deep multi-task learning

Main task: facial landmark detectionAuxiliary tasks: head pose estimation, gender classification, age estimation, facial expression recognition, facial attribute inferenceChallenges:1. different

2016-08-22 14:53:30 607

原创多任务深度学习

阅读材料原文链接多任务的信息还可以从不同层进行判断，例如衣服颜色信息可以从低层进行判断，而穿衣风格的信息要从高层进行判断待阅读论文Multi-task Learning（１９９７）Attributes for Improved Attributes: A Multi-Task Network for Attribute Classificatio

2016-08-22 10:31:38 1687

转载我的算法学习之路

转载自：点击打开链接关于严格来说，本文题目应该是我的数据结构和算法学习之路，但这个写法实在太绕口——况且CS中的算法往往暗指数据结构和算法（例如算法导论指的实际上是数据结构和算法导论），所以我认为本文题目是合理的。这篇文章讲了什么？我这些年学习数据结构和算法的总结。一些不错的算法书籍和教程。算法的重要性。初学第一次接触数据结构是在大二下学期的数据结构课程。然而这

2016-08-18 18:30:03 407

原创 383. Ransom Note*

Given  an  arbitrary  ransom  note  string  and  another  string  containing  letters from  all  the  magazines,  write  a  function  that  will  return  true  if  the  ransom   note  can  be  constru

2016-08-12 20:54:57 270

原创 343. Integer Break

Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, ret

2016-08-12 16:35:05 170

原创 242. Valid Anagram*

Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.My code:clas

2016-08-12 15:46:41 156

原创 313. Super Ugly Number **

Write a program to find the nth super ugly number.Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. For example, [1, 2, 4, 7, 8, 13,

2016-08-12 11:24:06 213

原创 264. Ugly Number II**

Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first

2016-08-11 21:18:24 174

原创 263. Ugly Number

class Solution(object): def isUgly(self, num): """ :type num: int :rtype: bool """ if num ==1: return True if num<=0: return

2016-08-11 20:32:45 142

原创 35. 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.

2016-08-11 18:22:32 229

原创 12. Integer to Roman **

Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.My code:class Solution(object): def intToRoman(self, num): """

2016-08-11 18:01:05 157

原创 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.My code:class Solution(object): def romanToInt(self, s): """ :

2016-08-11 17:34:32 134

原创 268. Missing Number

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given nums = [0, 1, 3] return 2.Note:Your algorithm sho

2016-08-11 16:53:18 147

原创 231. Power of Two *

Given an integer, write a function to determine if it is a power of two.My code:import mathclass Solution(object): def isPowerOfTwo(self, n): """ :type n: int :rtype:

2016-08-11 10:42:34 201

转载 operator库

原文：operator这个模块提供了一系列的函数操作。比如，operator.add(x, y)等于x+y a = [1,2,3]b = [5,6,7]c = map(operator.mul, a, b)c的值就为[5, 12, 21] abs(...) abs(a) -- Same as abs(a).

2016-08-10 20:19:29 440

转载 reduce

原文： python中的reducepython中的reduce内建函数是一个二元操作函数，他用来将一个数据集合（链表，元组等）中的所有数据进行下列操作：用传给reduce中的函数 func()（必须是一个二元操作函数）先对集合中的第1，2个数据进行操作，得到的结果再与第三个数据用func()函数运算，最后得到一个结果。如：Python代码def myadd(x

2016-08-10 20:18:37 221

原创 136. Single Number **

Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using e

2016-08-10 16:28:36 157

原创 338. Counting Bits **

Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.Example:For num = 5

2016-08-10 15:24:32 206

空空如也

空空如也