401-Week 01

youli2013 · youli2013 · commit a406bcac8370 · 2019-10-27T15:40:33.000+08:00
diff --git a/Week 01/id_401/189.rotate-array.js b/Week 01/id_401/189.rotate-array.js
@@ -0,0 +1,13 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+var rotate = function(nums, k) {
+    if(!nums || nums.length==0 || k<=0) return nums;
+    for(i=0;i<k;i++) {
+        const temp = nums.pop();
+        nums.unshift(temp);
+    }
+    return nums;
+};
diff --git a/Week 01/id_401/26.remove-duplicates-from-sorted-array.js b/Week 01/id_401/26.remove-duplicates-from-sorted-array.js
@@ -0,0 +1,19 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var removeDuplicates = function(nums) {
+    if(!nums || nums.length<=1) return nums.length;
+    let temp=nums[0];
+    let i=1;
+    while(i<nums.length){
+        if(temp===nums[i]){
+            nums.splice(i,1);
+        }
+        else{
+            temp=nums[i];
+            i++;
+        }
+    }
+    return nums.length;
+};
diff --git a/Week 01/id_401/641.design-circular-deque.js b/Week 01/id_401/641.design-circular-deque.js
@@ -0,0 +1,98 @@
+/**
+ * Initialize your data structure here. Set the size of the deque to be k.
+ * @param {number} k
+ */
+var MyCircularDeque = function(k) {
+    this.size=k;
+    this.data=[];
+};
+
+/**
+ * Adds an item at the front of Deque. Return true if the operation is successful. 
+ * @param {number} value
+ * @return {boolean}
+ */
+MyCircularDeque.prototype.insertFront = function(value) {
+    if(this.isFull())return false;
+    this.data.unshift(value);
+    return true;
+};
+
+/**
+ * Adds an item at the rear of Deque. Return true if the operation is successful. 
+ * @param {number} value
+ * @return {boolean}
+ */
+MyCircularDeque.prototype.insertLast = function(value) {
+    if(this.isFull())return false;
+    this.data.push(value)
+    return true;
+};
+
+/**
+ * Deletes an item from the front of Deque. Return true if the operation is successful.
+ * @return {boolean}
+ */
+MyCircularDeque.prototype.deleteFront = function() {
+    if(this.isEmpty())return false;
+    this.data.shift();
+    return true;
+};
+
+/**
+ * Deletes an item from the rear of Deque. Return true if the operation is successful.
+ * @return {boolean}
+ */
+MyCircularDeque.prototype.deleteLast = function() {
+    if(this.isEmpty())return false;
+    this.data.pop();
+    return true;
+};
+
+/**
+ * Get the front item from the deque.
+ * @return {number}
+ */
+MyCircularDeque.prototype.getFront = function() {
+    if(this.data.length===0) return -1;
+    return this.data[0];
+};
+
+/**
+ * Get the last item from the deque.
+ * @return {number}
+ */
+MyCircularDeque.prototype.getRear = function() {
+    let length=this.data.length;
+    if(length===0)return -1;
+    return this.data[length-1];
+};
+
+/**
+ * Checks whether the circular deque is empty or not.
+ * @return {boolean}
+ */
+MyCircularDeque.prototype.isEmpty = function() {
+    return this.data.length===0;
+};
+
+/**
+ * Checks whether the circular deque is full or not.
+ * @return {boolean}
+ */
+MyCircularDeque.prototype.isFull = function() {
+    return this.data.length===this.size;
+};
+
+/** 
+ * Your MyCircularDeque object will be instantiated and called as such:
+ * var obj = new MyCircularDeque(k)
+ * var param_1 = obj.insertFront(value)
+ * var param_2 = obj.insertLast(value)
+ * var param_3 = obj.deleteFront()
+ * var param_4 = obj.deleteLast()
+ * var param_5 = obj.getFront()
+ * var param_6 = obj.getRear()
+ * var param_7 = obj.isEmpty()
+ * var param_8 = obj.isFull()
+ */
diff --git a/Week 01/id_401/NOTE.md b/Week 01/id_401/NOTE.md
@@ -1,4 +1,6 @@
 # NOTE
 
-  
+一直对算法很有兴趣，总是坚持不下来
+
+现在工作特别忙，心理时时惦记着要来刷题，希望可以坚持下去
 

-Original file line number
+Diff line change
@@ @@ -1,4 +1,6 @@ @@
 # NOTE
+-
 +一直对算法很有兴趣，总是坚持不下来
++
 +现在工作特别忙，心理时时惦记着要来刷题，希望可以坚持下去