<commit_before>---
layout: post
location: Shanghai, China
tldr: false
audio: false
categories: algorithm leetcode
---
<a url="http://teisei.github.io/algorithm/2015/02/10/Dynamic-Programming/">

### Dynamic Programming

</a>

	- 32. Longest Valid Parentheses
	- 53. Maximum Subarray
	- 62. Unique Paths
	- 63. Unique Paths II
	- 64. Minimum Path Sum


## References
https://docs.google.com/spreadsheet/pub?key=0Aqt--%20wSNYfuxdGxQWVFsOGdVVWxQRlNUVXZTdEpOeEE&output=html



{% highlight java %}
public class Teisei {
    public static void main(String args[]){
        System.out.println("Hello world! This is Teisei's blog");
    }
}
{% endhighlight %}<commit_msg>6.3 . 1<commit_after>---
layout: post
location: Shanghai, China
tldr: false
audio: false
categories: algorithm leetcode
---

### [Dynamic Programming][dp]

[dp]:	http://teisei.github.io/algorithm/2015/02/10/Dynamic-Programming/

	- 32. Longest Valid Parentheses
	- 53. Maximum Subarray
	- 62. Unique Paths
	- 63. Unique Paths II
	- 64. Minimum Path Sum


### [Divide and Conquer][dc]

[dc]:	http://teisei.github.io/algorithm/2015/02/10/Dynamic-Programming/



## References
https://docs.google.com/spreadsheet/pub?key=0Aqt--%20wSNYfuxdGxQWVFsOGdVVWxQRlNUVXZTdEpOeEE&output=html



{% highlight java %}
public class Teisei {
    public static void main(String args[]){
        System.out.println("Hello world! This is Teisei's blog");
    }
}
{% endhighlight %}
{'fraction_non_alphanumeric': 0.14115168539325842, 'fraction_numerical': 0.037219101123595506, 'mean_word_length': 3.814189189189189, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 5, 'https://': 2, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6433328', 'n_tokens_mistral': 592, 'n_tokens_neox': 504, 'n_words': 115}