Ruizhi Ma's Blog

Keep Calm and Carry On

Problem 207

Solution URL https://leetcode.com/submissions/detail/414622173/ 代码 class Solution { public boolean canFinish(int numCourses, int[][] prerequisites) { //ans: https://www.youtube.com/w...

Problem 89

Solution URL https://leetcode.com/submissions/detail/413893729/ 代码 class Solution { public List<Integer> grayCode(int n) { //ans:https://leetcode-cn.com/problems/gray-code/solu...

Problem 318

Solution URL https://leetcode.com/submissions/detail/413895423/ 代码 class Solution { public int maxProduct(String[] words) { //ans: https://leetcode-cn.com/problems/maximum-product-of...

Problem 268

Solution URL https://leetcode.com/submissions/detail/413807223/ 代码 class Solution { public int missingNumber(int[] nums) { //https://leetcode-cn.com/problems/missing-number/solution/...

Problem 260

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

Problem 191

Solution URL https://leetcode.com/submissions/detail/413903225/ 代码 public class Solution { // you need to treat n as an unsigned value public int hammingWeight(int n) { //ans: ht...

Problem 190

Solution URL https://leetcode.com/submissions/detail/413909989/ 代码 public class Solution { // you need treat n as an unsigned value public int reverseBits(int n) { //ans: https:/...

Problem 137

Solution URL https://leetcode.com/submissions/detail/413991852/ 代码 class Solution { public int singleNumber(int[] nums) { //ans: https://www.youtube.com/watch?v=puXcQpwgcD0 /...

Problem 389

Solution URL https://leetcode.com/submissions/detail/413580706/ 代码 class Solution { public char findTheDifference(String s, String t) { //ans: https://leetcode-cn.com/problems/find-t...

Problem 332

Solution URL https://leetcode.com/submissions/detail/413573185/ 代码 class Solution { public List<String> findItinerary(List<List<String>> tickets) { //ans: https://w...