- 博客(22)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 LertCode- 27. Remove Element
Description 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 mem
2017-07-26 10:57:05
494
原创 Leetcode-4. Median of Two Sorted Arrays
Description There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1: nums1
2017-07-25 20:47:09
430
原创 LeetCode- 3. Longest Substring Without Repeating Characters
Description Given a string, find the length of the longest substring without repeating characters.Examples:Given “abcabcbb”, the answer is “abc”, which the length is 3.Given “bbbbb”, the answer is “b”
2017-07-24 20:11:02
304
原创 指针与数组
二级指针与二维数组char *string[] ={“abc”,”abcd”,”acf”}; char string[3][4]={“abc”,”abcd”,”acf”}; ` 首先一点的是，虽然二维数组的数组名可以看做是一个指针，但是并不能将二维数组的数组名赋值给一个二级指针，也就是如下的代码int main(void){ int arr[3][3] = {{1,2,3},{4
2017-07-24 08:19:11
293
原创 LeetCode- 125. Valid Palindrome
DescriptionGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, “A man, a plan, a canal: Panama” is a palindrome. “race a car” is
2017-07-24 08:18:24
270
原创 LeetCode-551. Student Attendance Record I
Description You are given a string representing an attendance record for a student. The record only contains the following three characters:‘A’ : Absent. ‘L’ : Late. ‘P’ : Present. A student could
2017-07-24 08:18:01
279
原创 LeetCode-521. Longest Uncommon Subsequence I
Description Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defined as the longest subsequence of one
2017-07-24 08:17:38
242
原创 LeetCode-344. Reverse String
LeetCode-344. Reverse StringDescription Write a function that takes a string as input and returns the string reversed.Example: Given s = “hello”, return “olleh”.题目分析 本题要求返回所给字符串的逆序字符串。解决方法是直接逆序复制字符串
2017-07-24 08:17:07
214
原创 LeetCode-345. Reverse Vowels of a String
DescriptionWrite a function that takes a string as input and reverse only the vowels of a string.Example 1: Given s = “hello”, return “holle”.Example 2: Given s = “leetcode”, return “leotcede”.Note:
2017-07-24 08:16:30
363
原创 LeetCode-541. Reverse String II
Description Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, reverse
2017-07-24 08:15:45
327
原创 LeetCode- 125. Valid Palindrome
DescriptionGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, “A man, a plan, a canal: Panama” is a palindrome. “race a car” is
2017-07-24 08:14:25
205
原创 LeetCode- 125. Valid Palindrome
DescriptionGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, “A man, a plan, a canal: Panama” is a palindrome. “race a car” is
2017-07-23 11:33:32
223
原创 LeetCode-459. Repeated Substring Pattern
Description Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may assume the given string consists of low
2017-07-22 22:40:59
241
原创 LeetCode-434. Number of Segments in a String
Description Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.Please note that the string does not contain any non-printable char
2017-07-22 16:32:17
269
原创 leetcode -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 def
2017-07-22 14:50:20
229
原创 leetcode -14. Longest Common Prefix
问题描述： Write a function to find the longest common prefix string amongst an array of strings.分析： 题目要求为寻找一组字符串的最长相同前缀，如{“abcd”,”abdf”,”abf”},三个字符串前两位“ab”相同,最长前缀位ab。 解体思路：最长相同前缀一定小于等于最短字符串的长度，故先找到最短字符串
2017-07-22 14:49:37
406
原创 LeetCode-67. Add Binary
问题描述Given two binary strings, return their sum (also a binary string). For example, a = “11” b = “1” Return “100”.分析题目要求完成两个二进制的加法，加数与被加数分别来源于两个字符串，最终加和结果以二进制字符串形式返回。解题思路（1）二进制加法与十进制加法类似，从低位开始加和，直到
2017-07-22 14:48:42
225
原创 LeetCode-557. Reverse Words in a String III
问题描述 Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.Example 1:Input: "Let's take LeetCode contest"
2017-07-22 14:47:37
331
原创 字符指针与字符数组
字符指针定义及初始化： char *strs="Hello,world!"char *strs;str = "Hello,world!";字符串中的所有字符在内存中是连续排列的，strs指向的是字符串的第0个字符(从零开始)；我们通常将第0个字符的地址称为字符串的首地址。字符串中每个字符的类型都是char，所以 str 的类型也必须是char *。访问方法：printf("%s\n",strs)
2017-07-22 14:45:46
459
原创 LeetCode-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 constructed from the magazines
2017-07-22 14:43:59
356
转载 Conversational Speech Transcription Using Context-Dependent Deep Neural Networks
AbstractWe apply the recently proposedContext-Dependent DeepNeural-Network HMMs, or CD-DNN-HMMs, to speech-to-texttranscription. For single-pass speaker-independent recognition on the RT03SFisher po
2015-08-24 15:43:42
901
转载 Context-Dependent Pre-Trained Deep Neural Networks for Large-Vocabulary Speech Recognition
Abstract—We propose a novel context-dependent (CD) model for large-vocabulary speech recognition (LVSR) that leverages recent advances in using deep belief networks for phone recognition. We describe a
2015-07-08 10:56:17
1756
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人