摘要: 1 class Solution { 2 public int findMagicIndex(int[] nums) { 3 int len = nums.length; 4 for (int i = 0; i < len; i++){ 5 if (i == nums[i]) 6 return i; 阅读全文
posted @ 2020-07-31 22:49 小小码农-安 阅读(158) 评论(0) 推荐(0)