小怪孩的成长之路

以前都是用C++对中文进行分词，也用过Python的“结巴”分词，最近用了一下Java的Ansj中文分词，感觉还不错。下面是用Ansj对中文进行分词的一个简单例子，希望能对大家有用。1.下载Ansj的相关jar包要用Ansj进行中文分词，必须先下载Ansj的jar包，下载地址可以参考：https://github.com/NLPchina/ansj_seg2.程序代

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.Symbol　　　　ValueI　　　　　　　　1V　　　　　　　　5X　　　　　　　　10L　　　　　　　　50C　　　　　　　　100D...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.Symbol　　　　ValueI　　　　　　　　1V　　　　　　　　5X　　　　　　　　10L　　　　　　　　50C　　　　　　　　100D...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Write a function to find the longest common prefix string amongst an array of strings.If there is no common prefix, return an empty string "".Example 1:Inpu...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.Do not allocate extra space for ano...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：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:[　“((()))...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integer...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given an array nums and a value val, remove all instances of that value in-place and return the new length.Do not allocate extra space for another array, you m...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.Return the quotient after dividing dividen...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Implement strStr().Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Example 1:Input: haystack = “hell...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：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 o...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it mus...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.Example 1:Input: “(()”Ou...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：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 giv...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.Your algorithm’s runtime complexity mu...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：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 m...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.A mapping of digit to letters (jus...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.k is a positive integer and is less than or equal to the lengt...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given a linked list, swap every two adjacent nodes and return its head.Example:Given 1->2->3->4, you should return the list as 2->1->4->3....

今天用MyEclipse复制一个已经存在的项目，并将名字修改成另外一个项目时，出现了一个问题困扰我多时，后来终于解决了。1.问题描述复制并修改名字后，部署到Tomcat上跑，结果发现运行时都是复制前的那个项目的名字，修改后的项目的名字完全没有起到作用。2.解决办法点击新的项目名，右键->Properties->MyEclipse->Web，将Web Context-

当需要把在Windows上开发的Java程序用在Linux上运行时，就需要吧该Java程序打包成jar包上传到Linux上去运行。1.Java程序打包成可运行的jar包2.打包后的jar包在Linux上运行

1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述： Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc...

1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述： Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input wo...

1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述： 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 s...

1. 题目描述：Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example: Input: “babad” Output: “bab” Note: “aba” is also a va...

1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述： 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 co...

1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：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 fo...

1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given a 32-bit signed integer, reverse digits of an integer.Example 1: Input: 123 Output: 321Example 2: Input: -123 Output: -321...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.Example 1:Input: 121Output: trueExampl...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Implement atoi which converts a string to an integer.The function first discards as many whitespace characters as necessary until the first non-whitespace char...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'.‘.’ Matches any single character.‘*’ Matches ...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given a linked list, remove the n-th node from the end of list and return its head.Example:Given linked list: 1->2->3->4->5, and n = 2.After rem...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given n non-negative integers a[1], a[2], …, a[n] , where each represents a point at coordinate (i, a[i]). n vertical lines are drawn such that the two endpoint...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if:Open bracke...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：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.Example:Input: 1...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.Example:Input:[　1->4->5,　1->3->4,　2->6]...

文章目录1. 题目描述：2. 思路分析：3. Java代码：1. 题目描述：Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:Each row must contain the digits 1-9 wit...