游戲中遇到這樣的問題,需要將一組已知的數(shù)據(jù)打亂,按照以前和現(xiàn)在的做法,總結(jié)了以下方法。

成都創(chuàng)新互聯(lián)從2013年成立,先為劍河等服務(wù)建站,劍河等地企業(yè),進(jìn)行企業(yè)商務(wù)咨詢服務(wù)。為劍河企業(yè)網(wǎng)站制作PC+手機(jī)+微官網(wǎng)三網(wǎng)同步一站式服務(wù)解決您的所有建站問題。
方法一,最笨的菜鳥方法,也是容易想到的(幸好我沒想過這種方法 :))
從已知數(shù)組中隨機(jī)一個(gè)數(shù),然后加入到另一個(gè)數(shù)組中,在加入之前,先檢查是否已經(jīng)加入過。
這種方法有很大運(yùn)氣成分,且數(shù)據(jù)越大,效率越低,超過一定數(shù)目,則程序幾乎無法執(zhí)行,會(huì)一直卡在那里,代碼:
[java] view plain copy
package com.test;
import java.util.Random;
public class TestArray {
public static int runCount =0;//用于記錄方法運(yùn)算次數(shù)
如果你是從vb6剛過渡上vb。net,建議還是用冒泡排序法,容易理解。
如果你正努力學(xué)習(xí)vb。net的方法,推薦一個(gè)例子如下:
Imports System
Imports System.Collections
Public Class SamplesArray
Public Class myReverserClass
Implements IComparer
' Calls CaseInsensitiveComparer.Compare with the parameters reversed.
Function Compare(x As Object, y As Object) As Integer _
Implements IComparer.Compare
Return New CaseInsensitiveComparer().Compare(y, x)
End Function 'IComparer.Compare
End Class 'myReverserClass
Public Shared Sub Main()
' Creates and initializes a new Array and a new custom comparer.
Dim myArr As [String]() = {"The", "QUICK", "BROWN", "FOX", "jumps", "over", "the", "lazy", "dog"}
Dim myComparer = New myReverserClass()
' Displays the values of the Array.
Console.WriteLine("The Array initially contains the following values:")
PrintIndexAndValues(myArr)
' Sorts a section of the Array using the default comparer.
Array.Sort(myArr, 1, 3)
Console.WriteLine("After sorting a section of the Array using the default comparer:")
PrintIndexAndValues(myArr)
' Sorts a section of the Array using the reverse case-insensitive comparer.
Array.Sort(myArr, 1, 3, myComparer)
Console.WriteLine("After sorting a section of the Array using the reverse case-insensitive comparer:")
PrintIndexAndValues(myArr)
' Sorts the entire Array using the default comparer.
Array.Sort(myArr)
Console.WriteLine("After sorting the entire Array using the default comparer:")
PrintIndexAndValues(myArr)
' Sorts the entire Array using the reverse case-insensitive comparer.
Array.Sort(myArr, myComparer)
Console.WriteLine("After sorting the entire Array using the reverse case-insensitive comparer:")
PrintIndexAndValues(myArr)
End Sub 'Main
Public Shared Sub PrintIndexAndValues(myArr() As [String])
Dim i As Integer
For i = 0 To myArr.Length - 1
Console.WriteLine(" [{0}] : {1}", i, myArr(i))
Next i
Console.WriteLine()
End Sub 'PrintIndexAndValues
End Class 'SamplesArray
'This code produces the following output.
'
'The Array initially contains the following values:
' [0] : The
' [1] : QUICK
' [2] : BROWN
' [3] : FOX
' [4] : jumps
' [5] : over
' [6] : the
' [7] : lazy
' [8] : dog
'
'After sorting a section of the Array using the default comparer:
' [0] : The
' [1] : BROWN
' [2] : FOX
' [3] : QUICK
' [4] : jumps
' [5] : over
' [6] : the
' [7] : lazy
' [8] : dog
'
'After sorting a section of the Array using the reverse case-insensitive comparer:
' [0] : The
' [1] : QUICK
' [2] : FOX
' [3] : BROWN
' [4] : jumps
' [5] : over
' [6] : the
' [7] : lazy
' [8] : dog
'
'After sorting the entire Array using the default comparer:
' [0] : BROWN
' [1] : dog
' [2] : FOX
' [3] : jumps
' [4] : lazy
' [5] : over
' [6] : QUICK
' [7] : the
' [8] : The
'
'After sorting the entire Array using the reverse case-insensitive comparer:
' [0] : the
' [1] : The
' [2] : QUICK
' [3] : over
' [4] : lazy
' [5] : jumps
' [6] : FOX
' [7] : dog
' [8] : BROWN
參考
#includestdio.h
int main()
{int n,i,j,t,a[200];
printf("數(shù)組中數(shù)的個(gè)數(shù):");
scanf("%d",n);
printf("數(shù)組中的數(shù):\n");
for(i=0;in;i++)
{
a[i]=i+1;
printf("%d ",a[i]);
}
for(i=0,j=n-1;ij;i++,j--)
{t=a[i];a[i]=a[j];a[j]=t;}
printf("\n逆序后的數(shù)組:\n");
for(i=0;in;i++)
printf("%d ",a[i]);
printf("\n");
getch();
return 0;
}
好象有個(gè)StrReverse函數(shù)是直接反轉(zhuǎn)字符串的吧..
我平時(shí)用的是VB6.但是.NET中應(yīng)該也是可以用MID的
你注意看FOR 是從len-1到0的..而mid中是不允許出現(xiàn)0的..
你看看MID運(yùn)行不了時(shí),是不是返回I是0的時(shí)間
改成:
For i = Len(sstr) To 1 Step -1
試試了?
本文題目:vb.net數(shù)組倒序,C#數(shù)組倒序
URL網(wǎng)址:http://chinadenli.net/article19/dseeedh.html
成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián),為您提供營(yíng)銷型網(wǎng)站建設(shè)、電子商務(wù)、全網(wǎng)營(yíng)銷推廣、定制開發(fā)、網(wǎng)站收錄、微信小程序
聲明:本網(wǎng)站發(fā)布的內(nèi)容(圖片、視頻和文字)以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主,如果涉及侵權(quán)請(qǐng)盡快告知,我們將會(huì)在第一時(shí)間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng),如需處理請(qǐng)聯(lián)系客服。電話:028-86922220;郵箱:631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載,或轉(zhuǎn)載時(shí)需注明來源: 創(chuàng)新互聯(lián)
移動(dòng)網(wǎng)站建設(shè)知識(shí)