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

来源:互联网 发布:微软软件开发流程 编辑:程序博客网 时间:2024/06/05 00:57

题目链接:
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;    }}
0 0
原创粉丝点击