=====================> import math
def print_hello():<|endoftext|><|endoftext|><|endoftext|><fim_prefix><fim_suffix> }
}
}<fim_middle>using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace _04.Longest_Increasing_Subsequence
{
class Program
{
static void Main(string[] args)
{
int[] nums = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
int[] len = new int[nums.Length];
int[] prev = new int[nums.Length];
int maxLen = 0;
=====================> import math
def quick_sort():<|endoftext|><|endoftext|><|endoftext|><fim_prefix><fim_suffix> }
}
}<fim_middle>using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
当前从examples 看是单batch的,如何能够使用多batch进行推理额,现在多batch 的结果好像不太对的样子。
测试代码如上,
测试结果有点奇怪