IncredibleThings

摘要： Find the K closest points to the origin in a 2D plane, given an array containing N points. 用 max heap 做 阅读全文

摘要： // "static void main" must be defined in a public class. public class Main { public static void main(String[] args) { int[][] info = new int[4][]; info[0] = null; info[... 阅读全文

摘要： Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. Example:Given a = 1 and b = 2, return 3. 1、输入 a，b 2、按照 阅读全文

摘要： public Node findBiggest (Node n1, Node n2){ Node c1 = n1; Node c2 = n2; boolean isPositive = false; if(n1.value == '-'){ if(n2.value != '-'){ return n2; ... 阅读全文