摘要：
class Solution { int index = 0; public int calculate(String s) { int n = s.length(); Stack<Integer> stack = new Stack(); char pre = '+'; int num = 0; 阅读全文
摘要：
class Solution { public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) { int n = nums.length; TreeSet<Integer> set = new TreeSet<>(); 阅读全文
摘要：
class Solution { public List<List<Integer>> getSkyline(int[][] buildings) { List<List<Integer>> res = new ArrayList<>(); Node[] nodes = new Node[build 阅读全文