RMCYork！停不下来！

The problem is:  Given a binary tree (not a binary search tree) and two values say n1 and n2, write a program to find the least common ancestor. 思路： 如果

The fundamental string searching (matching) problem is defined as follows: given two strings - a text and a pattern, determine whether the pattern appears in the text. The problem is also known as "th

不能使用reverse啥的函数 public String reverseString(String str){ String temp = "", result = ""; for(int i=0;istr.length();i++) if ( (str.charAt(i)>='A' && str.charAt(i)

写一个函数float sqrt(float x, int p), 要求返回的结果result平方后小数点后p位与原数x相同。基本思路二分法如下： public float sqrt(float x, int p) { if (x == 0) { return 0; } if (x < 0) {