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; ... 阅读全文

摘要： Given a positive integer num, write a function which returns True if num is a perfect square else False. Note: Do not use any built-in library functio 阅读全文

摘要： Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: Note: num[i]存的是nums的前i-1个元素之和，反正前j个元素和减 阅读全文

摘要： Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. Example 1 Input: [3,0,1] Output: 阅读全文

摘要： Given two strings s and t which consist of only lowercase letters. String t is generated by random shuffling string s and then add one more letter at 阅读全文

摘要： Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: s = "leetcode" return 0. 阅读全文

摘要： Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the rans 阅读全文