露台上对望

摘要： Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 ->... 阅读全文

摘要： Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le... 阅读全文

摘要： Description:Count the number of prime numbers less than a non-negative number,n.描述：计算小于n的质数的个数 这里用到的方法是埃拉托色尼筛选法(Sieve of Eratosthenes)，思路大致为：对于1~n-1这... 阅读全文

摘要： Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include2, 3, 5. For examp... 阅读全文

摘要： Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is like:3 + ... 阅读全文

摘要： 使用BNT(Bayesian Networks Toolbox)进行推断时，内置了吉布斯采样算法(即gibbs_sampling_inf_engine)，但是如果调用这个引擎做推断会报错。报错内容大概是compute_posterior这个函数没有找到，然后进入..\@gibbs_samplin... 阅读全文