11 2014 档案

摘要:算法逻辑在这里:http://www.cnblogs.com/Azhu/p/4131733.html 贴之前先说下,本来呢是打算自己写一个的,在matlab 上,不过,实在是写不出来那么高效和健壮的,网上有很多实现的代码,例如上面参考里面的,那个代码明显有问题阿,然后因为那里面的代码与逻辑分析是一... 阅读全文
posted @ 2014-11-30 18:08 A_zhu 阅读(355) 评论(0) 推荐(0) 编辑
摘要:Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa... 阅读全文
posted @ 2014-11-30 06:13 A_zhu 阅读(2041) 评论(0) 推荐(0) 编辑
摘要:Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo... 阅读全文
posted @ 2014-11-30 05:20 A_zhu 阅读(773) 评论(0) 推荐(0) 编辑
摘要:先列明材料:高斯混合模型的推导计算(英文版):http://www.seanborman.com/publications/EM_algorithm.pdf这位翻译写成中文版:http://www.cnblogs.com/jerrylead/archive/2011/04/06/2006936.ht... 阅读全文
posted @ 2014-11-29 19:12 A_zhu 阅读(3892) 评论(0) 推荐(0) 编辑
摘要:Given an array withnobjects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, wh... 阅读全文
posted @ 2014-11-28 20:40 A_zhu 阅读(489) 评论(0) 推荐(0) 编辑
摘要:Given an array of words and a lengthL, format the text such that each line has exactlyLcharacters and is fully (left and right) justified.You should p... 阅读全文
posted @ 2014-11-28 15:48 A_zhu 阅读(245) 评论(0) 推荐(0) 编辑
摘要:You are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?Hide TagsArray 一题严... 阅读全文
posted @ 2014-11-28 13:56 A_zhu 阅读(285) 评论(0) 推荐(0) 编辑
摘要:Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the fol... 阅读全文
posted @ 2014-11-28 12:38 A_zhu 阅读(520) 评论(0) 推荐(0) 编辑
摘要:Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu... 阅读全文
posted @ 2014-11-28 05:47 A_zhu 阅读(177) 评论(0) 推荐(0) 编辑
摘要:题目:Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S="ADOBECOD... 阅读全文
posted @ 2014-11-28 05:13 A_zhu 阅读(2800) 评论(1) 推荐(0) 编辑
摘要:这个实现语句如下,(写在2行然后向下拖动)(2007或以上版本): 1 = 2 IF(OR($D20,ISBLANK($H2),$G2="111"), 3 "", 4 IF(OR($G2="222",$G2="333"), 5 IF($H2>0,1,-1)*SUMIFS(INDIRECT("... 阅读全文
posted @ 2014-11-25 01:32 A_zhu 阅读(1875) 评论(0) 推荐(0) 编辑