10 2018 档案

摘要:using System.Collections;using System.Collections.Generic;using UnityEngine; public class LoadMan : MonoBehaviour { // Use this for initialization pub 阅读全文
posted @ 2018-10-31 19:50 0ooooooooooooooooo0 阅读(209) 评论(0) 推荐(0)
摘要:using System.Collections;using System.Collections.Generic;using UnityEngine; public class Load : MonoBehaviour { // Use this for initialization void S 阅读全文
posted @ 2018-10-31 19:44 0ooooooooooooooooo0 阅读(118) 评论(0) 推荐(0)
摘要:1.1、1、2、3、5、8、13、21、34...... 求第30位数是多少int a=1,b=1;For(int i=0;i<28;i++){Int temp=a+b;a=b;b=temp;}Cw(b); 2.实现一个冒泡排序法int []arr=new int [];for(int i=0;i< 阅读全文
posted @ 2018-10-31 19:37 0ooooooooooooooooo0 阅读(190) 评论(0) 推荐(0)
摘要:static void Main(string[] args) { int[] array = { 0, 54, 6, 79, 15, 35, 45 }; Array.Sort(array); Console.WriteLine("数字排序后:"); foreach (var i in array) 阅读全文
posted @ 2018-10-31 19:33 0ooooooooooooooooo0 阅读(154) 评论(0) 推荐(0)
摘要:console.writeline("请输入你要排序的数字,并用,隔开"); string _s=console.readline(); string[] _sArr=_s.split(','); int _nLength=_sArr.length; int [] _mArr=new int [_n 阅读全文
posted @ 2018-10-31 19:29 0ooooooooooooooooo0 阅读(142) 评论(0) 推荐(0)
摘要://链表1 public class Node { public int Data; public Node Next; public Node() { Data=default(int); Next=null; } public Node(int value) { Data=value; Next 阅读全文
posted @ 2018-10-31 19:14 0ooooooooooooooooo0 阅读(145) 评论(0) 推荐(0)
摘要:class Program<T> { private int _flag; private T[] _ints; //添加元素到末尾 public void AddItem(T gg) { if(_flag>_ints.length) { console.writeline("溢出来了,弱智"); 阅读全文
posted @ 2018-10-31 18:54 0ooooooooooooooooo0 阅读(190) 评论(0) 推荐(0)
摘要:int a=1,b=1; for(int i=0;i<28;i++) { int tmp=a+b; a=b; b=tmp; } Console.writeline(b); int []arr=new int[]; for(int i=0;i<arr.length-1;i++) { for(int j 阅读全文
posted @ 2018-10-23 19:58 0ooooooooooooooooo0 阅读(135) 评论(0) 推荐(0)