Java / C++ Clean && Short
Java \n\npublic List<Integer> intersection(int[][] nums) {\n        Map<Integer, Integer> countMap = new HashMap<>();\n        List<Integer> inEachArray = new A
### Java \n```\npublic List<Integer> intersection(int[][] nums) {\n        Map<Integer, Integer> countMap = new HashMap<>();\n        List<Integer> inEachArray = new ArrayList<>();\n        for (int[] num : nums) {\n            for (int x : num) {\n                countMap.put(x, countMap.getOrDefault(x, 0) + 1);\n                if (countMap.get(x) == nums.length) inEachArray.add(x);\n            }\n        }\n        inEachArray.sort(Comparator.naturalOrder());\n        return inEachArray;\n    }\n```\n### C++\n```\npublic:\n    vector<int> intersection(vector<vector<int>>&nums) {\n        map<int, int> countMap;\n        vector<int> inEachArray;\n        for (auto num : nums) {\n            for (auto x : num) {\n                countMap[x]++;\n                if (countMap[x] == nums.size())\n                     inEachArray.push_back(x);\n            }\n        }\n        sort(inEachArray.begin(), inEachArray.end());\n        return inEachArray;\n    }\n```\n\n### + 3-Line Java\n```\npublic List<Integer> intersection(int[][] nums) {\n        Map<Integer, Integer> countMap = new HashMap<>();\n        Arrays.stream(nums).forEach(a -> Arrays.stream(a).forEach(x -> countMap.put(x, countMap.getOrDefault(x, 0) + 1)));\n        return countMap.entrySet().stream().filter(e -> e.getValue() == nums.length).map(Map.Entry::getKey).sorted().collect(Collectors.toList());\n    }\n```\n\nMy repositories with leetcode problems solving - [Java](https://github.com/FLlGHT/algorithms/tree/master/j-algorithms/src/main/java),  [C++](https://github.com/FLlGHT/algorithms/tree/master/c-algorithms/src/main/c%2B%2B)
['C', 'Java']