首页 > 学院 > 开发设计 > 正文

LeetCode 448 --- Find All Numbers Disappeared in an Array

2019-11-08 02:17:41
字体:
来源:转载
供稿:网友

题目链接: LeetCode 448 — Find All Numbers Disappeared in an Array

AC代码:

public class PRoblem448 { public static void main(String[] args) { int [] a={4,3,2,7,8,2,3,1}; // TODO Auto-generated method stub findDisappearedNumbers(a); } public static List<Integer> findDisappearedNumbers(int[] nums) { List<Integer> list =new ArrayList<Integer>(); for(int i=1;i<=nums.length;i++) list.add(i); for(int i=0;i<nums.length;i++) list.remove(new Integer(nums[i])); return list; }}
发表评论 共有条评论
用户名: 密码:
验证码: 匿名发表