- 博客(20)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 LeetCode Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit st
2015-01-31 20:01:14
694
原创 LeetCode 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:Element
2015-01-30 19:29:07
702
原创 LeetCode 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
2015-01-27 15:04:57
687
原创 LeetCode 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:Elements in a triplet (a,b,c
2015-01-26 13:06:53
906
转载 Mybatis 基于Java的持久层框架(二)
Mapper XML 文件MyBatis 的真正强大在于它的映射语句，也是它的魔力所在。由于它的异常强大，映射器的 XML 文件就显得相对简单。如果拿它跟具有相同功能的 JDBC 代码进行对比，你会立即发现省掉了将近 95% 的代码。MyBatis 就是针对 SQL 构建的，并且比普通的方法做的更好。SQL 映射文件有很少的几个顶级元素（按照它们应该被定义的顺序）：cache –
2015-01-24 16:30:49
3362
转载 Mybatis 基于Java的持久层框架(一)
简介什么是 MyBatis ？MyBatis 是支持定制化 SQL、存储过程以及高级映射的优秀的持久层框架。MyBatis 避免了几乎所有的 JDBC 代码和手工设置参数以及抽取结果集。MyBatis 使用简单的 XML 或注解来配置和映射基本体，将接口和 Java 的 POJOs(Plain Old Java Objects,普通的 Java对象)映射成数据库中的记录。
2015-01-24 16:15:30
10209
原创 LeetCode Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.题意:求字符串数组的最长公共前缀思路：首先找到最短的那个作为标尺，然后每次比较。class Solution {public: string longestCommonPrefix(vector &st
2015-01-23 20:26:23
816
原创 LeetCode Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.题意：讲罗马数字转换成阿拉伯数字思路：了解罗马数字的构造后，从后往前处理就行了class Solution {public: int romanToInt(s
2015-01-23 00:17:18
985
原创 Leetcode Integer to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.题意：将阿拉伯数字转换为罗马数字表示思路：首先了解罗马数字的表示，然后就是从大到小找符合的数字了class Solution {public: strin
2015-01-19 14:46:47
755
原创 LeetCode Container With Most Water
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 line i is at (i, ai) and (i, 0). Fin
2015-01-17 23:01:24
768
原创 LeetCode Regular Expression Matching
Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire input st
2015-01-14 11:27:28
811
原创 LeetCode Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of convertin
2015-01-11 23:55:14
856
转载 搜索引擎-网络爬虫
文章转载自: http://blog.csdn.net/hguisu/article/details/7949844 通用搜索引擎的处理对象是互联网网页，目前网页数量以百亿计，搜索引擎的网络爬虫能够高效地将海量的网页数据传下载到本地，在本地 形成互联网网页的镜像备份。它是搜索引擎系统中很关键也很基础的构件。1. 网络爬虫本质就是浏览器http请求。
2015-01-11 10:40:03
737
转载 搜索引擎的技术架构
文章转载自: http://blog.csdn.net/hguisu/article/details/79559851. 搜索引擎的分类搜索引擎按其工作方式主要可分为三种：分别是全文搜索引擎（Full Text Search Engine）目录索引类搜索引擎（Search Index/Directory）元搜索引擎（Meta Search Eng
2015-01-09 11:01:55
753
转载 搜索引擎-倒排索引
文章转载自: http://blog.csdn.net/hguisu/article/details/79623501.单词——文档矩阵 单词-文档矩阵是表达两者之间所具有的一种包含关系的概念模型，图3-1展示了其含义。图3-1的每列代表一个文档，每行代表一个单词，打对勾的位置代表包含关系。
2015-01-09 10:58:40
766
原创 LeetCode String to Integer (atoi)
Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input case
2015-01-08 23:13:57
797
原创 LeetCode Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Show Tags题意：将数
2015-01-07 09:48:50
735
原创 LeetCode 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
2015-01-05 19:04:57
833
原创 LeetCode Longest Palindromic Substring
Longest Palindromic Substring Question Solution Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists
2015-01-03 00:45:25
1051
原创 LeetCode Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link
2015-01-01 17:59:51
1024
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人