首页 > 代码库 > 顺序查找

顺序查找

 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 }

 

顺序查找