本文介绍了C#编码算法的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧! 问题描述 我有2个不同的列表,第一个是我保留用户输入(数字) 在第二个列表中我有斐波那契序列 查找斐波纳契数列表中第一个用户号的索引(i)。 在用户编号列表中留下的数字找到fib编号列表中下一个用户编号的索引(j)。 如果abs(i-j)> 1拒绝数据集。 i = j 接受 但是我只是不能编码这个算法,任何帮助都会受到赞赏解决方案 我有2个不同的列表,在第一个我保持用户输入(数字) 在第二个列表我有斐波那契序列 但我只是无法编码这个算法,任何帮助将不胜感激 你将在这个问题上开始多少线程? 您目前似乎至少有三个开放线程: https://social.msdn.microsoft.com/Forums/vstudio/ en-US / d8acde85-766e-46fb-ba83-66772da9d9a4 / c-planning-poker-with-fibonacci-sequence?forum = csharpgeneral HTTPS:/ /social.msdn.microsoft.com/Forums/vstudio/en-US/555b220c-d0a4-4ab2-a59e-08a9b8aa4e94/c-fibonacci-sequence-from-user-inputs?forum=csharpgeneral 以及此主题。 每个问题坚持一个帖子并努力回复回复。跳到各处并创建多个线程只会减少来减少你获得答案的几率。 - Wayne I have 2 different Lists , in first one i keep user inputs(numbers)And in the second list i have fibonacci sequenceFind index (i) of the first user number in the fibonacci number list.While numbers left in the user number list Find the index (j) of the next user number in the fib number list. If abs(i-j)>1 reject dataset. i=jAcceptBut i just cant code this algorithm , any help would be appreciated 解决方案I have 2 different Lists , in first one i keep user inputs(numbers)And in the second list i have fibonacci sequenceBut i just cant code this algorithm , any help would be appreciatedHow many threads are you going to start on this problem?You appear to have at least three open threads at the moment:https://social.msdn.microsoft.com/Forums/vstudio/en-US/d8acde85-766e-46fb-ba83-66772da9d9a4/c-planning-poker-with-fibonacci-sequence?forum=csharpgeneralhttps://social.msdn.microsoft.com/Forums/vstudio/en-US/555b220c-d0a4-4ab2-a59e-08a9b8aa4e94/c-fibonacci-sequence-from-user-inputs?forum=csharpgeneralAs well as this thread.Stick to one thread per issue and make an effort to respond to the repliesyou get. Jumping all over the place and creating multiple threads will onlyreduce the odds of your getting an answer.- Wayne 这篇关于C#编码算法的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持!