Codewars索引越界错误尽管它工作，Java Fibonacci

Question

      import java.util.*;
      public class Solution {
      
        public static void main(String[] args) {
          int secLen = 2;
          solve(secLen);
        }
        public static String solve(int sequenceLength) {
          int sec = sequenceLength+1;
          String[] fibSequence = new String[sec];
          fibSequence[0] = "0";
          *fibSequence[1] = "01";*
          
      
          for(int i = 2; i <= sequenceLength;i++){
            fibSequence[i] = fibSequence[i-1] + fibSequence[i-2];
          }
           
          
          
          System.out.println(fibSequence[sequenceLength]);
          //return fibArray;
          return fibSequence[sequenceLength];
        }
        
      } 

CodeWars告诉我在第15行有一个索引出界错误。但是这是没有意义的，因为当我在IDE中测试它时，一切都可以完美地工作。

Answer 1

为什么你的FibSequence数组是String类型。我假设你想计算这些值的总和。使其为int类型，因为字符串是不可变的。还要处理输入为null或负数的情况。