Ruizhi Ma's Blog

Keep Calm and Carry On

Problem 264

Solution URL https://leetcode.com/submissions/detail/413543446/ 代码 class Solution { public int nthUglyNumber(int n) { //https://leetcode-cn.com/problems/ugly-number-ii/solution/zui-r...

Posted by Ruizhi Ma on October 26, 2020

Problem 227

Solution URL https://leetcode.com/submissions/detail/413535598/ 代码 class Solution { public int calculate(String s) { //ans: https://leetcode-cn.com/problems/basic-calculator-ii/submi...

Posted by Ruizhi Ma on October 26, 2020

Problem 136

Solution URL https://leetcode.com/submissions/detail/413588394/ 代码 class Solution { public int singleNumber(int[] nums) { // //HashMap法 // Map<Integer, Integer> map = n...

Posted by Ruizhi Ma on October 26, 2020

Problem 224

Solution URL https://leetcode.com/submissions/detail/413190050/ 代码 class Solution { public int calculate(String s) { //ans: https://www.youtube.com/watch?v=GpLJMW1IGbw Stack&...

Posted by Ruizhi Ma on October 25, 2020

Problem 373

Solution URL https://leetcode.com/submissions/detail/412764304/ 代码 class Solution { public List<List<Integer>> kSmallestPairs(int[] nums1, int[] nums2, int k) { //ans: https:...

Posted by Ruizhi Ma on October 24, 2020

Problem 341

Solution URL https://leetcode.com/submissions/detail/412787883/ 代码 /** * // This is the interface that allows for creating nested lists. * // You should not implement it, or speculate about it...

Posted by Ruizhi Ma on October 24, 2020

Problem 263

Solution URL https://leetcode.com/submissions/detail/412803548/ 代码 class Solution { public boolean isUgly(int num) { if(num == 0) return false; while(num % 2 == 0){ ...

Posted by Ruizhi Ma on October 24, 2020

Problem 385

Solution URL https://leetcode.com/submissions/detail/412410037/ 代码 /** * // This is the interface that allows for creating nested lists. * // You should not implement it, or speculate about it...

Posted by Ruizhi Ma on October 23, 2020

Problem 347

Solution URL https://leetcode.com/submissions/detail/412462728/ 代码 class Solution { public int[] topKFrequent(int[] nums, int k) { //ans: https://leetcode-cn.com/problems/top-k-frequ...

Posted by Ruizhi Ma on October 23, 2020

Problem 215

Solution URL https://leetcode.com/submissions/detail/412421296/ 代码 class Solution { public int findKthLargest(int[] nums, int k) { //ans: https://leetcode-cn.com/problems/decode-stri...

Posted by Ruizhi Ma on October 23, 2020