feat: add solutions to lc problem: No.1976

No.1976.Number of Ways to Arrive at Destination

Author: yanglbme

solution/0700-0799/0706.Design HashMap/README.md

@@ -65,31 +65,18 @@ myHashMap.get(2);    // 返回 -1（未找到），myHashMap 现在为 [[1,1]]
 class MyHashMap:
 
     def __init__(self):
-        """
-        Initialize your data structure here.
-        """
         self.data = [-1] * 1000001
 
     def put(self, key: int, value: int) -> None:
-        """
-        value will always be non-negative.
-        """
         self.data[key] = value
 
     def get(self, key: int) -> int:
-        """
-        Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key
-        """
         return self.data[key]
 
     def remove(self, key: int) -> None:
-        """
-        Removes the mapping of the specified value key if this map contains a mapping for the key
-        """
         self.data[key] = -1
 
 
-
 # Your MyHashMap object will be instantiated and called as such:
 # obj = MyHashMap()
 # obj.put(key,value)
@@ -103,26 +90,20 @@ class MyHashMap:
 
 ```java
 class MyHashMap {
+    private int[] data = new int[1000001];
 
-    private int[] data;
-
-    /** Initialize your data structure here. */
     public MyHashMap() {
-        data = new int[1000001];
         Arrays.fill(data, -1);
     }
-
-    /** value will always be non-negative. */
+    
     public void put(int key, int value) {
         data[key] = value;
     }
-
-    /** Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key */
+    
     public int get(int key) {
         return data[key];
     }
-
-    /** Removes the mapping of the specified value key if this map contains a mapping for the key */
+    
     public void remove(int key) {
         data[key] = -1;
     }
@@ -173,8 +154,8 @@ class MyHashMap {
 ```cpp
 class MyHashMap {
 public:
- int hash[1000010];
-    
+    int hash[1000010];
+
     MyHashMap() {
         memset(hash, -1, sizeof hash);
     }

solution/0700-0799/0706.Design HashMap/README_EN.md

@@ -55,31 +55,18 @@ myHashMap.get(2);    // return -1 (i.e., not found), The map is now [[1,1]]
 class MyHashMap:
 
     def __init__(self):
-        """
-        Initialize your data structure here.
-        """
         self.data = [-1] * 1000001
 
     def put(self, key: int, value: int) -> None:
-        """
-        value will always be non-negative.
-        """
         self.data[key] = value
 
     def get(self, key: int) -> int:
-        """
-        Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key
-        """
         return self.data[key]
 
     def remove(self, key: int) -> None:
-        """
-        Removes the mapping of the specified value key if this map contains a mapping for the key
-        """
         self.data[key] = -1
 
 
-
 # Your MyHashMap object will be instantiated and called as such:
 # obj = MyHashMap()
 # obj.put(key,value)
@@ -91,26 +78,20 @@ class MyHashMap:
 
 ```java
 class MyHashMap {
+    private int[] data = new int[1000001];
 
-    private int[] data;
-
-    /** Initialize your data structure here. */
     public MyHashMap() {
-        data = new int[1000001];
         Arrays.fill(data, -1);
     }
-
-    /** value will always be non-negative. */
+    
     public void put(int key, int value) {
         data[key] = value;
     }
-
-    /** Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key */
+    
     public int get(int key) {
         return data[key];
     }
-
-    /** Removes the mapping of the specified value key if this map contains a mapping for the key */
+    
     public void remove(int key) {
         data[key] = -1;
     }
@@ -161,8 +142,8 @@ class MyHashMap {
 ```cpp
 class MyHashMap {
 public:
- int hash[1000010];
-    
+    int hash[1000010];
+
     MyHashMap() {
         memset(hash, -1, sizeof hash);
     }

solution/0700-0799/0706.Design HashMap/Solution.cpp

@@ -1,7 +1,7 @@
 class MyHashMap {
 public:
- int hash[1000010];
-    
+    int hash[1000010];
+
     MyHashMap() {
         memset(hash, -1, sizeof hash);
     }
@@ -25,4 +25,4 @@ class MyHashMap {
  * obj->put(key,value);
  * int param_2 = obj->get(key);
  * obj->remove(key);
- */
+ */

solution/0700-0799/0706.Design HashMap/Solution.java

@@ -1,33 +1,27 @@
-class MyHashMap {
-
-    private int[] data;
-
-    /** Initialize your data structure here. */
-    public MyHashMap() {
-        data = new int[1000001];
-        Arrays.fill(data, -1);
-    }
-    
-    /** value will always be non-negative. */
-    public void put(int key, int value) {
-        data[key] = value;
-    }
-    
-    /** Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key */
-    public int get(int key) {
-        return data[key];
-    }
-    
-    /** Removes the mapping of the specified value key if this map contains a mapping for the key */
-    public void remove(int key) {
-        data[key] = -1;
-    }
-}
-
-/**
- * Your MyHashMap object will be instantiated and called as such:
- * MyHashMap obj = new MyHashMap();
- * obj.put(key,value);
- * int param_2 = obj.get(key);
- * obj.remove(key);
+class MyHashMap {
+    private int[] data = new int[1000001];
+
+    public MyHashMap() {
+        Arrays.fill(data, -1);
+    }
+    
+    public void put(int key, int value) {
+        data[key] = value;
+    }
+    
+    public int get(int key) {
+        return data[key];
+    }
+    
+    public void remove(int key) {
+        data[key] = -1;
+    }
+}
+
+/**
+ * Your MyHashMap object will be instantiated and called as such:
+ * MyHashMap obj = new MyHashMap();
+ * obj.put(key,value);
+ * int param_2 = obj.get(key);
+ * obj.remove(key);
  */

solution/0700-0799/0706.Design HashMap/Solution.py

@@ -1,31 +1,20 @@
-class MyHashMap:
-    def __init__(self):
-        """
-        Initialize your data structure here.
-        """
-        self.data = [-1] * 1000001
-
-    def put(self, key: int, value: int) -> None:
-        """
-        value will always be non-negative.
-        """
-        self.data[key] = value
-
-    def get(self, key: int) -> int:
-        """
-        Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key
-        """
-        return self.data[key]
-
-    def remove(self, key: int) -> None:
-        """
-        Removes the mapping of the specified value key if this map contains a mapping for the key
-        """
-        self.data[key] = -1
-
-
-# Your MyHashMap object will be instantiated and called as such:
-# obj = MyHashMap()
-# obj.put(key,value)
-# param_2 = obj.get(key)
-# obj.remove(key)
+class MyHashMap:
+
+    def __init__(self):
+        self.data = [-1] * 1000001
+
+    def put(self, key: int, value: int) -> None:
+        self.data[key] = value
+
+    def get(self, key: int) -> int:
+        return self.data[key]
+
+    def remove(self, key: int) -> None:
+        self.data[key] = -1
+
+
+# Your MyHashMap object will be instantiated and called as such:
+# obj = MyHashMap()
+# obj.put(key,value)
+# param_2 = obj.get(key)
+# obj.remove(key)