spafka / Acleetcode

Acleetcode

todo https://leetcode.cn/problems/longest-increasing-subsequence/

Ac_$!{question.frontendQuestionId}$!velocityTool.camelCaseName(${question.titleSlug})

package leetcode.editor.cn;
  
 ${question.content}

/**$!velocityTool.date()*/
public class Ac_$!{question.frontendQuestionId}$!velocityTool.camelCaseName(${question.titleSlug}){
      public static void main(String[] args) {
           Solution solution = new Ac_$!{question.frontendQuestionId}$!velocityTool.camelCaseName(${question.titleSlug})().new Solution();
      }
      ${question.code}
 }