*博客头图：

RGB颜色，例如：#AFAFAF

Hover：

RGB颜色，例如：#AFAFAF

RGB颜色，例如：#AFAFAF

# baoendemao的专栏

• 博客(480)
• 资源 (40)
• 论坛 (4)

#### 转载 leetcode(44) - Wildcard Matching

2016-12-01 21:45:00 394

#### 转载 leetcode(43) - Multiply Strings

2016-11-30 23:04:31 389

#### 原创 leetcode(42) - Trapping Rain Water

2016-11-29 15:28:25 418

#### 转载 深度优先搜索(DFS)

1.前言深度优先搜索（缩写DFS）有点类似广度优先搜索，也是对一个连通图进行遍历的算法。它的思想是从一个顶点V0开始，沿着一条路一直走到底，如果发现不能到达目标解，那就返回到上一个节点，然后从另一条路开始走到底，这种尽量往深处走的概念即是深度优先的概念。你可以跳过第二节先看第三节，:)2.深度优先搜索VS广度优先搜索2.1演示深度优先搜索的过程还是引用上篇文

2016-11-27 23:19:41 427

#### 转载 leetcode(39 40) - Combination Sum I/I I

2016-11-27 23:01:05 274

#### 转载 leetcode(38) - Count and Say

2016-11-25 21:49:36 278

#### 转载 leetcode(36) - Valid Sudoku 数独

Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially fille

2016-11-23 20:03:36 332

#### 原创 leetcode(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-11-22 21:47:13 263

#### 原创 leetcode(34) - Search for a Range

Given a sorted array of integers, 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 is not found in

2016-11-22 00:28:33 277

#### 原创 leetcode(33) - Search in Rotated Sorted Array

int find(int* nums, int start, int end, int target) { if (start>end) return -1; int mid=0; while(start <= end){ mid=(start+end)/2; if (nums[mid] < target){

2016-11-21 23:59:38 230

#### 转载 leetcode(32) - Longest Valid Parentheses 最长有效括号对

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()", which

2016-11-21 21:03:09 269

#### 转载 leetcode(31) - Next Permutation

【题目】Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest

2016-11-18 21:24:56 300

#### 转载 LeetCode(29) - Divide Two Integers

Problem:Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.Solution:不能乘除就加减就行了，但是一个问题是加减有可能速度太慢，因此需要转换，由于任何一个数都能表示成二进制，所以有d

2016-11-17 23:48:43 260

#### 转载 leetCode(30) - Substring with Concatenation of All Words

Problem:You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in wordsexac

2016-11-17 23:46:40 204

#### 原创 leetcode (28) - Implement strStr()

strstr(str1,str2) 函数用于判断字符串str2是否是str1的子串。如果是，则该函数返回str2在str1中首次出现的地址；否则，返回NULL。int strStr(char* haystack, char* needle) { int i = 0, j=0, index=0; int found=0, flag=0;

2016-11-15 16:23:39 323

#### 原创 leetcode(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.

2016-11-14 17:16:27 316

#### 原创 leetcode (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-11-13 13:59:16 216

#### 转载 leetcode (25) - Reverse Nodes in k-Group

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.

2016-11-13 13:58:01 276

#### 原创 leetcode(24) - Swap Nodes in Pairs

Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. Y

2016-11-11 15:53:03 379

#### 转载 leetcode (23) - Merge k Sorted Lists

2016-11-10 22:07:28 292

#### 原创 leetcode (23) - Merge k Sorted Lists

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.借用了之前的两个已排序链表合并的代码，再依次遍历所有链表，进行两两合并，方法有点弱智，下篇转载一下别人的想法/** * Definition for singly-linke

2016-11-10 21:59:05 286

#### 转载 leetcode (22) - Generate Parentheses

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()(())",

2016-11-09 20:43:37 242

#### 转载 linux中fork（）函数详解

2016-11-08 14:47:20 164

#### 原创 leetcode (21) - Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists./** * Definition for singly-linked list. * struct L

2016-11-08 09:02:06 157

#### 原创 leetcode (20) - Valid Parentheses

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all va

2016-11-07 14:37:52 212

#### 转载 leetcode (19) - Remove Nth Node From End of List

/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */struct ListNode* removeNthFromEnd(struct ListNode* head, int n) { if(head

2016-11-06 11:38:09 131

#### 原创 leetcode (18) - 4Sum

Given an array S of n integers, are there elements a,b, c, and d in S such that a + b +c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note: The solution s

2016-11-06 10:45:11 191

#### 转载 leetcode (17) - Letter Combinations of a Phone Number

void getLetterCom(char** res,char* digits,char* tmp,int index,char map[10][5],int *top){ int i,digit=digits[index]-'0'; char* letters; if(digits[index]==0){ letters=(char*)malloc(si

2016-11-04 13:16:13 220

#### 原创 leetcode (16) - 3Sum Closest

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact

2016-11-03 13:15:15 159

#### 转载 leetcode (15) - 3sum

void sort(int *a, int left, int right){ if(left >= right) { return ; } int i = left; int j = right; int key = a[left]; while(i < j) { while(i < j && key <=

2016-11-02 22:33:52 131

#### 原创 leetcode (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-11-02 22:31:32 273

#### 原创 leetcode (14) - Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.char* longestCommonPrefix(char** strs, int strsSize) { int min_length = 0, min_index=0, i, j,tmp ;

2016-11-01 17:44:19 195

#### 转载 leetcode (13) - ROMAN TO INT

class Solution {public: int romanToInt(string s) { int ret = toNumber(s[0]); for (int i = 1; i < s.length(); i++) { if (toNumber(s[i - 1]) < toNumber(s[i])) {

2016-11-01 16:13:34 160

#### 转载 leetcode (12) - INT TO ROMAN

Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.思路首先，学习一下罗马数字，参考罗马数字罗马数字是最古老的数字表示方式，比阿拉伯数组早2000多年，起源于罗马罗马数字有如下符号：基本字

2016-11-01 13:56:41 133

#### 转载 leetcode (11) - Container With Most Water

2016-10-30 23:12:44 253

#### 转载 leetcode(10) - Regular Expression Matching 正则表达式匹配

. 表示匹配任意字符* 表示匹配0个或多个字符bool isMatch(char* s, char* p) { if (*p == '\0') return *s == '\0'; // next char is not '*', then must match current character if (*(p + 1) != '*') {

2016-10-26 23:42:43 548

#### 原创 leetcode (9) - Palindrome Number 整数回文

bool isPalindrome(int x) { bool is_flag=true; int reverse=0; int tmp=x; while(tmp) { if (reverse > (INT_MAX - tmp%10)/10 ) return false; reverse = revers

2016-10-25 20:06:08 157

#### 原创 leetcode (8) - String to Integer

int myAtoi(char* str) { int length = strlen(str); int ret=0; int i=0; bool handle_flag=true; int plus_flag=0; int minus_flag=0; int ch=0; long ch_long=0;

2016-10-24 22:23:51 196

#### 转载 leetcode (6) - ZigZag Conversion

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I I

2016-10-23 23:16:12 167

#### 转载 leetcode (5) - Longest Palindromic Substring 最长回文子串

2016-10-23 22:50:09 163

#### Delicious标签数据集

Delicious标签数据集 ， 每一条是一个三元组（用户，url， 标签），可用于标签推荐系统的研究以及数据挖掘方向的研究。

2014-04-21

2014-04-15

2014-04-15

#### W3school.chm 帮助文档

W3school.chm 帮助文档，学习web前端的最好的帮助文档

2014-01-08

#### JScript参考手册.chm 帮助文档

JScript参考手册.chm 帮助文档

2014-01-08

#### HTML入门与提高.CHM

HTML入门与提高.CHM 帮助文档

2014-01-08

2014-01-08

2014-01-08

2014-01-08

2014-01-08

2014-01-08

#### lucene-core-3.4.0.jar

lucene-core-3.4.0.jar ,里面关于apache搜索引擎lucence的一些调用类

2013-12-05

#### commons-configuration-1.6.jar

commons-configuration-1.6.jar ，apache的一些类里面都有

2013-12-05

#### activation-1.1.jar

activation-1.1.jar，很多类可以调用

2013-12-05

2013-12-05

2013-12-05

#### C# office.dll

c# 的office函数库，添加到引用即可使用

2013-12-05

#### C# Excel函数库 EXCEL.DLL

c# Excel.dll 添加到引用即可使用

2013-12-05

#### c#和API的帮助文档

c# API帮助大家更好的学习c#，希望对大家有所帮助

2013-02-22

#### MyEclips快捷键大全

MyEclipse的快捷键开发大全，帮助熟练运用MyEclipse的快捷键

2013-01-25

#### Dos命令图解教程

DOS的命令图解教程，更加生动活泼，帮助记忆

2013-01-25

#### MFC的类库帮助文档

MFC的类库详解，对于MFC的开发很有帮助，这个MFC的类库帮助文档很好用

2013-01-25

#### MyEclipse8.5注册机自动产生序列号

MyEclipse8.5的注册机，自动产生序列号，以后可以终身使用MyEclipse8.5，不会再出现提示购买。

2013-01-25

#### tsp的贪心回溯算法

TSP是当下一个热门问题。希望对大家有所帮助。

2012-05-14

#### Tsp的算法求解

TSP问题是当下的一个热门问题，如何能用最短路径走完全部的城市。希望对大家有所帮助。

2012-05-14

#### gis中最短路径算法的实现

GIS中最短路径算法的实现，希望对大家有所帮助、

2012-04-24

2012-04-24

2012-04-24

2012-04-24

2012-04-24

#### 如何用floyd算法来求最短路径问题

floyd算法是求解最短路径的一种经典算法，本文分析了它求解最短路径的具体实现方法和效率，希望对大家对floyd算法有所了解。

2012-04-24

2012-04-24

2012-04-24

2012-04-24

2019-03-21

#### CSS揭秘 中文PDF

CSS揭秘，中文PDF，LEA VEROU著，CSS魔法译，人民邮电出版社。豆瓣评分9.3，学习CSS的好书，免积分下载。

2017-01-16

#### 《Bootstrap实战》随书源码 （李松峰译，只有源码，不含PDF）

《Bootstrap实战》随书源码，David Cochran著，李松峰译，人民邮电出版社。压缩包里只有源码，没有电子书PDF。

2017-01-16

#### leetcode算法题答案PDF

leetcode算法题的答案PDF，C++编写的，有详细的算法逻辑分析。

2016-10-14

2016-10-14

2016-10-14