参考:https://leetcode.com/problems/find-all-the-lonely-nodes/discuss/669635/Java-recursive-top-down-as-parent-passes-isLonely-to-each-children publicList<Integer>getLonelyNodes(TreeNode root) { List<Integer> nodes =newArrayList<>(); getLonelyNodes(root,false, nodes);//root is not lonelyretur...
You are given an integer arraynums. A numberxis lonely when it appears only once, and no adjacent numbers (i.e.x + 1andx - 1)appear in the array. Return all lonely numbers innums. You may return the answer in any order. Example 1: Input: nums = [10,6,5,8]Output: [10,8]E...
2150. 找出数组中的所有孤独数字咕咕咕 排序