递归练习二

/求1,3/2,5/3,8/5 ,13/8....前N 项之和,以分母为基准/ #include<iostream> using namespace std; float f(int n) { if(n==1) return 1;     if(n==2) return 2; return f(n-1)+f(n-2); } <...
学习档案 | 2013-03-29 19:16 | 1140次阅读 | 0评

递归练习

public class Jishuan { public final static String[] pai = { "一", "二", "三", "四", "五", "六", "七", "八", "九", "十", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖", "拾" }; // 把相同的牌放在数组的一个下标,便于_del(int[] dealpai )处理。 public int[] toChangePai(String str) { ...
学习档案 | 2013-03-26 20:26 | 970次阅读 | 0评

1,2,3分区排序

http://blog.csdn.net/tiankong1206/article/details/48199345 TVeXTcpA8YBlksLPhEq5qnWWJnDj1DMSd3mrlbhoGnd2nkCyw7bHs...
学习档案 | 2013-03-25 11:34 | 1135次阅读 | 0评
浏览152297次