Ruizhi Ma's Blog

Keep Calm and Carry On

Problem 283

Solution URL https://leetcode.com/submissions/detail/424028480/ 代码 class Solution { public void moveZeroes(int[] nums) { //time: O(n) //space: O(1) int fast = 0, slow...

Posted by Ruizhi Ma on November 25, 2020

Problem 238

Solution URL https://leetcode.com/submissions/detail/424010915/ 代码 class Solution { public int[] productExceptSelf(int[] nums) { //ans: solution //time: O(N) //space:...

Posted by Ruizhi Ma on November 25, 2020

Problem 228

Solution URL https://leetcode.com/submissions/detail/424024203/ 代码 class Solution { public List<String> summaryRanges(int[] nums) { List<String> range = new ArrayList<...

Posted by Ruizhi Ma on November 25, 2020

Problem 289

Solution URL https://leetcode.com/submissions/detail/423810825/ 代码 class Solution { public void gameOfLife(int[][] board) { //Ans: Solution //Time: O(M * N) //Space: ...

Posted by Ruizhi Ma on November 24, 2020

Problem 287

Solution URL https://leetcode.com/submissions/detail/423751819/ 代码 class Solution { public int findDuplicate(int[] nums) { //time: O(N) //space: O(N) Set<Integer&g...

Posted by Ruizhi Ma on November 24, 2020

Problem 253

Solution URL https://leetcode.com/submissions/detail/423841834/ 代码 class Solution { public int minMeetingRooms(int[][] intervals) { //ans: Solution //Time:O(NlogN) [1: for so...

Posted by Ruizhi Ma on November 24, 2020

Problem 252

Solution URL https://leetcode.com/submissions/detail/423823026/ 代码 class Solution { public boolean canAttendMeetings(int[][] intervals) { //time: O(N) //space: O(1) /...

Posted by Ruizhi Ma on November 24, 2020

Problem 220

Solution URL https://leetcode.com/submissions/detail/423687423/ 代码 class Solution { public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) { //time: O(NlogN) ...

Posted by Ruizhi Ma on November 24, 2020

Problem 219

Solution URL https://leetcode.com/submissions/detail/421118946/ 代码 class Solution { public boolean containsNearbyDuplicate(int[] nums, int k) { //Time: O(N) //Space: O(N) ...

Posted by Ruizhi Ma on November 24, 2020

Problem 217

Solution URL https://leetcode.com/submissions/detail/420902405/ 代码 class Solution { public boolean containsDuplicate(int[] nums) { //ans: Solution //Time: O(N). for hashset, ...

Posted by Ruizhi Ma on November 16, 2020