java得到某个字符串满足斐波那契的所以子字符串

import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class LUCKYString {


/*
* A string s is LUCKY if and only if the number of different characters in s is a fibonacci number. Given a string consisting of only lower case letters , output all its lucky non-empty substrings in lexicographical order. Same substrings should be printed once. 
输入描述:a string consisting no more than 100 lower case letters.
输出描述:output the lucky substrings in lexicographical order.one per line. Same substrings should be printed once.
输入例子:aabcd
输出例子:a aa aab aabc ab abc b bc bcd c cd d
*/
public static int fibonacci(int n){
if(n==1|| n==2) return 1;
else return fibonacci(n-1)+fibonacci(n-2);
}
public static void main(String[] args) {
// TODO Auto-generated method stub
       Scanner sc=new Scanner(System.in) ;
       String str=sc.next();
       sc.close();
       //首先计算斐波那契数字，不多于100位意味着100之内的斐波那契数就行
       Set<Integer> fib=new HashSet<Integer>();
       for(int i=1;i<20;++i){
      fib.add(i);
       }
       //拆分字符串
       Set<String> subStr=new HashSet<String>();
       for(int i=0;i<str.length();++i){
      for(int j=i;j<str.length();++j){
      subStr.add(str.substring(i,j+1));
      }
       }
       //对子字符串集合进行排序
       ArrayList<String> strList=new ArrayList<String>();
       strList.addAll(subStr);
       Collections.sort(strList);
       //比对并输出
       Set<Character> chs=new HashSet<Character>();
       for(String s:strList){
      char[] ch=s.toCharArray();
      for(char c:ch){
      chs.add(c);
      }
      if(fib.contains(chs.size())){
      System.out.println(s);
      }
      chs.clear();
       }
}


}