2017年04月_liuchongee

原创 leetcode题解-40. Combination Sum II && 216. Combination Sum III

40，题目：Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combinat

2017-04-29 19:04:03 1064

原创字符级卷积神经网络（Char-CNN）实现文本分类--模型介绍与TensorFlow实现

本篇博客主要用于记录“Character-level Convolutional Networks for Text Classification”论文的模型架构和仿真实现方法。这是一篇2016年4月份刚发的文章，在此之前，原作者还发表过一篇“Text Understanding from Scratch”的论文，两篇论文基本上是一样的，不同之处在于后者从写了Introduction部分，然后又补充

2017-04-29 14:51:39 42262 40

原创 leetcode题解-39. Combination Sum

题目：Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from

2017-04-28 11:07:43 948

原创 leetcode题解-34. Search for a Range

题目:Given an array of integers sorted in ascending order, 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

2017-04-27 18:47:25 514

原创使用TensorFlow实现RNN模型入门篇1

最近在看RNN模型，为简单起见，本篇就以简单的二进制序列作为训练数据，而不实现具体的论文仿真，主要目的是理解RNN的原理和如何在TensorFlow中构造一个简单基础的模型架构。其中代码参考了这篇博客。数据集首先我们看一下实验数据的构造：输入数据X：在时间t，Xt的值有50%的概率为1，50%的概率为0；输出数据Y：在实践t，Yt的值有50%的概率为1，50%的概率为0，除此之外，如果`Xt-3

2017-04-27 13:04:05 17503 12

原创 leetcode题解-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"].题目很简单，对数组作总结，返回一个字符串链表。使用left游标记录当前连续数的最小值即可。需要注意的是，如果是

2017-04-26 09:41:02 975

原创 leetcode题解-64. Minimum Path Sum

题目：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 down or right at a

2017-04-25 11:48:22 879

原创 leetcode题解-79. Word Search

题目：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 or vertically n

2017-04-24 22:45:10 1196

原创 leetcode题解-561. Array Partition I && 62. Unique Paths && 63. Unique Paths II

561,题目：Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large a

2017-04-24 15:24:47 1785

原创 leetcode题解-80. Remove Duplicates from Sorted Array II

题目：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, with the first five eleme

2017-04-21 10:54:20 945

原创循环神经网络RNN在自然语言处理领域的应用

之前看的论文都是基于CNN在NLP上的应用，但其实深度学习与NLP结合的领域中应用最广的应该是RNN，因为文本可以直观地被表示为输入序列，方便的被RNN处理，捕获其Long-Term依赖等信息，而且实际应用中也取得了很好的效果。之前虽然主要研究CNN，但同时也看了很多关于RNN、LSTM、GRU等模型原理的介绍，使用方法，也读过一些代码。本篇博客作为RNN与NLP领域开启的第一篇，主要介绍一下之前看

2017-04-21 08:58:36 12395

原创 leetcode题解-33. Search in Rotated Sorted Array && 81. Search in Rotated Sorted Array II

31，题目：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).You are given a target value to search. If found in

2017-04-20 16:41:24 1020

原创 Language Modeling with Gated Convolutional Networks(句子建模之门控CNN）--Tensorflow实现篇

由于本篇论文所实现的任务十分耗时，我的小笔记本根本无法承受其计算量，而且他不像之前实现的模型都有明确的评价指标，所以并未亲自实现。在github上面找到了一个简化版的实现代码，该代码中在数据处理、模型评价等方面做了如下简化：Replace NCE loss with Adaptive Softmax.Remove restricted training on fixed sized senten

2017-04-20 10:19:45 4996 1

原创 leetcode题解-289. Game of Life

题目：According to the Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970."Given a board with m by n

2017-04-19 15:30:02 1184

原创 Language Modeling with Gated Convolutional Networks(句子建模之门控CNN）--模型简介篇

最近忙着实验室的项目，一直没有时间做仿真，所以就先写一下之前看的一篇文章，总结一下吧。这次要说的是Gated CNN，这也是第一次将门限控制引入到CNN中的文章，感觉十分有新意，效果也很棒。下面我们来看一下，文章的主要贡献包括：提出一种新的门控机制缓解梯度传播，降低梯度弥散等现象相比LSTM，模型更加简单，收敛速度更快模型的结构图如下所示：首先我们可以通过堆叠CNN来标识长文本，提

2017-04-19 11:17:01 15785 6

原创 leetcode题解-78. Subsets && 90. Subsets II

78，题目：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:[ [3], [1], [2],

2017-04-18 22:08:57 954

原创 leetcode题解-105 && 106. Construct Binary Tree from Preorder (PostOrder) and Inorder Traversal

其实这两道题目就是从二叉树的前序遍历（后序遍历）和中序遍历数组中恢复出二叉数即可。我们知道二叉树的三种遍历方法后本题就变得很简单了。先序遍历：若二叉树为空，则不进行任何操作：否则 1、访问根结点。 2、先序方式遍历左子树。 3、先序遍历右子树。中序遍历：若二叉树为空，则不进行任何操作

2017-04-17 22:12:30 1121

原创 leetcode题解-120. Triangle

题目：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [6,5,7

2017-04-17 11:56:56 1435

原创 leetcode题解-287. Find the Duplicate Number

题目：Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number,

2017-04-17 10:00:17 939

原创 leetcode题解-532. K-diff Pairs in an Array

题目：Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), where i and j are both numbers

2017-04-15 15:52:47 2931 3

原创 leetcode题解-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 fu

2017-04-15 13:26:01 866

原创 leetcode题解-414. Third Maximum Number

题目：Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).Example 1:Input: [3, 2, 1]Ou

2017-04-14 09:29:32 804

原创 leetcode题解-53. Maximum Subarray && 448. Find All Numbers Disappeared in an Array

题目：Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the contiguous subarray [4,-1,2,1] has t

2017-04-13 12:00:36 621

原创 leetcode题解-88. Merge Sorted Array

题目：Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold addition

2017-04-12 19:53:45 580

原创 leetcode题解-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

2017-04-11 13:18:36 808

原创使用TensorFlow实现余弦距离/欧氏距离（Euclidean distance）以及Attention矩阵的计算

最近在使用tensorflow完成句子相似度建模等任务时常常会用到各种距离的计算，而且有很多论文提出了Attention机制，所以这里就介绍一下如何使用tensorflow实现上述各种功能。这里首先假定我们的输入是两个四维的Tensor，然后我们需要计算的是其中某个维度的距离。比如说我们的输入是batch个句子，句长是sent_len, 每个词被表示成embed_size的词向量。所以我们的输入

2017-04-11 11:21:34 34457 1

原创 leetcode题解-169. Majority Element && 189. Rotate Array

Majority Element 题目：Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majo

2017-04-10 16:39:19 460

原创 leetcode题解-26. Remove Duplicates from Sorted Array && 27. Remove Element

Remove Duplicates from Sorted Array，题目：Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another arr

2017-04-10 15:24:49 462

原创 leetcode题解-121. Best Time to Buy and Sell Stock && 122. Best Time to Buy and Sell St && 66. Plus One

今天的两道题都很简单，就直接在一篇博客里进行记录即可。首先说一下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

2017-04-09 20:54:02 403

原创 leetcode题解-485. Max Consecutive Ones

题目：Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Input: [1,1,0,1,1,1] Output: 3Explanation: The first two digits or the last three digits are consecutive 1s

2017-04-08 21:04:55 521

原创 leetcode题解-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 should run in

2017-04-08 20:20:07 591

原创 leetcode题解-118. Pascal's Triangle && 119. Pascal's Triangle II

一个清明节过的我都已经凌乱了==之前的学习状态也需要好好调整回来了。假期之前把HashTable的题目刷完了，现在想把以前刷过的Array的题目再刷一遍，总结一下。恩题目：Given numRows, generate the first numRows of Pascal’s triangle. For example, given numRows = 5, Return [

2017-04-08 11:03:52 517 2

原创 ABCNN基于注意力的卷积神经网络用于句子建模--模型介绍篇

本文是Wenpeng Yin写的论文“ABCNN: Attention-Based Convolutional Neural Network for Modeling Sentence Pairs”的阅读笔记。其实该作者之前还发过一篇“Convolution Neural Network for Paraphrase Identification”。ABCNN是基于之前发的这篇论文加入了注意力机制。

2017-04-07 19:51:41 17062 4

原创 TensorFlow调试功能初试

之前在pycharm里面进行tf程序的调试一直会报错，不过前几天通过命令行的方式完成了调试。所以我大概经过了这样一个曲折的经历：网上下了代码命令行没办法调试(当时不太懂，反正不知道卡在哪一步调试失败)–>在编译器里不能调试–>查资料改各种配置还是不能运行–>偶然在命令行下调试成功== 真的是费尽周折还是以最简单的方式解决战斗。好吧，其实真的调试完之后其实发现很简单。也可能是现在还没有什么实际的

2017-04-06 17:42:25 12013

呜呜哈的博客