摘要： public class Solution { public int LargestPerimeter(int[] A) { var list = A.OrderByDescending(x => x).ToList(); var length = list.Count; if (le... 阅读全文

摘要： public class Solution { public int[] SortedSquares(int[] A) { return A.Select(x => x * x).ToList().OrderBy(x => x).ToArray(); } } Java版代码： 1 class Sol 阅读全文

摘要： public class POINT { public int X; public int Y; public int Z; } public class Solution { public int[][] KClosest(int[][] points, int K) { ... 阅读全文

摘要： public class Solution { List list = new List(); private void postTree(TreeNode root) { if (root != null) { list.Add(root.val); ... 阅读全文

摘要： class Solution: def repeatedNTimes(self, A): doubleN = len(A) N = doubleN / 2 dic = {} for a in A: if a in dic.keys(): dic[a]=dic[a]+1 ... 阅读全文

摘要： from queue import Queue class Solution: def deckRevealedIncreasing(self, deck): n = len(deck) que = Queue(maxsize=n) deck.sort() res = [0]*n for i in rang... 阅读全文

摘要： class Solution: def __init__(self): self.li = [] def midSearch(self,node): if(node != None): self.midSearch(node.left) self.li.append(node.val) ... 阅读全文

摘要： public class Solution { public bool IsAlienSorted(string[] words, string order) { string HumanDic = "abcdefghijklmnopqrstuvwxyz"; for (int i = 0; i x).ToA... 阅读全文

摘要： 这题又长又卵，没意思。 阅读全文

摘要： 补充一版python3的实现代码： 阅读全文