该文被密码保护。 阅读全文

摘要： This problem can be solved by bicket sorting. Although the problem only requires the number is 1~9, but my solution can be extended to any number sent 阅读全文

摘要： This is a super easy problem. Time Compexity O(n), Space Complexity O(n) int res = 0; public int getDecimalValue(ListNode head) { if(head==null) retur 阅读全文