yongheng5871-CSDN博客

原创计蒜客2015 初赛题解及代码

2015 计蒜客初赛题解标签（空格分隔）： ACM—题解思路工作区的颜值选择简单数据暴力代码#include <iostream>#include <cstdio>using namespace std;const int Maxn = 2, Maxm = 3;int C[Maxn][Maxm], U[Maxn][Maxm], W[Maxn][Maxm];int n, m, k;i

2016-06-14 23:04:05 616

原创 Dirichlet Process

Dirichlet Process标签（空格分隔）： LDA DMM DP Dirichlet Dirichlet-Process作者：王琳(大连理工大学信息检索研究室)写在前头对于非参数化的机器学习模型，我之前研究的并不多。通过这几天的学习，简单总结一下我所了解到的非参数化的模型。鉴于非参数化的学习模型涉及大量的概率计算，晦涩难懂，然而在这篇总结材料中，我并不细推每个公式，而是

2016-05-14 14:43:36 15688

原创 Leetcode 5: Longest Palindromic Substring

ProblemGiven a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.AnswerComplexity: O(

2015-07-16 08:50:48 524

原创 Leetcode 4: Median of Two Sorted Arrays

ProblemThere 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)).AnswerComplexity: O(log

2015-07-15 14:11:24 409

原创 Leetcode 3: Longest Substring Without Repeating Characters

ProblemGiven a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3

2015-07-15 10:27:58 429

原创 Leetcode 2:Add Two Numbers

ProblemYou 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

2015-07-15 10:11:44 337

原创 LeetCode 1: Two Sum

LeetCode 1: Two SumProblemGiven an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add

2015-07-14 20:05:13 353

原创后缀树

这道题是codechef上九月月赛的一道压轴题目，题意很简单，就是时时刻刻求一个字符串的所有不同字串个数，支持动态末尾添加字符与前端删除字符功能。题目链接： http://www.codechef.com/problems/TMP01/以前还以为后缀自动机可以秒杀一切字符串，后来才发现自己是那样的天真。无论是后缀数组还是后缀树或者是后缀自动机，他们可以说都是处理字符串题目的一个非常强

2013-09-22 12:50:43 1026

yongheng5871的专栏