- 博客(3)
- 收藏
- 关注
RSS订阅原创 find min and max -- 1.5n times for comparison
1. divide and conquer public static int[] findMinMax(int[] array, int[] res, int start , int end){ int[] minmax = new int[2]; if(end - start <= 1){ if(array[start] < array[end]){ minmax[0]
2014-03-06 16:01:30
543
原创 KMP心得
首先计算出KMP针对于pattern的overlap表。表长和pattern长一样。每一个index对应的值表示从0~index的substring的overlap的长度。overlap is defined as largest common length of proper prefix and suffix. proper means not including themselves. e
2013-12-23 11:21:22
489
原创 NLP coursera note 1
NLP applications: 1) machine translation : use computer to translate language automatically 2) information extraction : given text, produce structured database representation 3) text summarization
2013-12-22 02:58:30
573
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人