algorithm
jzbgld
这个作者很懒,什么都没留下…
展开
-
最长回文子串 Manacher算法--O(n)回文子串算法
O(n)回文子串算法注:转载的这篇文章,我发现下面那个源代码有点bug。。。在下一篇博客中改正了。。 这里,我介绍一下O(n)回文串处理的一种方法。Manacher算法.原文地址:http://zhuhongcheng.wordpress.com/2009/08/02/a-simple-linear-time-algorithm-for-finding-lo转载 2014-09-05 16:36:08 · 416 阅读 · 0 评论 -
Generate Parentheses 生成有意义的括号对
Qusetion: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:"((()))", "(()())", "(())()",原创 2014-10-23 22:04:21 · 326 阅读 · 0 评论 -
不用乘法、除法及取模运算,构造两个整数的除法
Question:Divide two integers without using multiplication, division and mod operator原创 2014-10-29 16:51:16 · 1131 阅读 · 1 评论 -
给定一个无序整形数组,找出其中所以三个数之和为0的所有组合
/** * @author Liudong * @time 09/26/2014 * @function 3Sum * * title: * 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 t原创 2014-09-27 13:12:24 · 2584 阅读 · 0 评论 -
一个有意思的算法,Container With Most Water
题目:Title: 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原创 2014-09-25 15:34:14 · 360 阅读 · 0 评论 -
关于递归的理解,understanding about recursive
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below binary tree and sum = 22, 5 / \原创 2014-12-15 22:02:34 · 341 阅读 · 0 评论 -
Given preorder and inorder traversal of a tree, construct the binary tree.
题目:利用先序遍历和中序遍历,构造一个二叉树!例如:Inorder Traversal:{3,1,7,4,0,5,8,2,6};Preorder Traversal:{0,1,3,4,7,2,5,8,6};思路:先序遍历,第一个元素为根节点,以此元素把中序数组分成两个字数组,即为root的左右子树!原创 2014-12-04 23:07:11 · 1599 阅读 · 0 评论 -
Reverse a LinkedList 链表倒置
两种方法倒置一个链表1. 递归亮点在于构建一个假的head:newHead,代码如下:class RecursivelyReverseLinkedList{ ListNode newHead = new ListNode(0); public ListNode reverseList(ListNode head) { if(head == null) {原创 2015-06-16 17:05:50 · 518 阅读 · 0 评论 -
java中5种字符串拼接方法
import org.apache.commons.lang.StringUtils;public class CutString { //性能最差 public String testPlus() { String s = ""; for (int i = 0; i < 10000; i++) {转载 2014-09-25 16:18:22 · 929 阅读 · 0 评论