Diana Du

Results 20 comments of Diana Du

Write function to compute Nth fibonacci number

只知道recursive和iterative两种。。。

Write function to compute Nth fibonacci number

Recursive way: ``` import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class FibonacciR { public static int fibonacciN(int input){ if(input == 0) return 0; else if(input == 1) return 1; return...

Write function to compute Nth fibonacci number

@GingerBear CC150 has explanation for recursive algorithm, please check P108.

Write function to compute Nth fibonacci number

At the beginning, I was confused about the time complexity when recursion was used. Then I checked the book and found this. I thought you met the same condition as...

Write function to compute Nth fibonacci number

"时间复杂度是O{[(5^1/2)+1]^n/2^n}. "怎么做出这个结果的？@allen6432

Find Kth largest element in an integer array

用assert?

Find Kth largest element in an integer array

@GingerBear 有人在stackoverflow上问过我问的问题，得到的答案特别简单，但我觉得确实最靠谱 http://en.wikipedia.org/wiki/Unit_testing

Find Kth largest element in an integer array

不允许sort, 就一直一半一半地找，貌似叫什么median, 稍后上代码

Find Kth largest element in an integer array

Using quick select algorithm: ``` public class KthLargetst { public static int findKthLargest(int[] input, int k){ return quickselect(input, 0, input.length-1, k-1); } private static int quickselect(int[] input, int first, int...

Find Kth largest element in an integer array

@GingerBear cc150 p84. 就是每一个树杈上的所有node从上到下连起来是一个词