09 2021 档案
摘要:https://leetcode-cn.com/problems/queries-on-number-of-points-inside-a-circle/ class Solution { public int[] countPoints(int[][] points, int[][] querie
阅读全文
摘要:https://leetcode-cn.com/problems/binary-search/ class Solution { public int search(int[] nums, int target) { int low = 0; int high = nums.length-1; wh
阅读全文
摘要:https://leetcode-cn.com/problems/convert-a-number-to-hexadecimal/ class Solution { public String toHex(int num) { if(num==0) return "0"; StringBuilder
阅读全文
摘要:https://leetcode-cn.com/problems/binary-watch/ class Solution { public List<String> readBinaryWatch(int turnedOn) { List<String> result = new ArrayLis
阅读全文