1 public class Solution { 2 3 public static int SequenceSearch(int[] sz, int key) { 4 for (int i = 0; i < sz.length; i++) { 5 if (sz[i] == key) { 6 return i; 7 } 8 } 9 return -1; 10 } 11 }
顺序查找
原文：http://www.cnblogs.com/yl-saber/p/6933754.html
