求一有效率算法(用c#写),急,谢谢大家!
来源:百度知道 编辑:UC知道 时间:2024/09/21 02:48:30
using System;
namespace aa
{
public class classTest
{
public static void Main()
{
int iCount = 65; //分割的长度,这里定为65;
string oldInfo = ",akdfjskf;akfksdfkjasdfkjasdfas,sdfaskdfaskdjfsdf,asdfasdfasdfsdf%),ababjjjjjjj!!dfas,dfassdadfdfdfsdfmdkfasd,f,sdmfskdfksjdjfksd();fsdkfd,fjkskjf,asdfasfasdfasdf";
string[] newInfo = new string[oldInfo.Length / iCount + 1]; //iCount个字符一条
if (oldInfo.Length % iCount == 0)
{
newInfo = new string[oldInfo.Length / iCount]; //原来的字符串刚好整除iCount (iCount个字符一条)
}
else
{
newInfo = new string[oldInfo.Length / iCount + 1]; //有余数, 维数+1
}
for (int i = 0; i < newInfo.Length; i++)
{
//给newInfo[i]赋值
if (i < newInfo.Length