From ce5c5d010a778e9aadcacf903192b1da445206ff Mon Sep 17 00:00:00 2001 From: Tcotyledons <53686585+Tcotyledons@users.noreply.github.com> Date: Tue, 13 Sep 2022 13:30:31 +0800 Subject: [PATCH 01/14] =?UTF-8?q?Create=20707=E8=AE=BE=E8=AE=A1=E9=93=BE?= =?UTF-8?q?=E8=A1=A8java=E4=BB=A3=E7=A0=81=E7=9A=84=E4=BF=AE=E6=94=B9?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 代码随想录网址上链表中的力扣707设计链表中的java代码：1，对于单链表的操作，删除元素的for循环跳出条件有误，进行了修改；2，对于双向链表，进行了插入头，尾元素和插入元素的统一操作。自己在原作者基础上写了一份设计链表的java代码。 --- 707设计链表java代码的修改 | 187 +++++++++++++++++++++++++++++ 1 file changed, 187 insertions(+) create mode 100644 707设计链表java代码的修改 diff --git a/707设计链表java代码的修改 b/707设计链表java代码的修改 new file mode 100644 index 00000000..bf27e266 --- /dev/null +++ b/707设计链表java代码的修改 @@ -0,0 +1,187 @@ +//原来的代码随想录707设计链表的java代码中单链表的设计中有错误，修正后并对双链表进行了简化和更正，下面是我的java代码 + +//单链表 +class ListNode{ + int val; + ListNode next; + ListNode() {}; + ListNode(int val){ + this.val = val; + } +} + + +class MyLinkedList { + + //记录链表中元素的数量 + int size; + //记录链表的虚拟头结点 + ListNode head; + + public MyLinkedList() { + //初始化操作 + this.size = 0; + this.head = new ListNode(0); + this.head.next = null; + } + + public int get(int index) { + //判断index是否有效 + if(index<0 || index>=size){ + return -1; + } + ListNode cur = this.head; + //index 是可以取到的，因为有虚拟头结点 + for(int i=0; i<= index; i++){ + cur = cur.next; + } + return cur.val; + } + + public void addAtHead(int val) { + //等价于在第0个元素前添加 + addAtIndex(0,val); + } + + public void addAtTail(int val) { + //等价于在最后一个元素(null)前添加 + addAtIndex(size,val); + } + + public void addAtIndex(int index, int val) { + //index大于链表长度 + if(index>size){ + return; + } + //index小于0 + if(index<0){ + index = 0; + } + size++; + //找到前驱 + ListNode pre = this.head; + for(int i=0; i=size){ + return; + } + //删除操作 + size--; + ListNode pre = this.head; + for(int i=0; i=size){ + return -1; + } + ListNode cur = this.head; + //判断是哪一边遍历时间更短 + if(index >= size / 2){ + //tail开始 + cur = tail; + for(int i=0; i< size-index; i++){ + cur = cur.prev; + } + }else{ + for(int i=0; i<= index; i++){ + cur = cur.next; + } + } + return cur.val; + } + + public void addAtHead(int val) { + //等价于在第0个元素前添加 + addAtIndex(0,val); + } + + public void addAtTail(int val) { + //等价于在最后一个元素(null)前添加 + addAtIndex(size,val); + } + + public void addAtIndex(int index, int val) { + //index大于链表长度 + if(index>size){ + return; + } + //index小于0 + if(index<0){ + index = 0; + } + size++; + //找到前驱 + ListNode pre = this.head; + for(int i=0; i=size){ + return; + } + //删除操作 + size--; + ListNode pre = this.head; + for(int i=0; i Date: Tue, 13 Sep 2022 13:37:28 +0800 Subject: [PATCH 02/14] =?UTF-8?q?Delete=20707=E8=AE=BE=E8=AE=A1=E9=93=BE?= =?UTF-8?q?=E8=A1=A8java=E4=BB=A3=E7=A0=81=E7=9A=84=E4=BF=AE=E6=94=B9?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- 707设计链表java代码的修改 | 187 ----------------------------- 1 file changed, 187 deletions(-) delete mode 100644 707设计链表java代码的修改 diff --git a/707设计链表java代码的修改 b/707设计链表java代码的修改 deleted file mode 100644 index bf27e266..00000000 --- a/707设计链表java代码的修改 +++ /dev/null @@ -1,187 +0,0 @@ -//原来的代码随想录707设计链表的java代码中单链表的设计中有错误，修正后并对双链表进行了简化和更正，下面是我的java代码 - -//单链表 -class ListNode{ - int val; - ListNode next; - ListNode() {}; - ListNode(int val){ - this.val = val; - } -} - - -class MyLinkedList { - - //记录链表中元素的数量 - int size; - //记录链表的虚拟头结点 - ListNode head; - - public MyLinkedList() { - //初始化操作 - this.size = 0; - this.head = new ListNode(0); - this.head.next = null; - } - - public int get(int index) { - //判断index是否有效 - if(index<0 || index>=size){ - return -1; - } - ListNode cur = this.head; - //index 是可以取到的，因为有虚拟头结点 - for(int i=0; i<= index; i++){ - cur = cur.next; - } - return cur.val; - } - - public void addAtHead(int val) { - //等价于在第0个元素前添加 - addAtIndex(0,val); - } - - public void addAtTail(int val) { - //等价于在最后一个元素(null)前添加 - addAtIndex(size,val); - } - - public void addAtIndex(int index, int val) { - //index大于链表长度 - if(index>size){ - return; - } - //index小于0 - if(index<0){ - index = 0; - } - size++; - //找到前驱 - ListNode pre = this.head; - for(int i=0; i=size){ - return; - } - //删除操作 - size--; - ListNode pre = this.head; - for(int i=0; i=size){ - return -1; - } - ListNode cur = this.head; - //判断是哪一边遍历时间更短 - if(index >= size / 2){ - //tail开始 - cur = tail; - for(int i=0; i< size-index; i++){ - cur = cur.prev; - } - }else{ - for(int i=0; i<= index; i++){ - cur = cur.next; - } - } - return cur.val; - } - - public void addAtHead(int val) { - //等价于在第0个元素前添加 - addAtIndex(0,val); - } - - public void addAtTail(int val) { - //等价于在最后一个元素(null)前添加 - addAtIndex(size,val); - } - - public void addAtIndex(int index, int val) { - //index大于链表长度 - if(index>size){ - return; - } - //index小于0 - if(index<0){ - index = 0; - } - size++; - //找到前驱 - ListNode pre = this.head; - for(int i=0; i=size){ - return; - } - //删除操作 - size--; - ListNode pre = this.head; - for(int i=0; i Date: Tue, 13 Sep 2022 13:41:00 +0800 Subject: [PATCH 03/14] =?UTF-8?q?Update=200707.=E8=AE=BE=E8=AE=A1=E9=93=BE?= =?UTF-8?q?=E8=A1=A8.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 修改了java版本的：1，单链表中的删除元素的循环跳出条件，2，自己优化了实现了双链表中插入元素的统一，无需单独实现头部插入和尾部插入 --- problems/0707.设计链表.md | 127 ++++++++++++++++++---------------- 1 file changed, 68 insertions(+), 59 deletions(-) diff --git a/problems/0707.设计链表.md b/problems/0707.设计链表.md index 42912eda..83e57fec 100644 --- a/problems/0707.设计链表.md +++ b/problems/0707.设计链表.md @@ -358,7 +358,7 @@ class MyLinkedList { return; } ListNode pred = head; - for (int i = 0; i < index - 1; i++) { + for (int i = 0; i < index ; i++) { pred = pred.next; } pred.next = pred.next.next; @@ -366,92 +366,101 @@ class MyLinkedList { } //双链表 -class MyLinkedList { - class ListNode { - int val; - ListNode next,prev; - ListNode(int x) {val = x;} +class ListNode{ + int val; + ListNode next,prev; + ListNode() {}; + ListNode(int val){ + this.val = val; } +} + +class MyLinkedList { + + //记录链表中元素的数量 int size; - ListNode head,tail;//Sentinel node - - /** Initialize your data structure here. */ + //记录链表的虚拟头结点和尾结点 + ListNode head,tail; + public MyLinkedList() { - size = 0; - head = new ListNode(0); - tail = new ListNode(0); - head.next = tail; - tail.prev = head; + //初始化操作 + this.size = 0; + this.head = new ListNode(0); + this.tail = new ListNode(0); + //这一步非常关键，否则在加入头结点的操作中会出现null.next的错误！！！ + head.next=tail; + tail.prev=head; } - /** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */ public int get(int index) { - if(index < 0 || index >= size){return -1;} - ListNode cur = head; - - // 通过判断 index < (size - 1) / 2 来决定是从头结点还是尾节点遍历，提高效率 - if(index < (size - 1) / 2){ - for(int i = 0; i <= index; i++){ - cur = cur.next; - } - }else{ + //判断index是否有效 + if(index<0 || index>=size){ + return -1; + } + ListNode cur = this.head; + //判断是哪一边遍历时间更短 + if(index >= size / 2){ + //tail开始 cur = tail; - for(int i = 0; i <= size - index - 1; i++){ + for(int i=0; i< size-index; i++){ cur = cur.prev; } + }else{ + for(int i=0; i<= index; i++){ + cur = cur.next; + } } return cur.val; } - /** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */ public void addAtHead(int val) { - ListNode cur = head; - ListNode newNode = new ListNode(val); - newNode.next = cur.next; - cur.next.prev = newNode; - cur.next = newNode; - newNode.prev = cur; - size++; + //等价于在第0个元素前添加 + addAtIndex(0,val); } - /** Append a node of value val to the last element of the linked list. */ public void addAtTail(int val) { - ListNode cur = tail; - ListNode newNode = new ListNode(val); - newNode.next = tail; - newNode.prev = cur.prev; - cur.prev.next = newNode; - cur.prev = newNode; - size++; + //等价于在最后一个元素(null)前添加 + addAtIndex(size,val); } - /** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */ public void addAtIndex(int index, int val) { - if(index > size){return;} - if(index < 0){index = 0;} - ListNode cur = head; - for(int i = 0; i < index; i++){ - cur = cur.next; + //index大于链表长度 + if(index>size){ + return; + } + //index小于0 + if(index<0){ + index = 0; } - ListNode newNode = new ListNode(val); - newNode.next = cur.next; - cur.next.prev = newNode; - newNode.prev = cur; - cur.next = newNode; size++; + //找到前驱 + ListNode pre = this.head; + for(int i=0; i= size || index < 0){return;} - ListNode cur = head; - for(int i = 0; i < index; i++){ - cur = cur.next; + //判断索引是否有效 + if(index<0 || index>=size){ + return; } - cur.next.next.prev = cur; - cur.next = cur.next.next; + //删除操作 size--; + ListNode pre = this.head; + for(int i=0; i Date: Tue, 13 Sep 2022 22:21:15 +0800 Subject: [PATCH 04/14] =?UTF-8?q?=E6=9B=B4=E6=96=B0=200139.=E5=8D=95?= =?UTF-8?q?=E8=AF=8D=E6=8B=86=E5=88=86.md=20Java=E4=BB=A3=E7=A0=81?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 使用Set容器加速两层for循环中的查询函数，原代码在List列表中查询，本质上为三层循环，使用Set容器后为两层循环 --- problems/0139.单词拆分.md | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) diff --git a/problems/0139.单词拆分.md b/problems/0139.单词拆分.md index 7ff13f72..5b38a7a5 100644 --- a/problems/0139.单词拆分.md +++ b/problems/0139.单词拆分.md @@ -234,11 +234,13 @@ Java： ```java class Solution { public boolean wordBreak(String s, List wordDict) { + HashSet set = new HashSet<>(wordDict); boolean[] valid = new boolean[s.length() + 1]; valid[0] = true; + for (int i = 1; i <= s.length(); i++) { - for (int j = 0; j < i; j++) { - if (wordDict.contains(s.substring(j,i)) && valid[j]) { + for (int j = 0; j < i && !valid[i]; j++) { + if (set.contains(s.substring(j, i)) && valid[j]) { valid[i] = true; } } From 7e3823d619a5ec36beb29e6d2a1c573bc0c7cd00 Mon Sep 17 00:00:00 2001 From: zhicheng lee <904688436@qq.com> Date: Tue, 13 Sep 2022 22:24:58 +0800 Subject: [PATCH 05/14] =?UTF-8?q?=E6=9B=B4=E6=96=B0=200139.=E5=8D=95?= =?UTF-8?q?=E8=AF=8D=E6=8B=86=E5=88=86.md=20Java=E4=BB=A3=E7=A0=81?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 添加另一种思路的背包算法，比题解中的背包算法速度更快 --- problems/0139.单词拆分.md | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/problems/0139.单词拆分.md b/problems/0139.单词拆分.md index 5b38a7a5..3d4cdb31 100644 --- a/problems/0139.单词拆分.md +++ b/problems/0139.单词拆分.md @@ -250,6 +250,26 @@ class Solution { } } +// 另一种思路的背包算法 +class Solution { + public boolean wordBreak(String s, List wordDict) { + boolean[] dp = new boolean[s.length() + 1]; + dp[0] = true; + + for (int i = 1; i <= s.length(); i++) { + for (String word : wordDict) { + int len = word.length(); + if (i >= len && dp[i - len] && word.equals(s.substring(i - len, i))) { + dp[i] = true; + break; + } + } + } + + return dp[s.length()]; + } +} + // 回溯法+记忆化 class Solution { private Set set; From cf51b7c0397e140e68ed4dd3d5f98f6feab98e47 Mon Sep 17 00:00:00 2001 From: zhicheng lee <904688436@qq.com> Date: Tue, 13 Sep 2022 22:27:20 +0800 Subject: [PATCH 06/14] =?UTF-8?q?=E6=9B=B4=E6=96=B0=200139.=E5=8D=95?= =?UTF-8?q?=E8=AF=8D=E6=8B=86=E5=88=86.md=20Python=E4=BB=A3=E7=A0=81?= =?UTF-8?q?=E9=AB=98=E4=BA=AE?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/0139.单词拆分.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/problems/0139.单词拆分.md b/problems/0139.单词拆分.md index 3d4cdb31..d60fd46c 100644 --- a/problems/0139.单词拆分.md +++ b/problems/0139.单词拆分.md @@ -307,7 +307,7 @@ class Solution { Python： -```python3 +```python class Solution: def wordBreak(self, s: str, wordDict: List[str]) -> bool: '''排列''' From 5c6fa9bf6ab84d29b4e0f8d20385115309282dfd Mon Sep 17 00:00:00 2001 From: Asterisk <44215173+casnz1601@users.noreply.github.com> Date: Wed, 14 Sep 2022 11:24:50 -0400 Subject: [PATCH 07/14] =?UTF-8?q?Update=200797.=E6=89=80=E6=9C=89=E5=8F=AF?= =?UTF-8?q?=E8=83=BD=E7=9A=84=E8=B7=AF=E5=BE=84.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 添加Python注释 --- problems/0797.所有可能的路径.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/problems/0797.所有可能的路径.md b/problems/0797.所有可能的路径.md index f1f867f7..66376e3d 100644 --- a/problems/0797.所有可能的路径.md +++ b/problems/0797.所有可能的路径.md @@ -296,7 +296,7 @@ public: ### Java ### Python -``` +```python class Solution: def __init__(self): self.result = [] From 42e4cc2eb7a17570e64699bbc045f9cdea559967 Mon Sep 17 00:00:00 2001 From: Asterisk <44215173+casnz1601@users.noreply.github.com> Date: Wed, 14 Sep 2022 11:29:30 -0400 Subject: [PATCH 08/14] =?UTF-8?q?Update=200077.=E7=BB=84=E5=90=88.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Remove redundant comment for python --- problems/0077.组合.md | 1 - 1 file changed, 1 deletion(-) diff --git a/problems/0077.组合.md b/problems/0077.组合.md index 17e4fb35..9c473bdd 100644 --- a/problems/0077.组合.md +++ b/problems/0077.组合.md @@ -368,7 +368,6 @@ class Solution { ### Python -Python2: ```python class Solution(object): def combine(self, n, k): From 1e7ff624a131a13ae6ac35dbff1810dbfe0d0606 Mon Sep 17 00:00:00 2001 From: fw_qaq <82551626+Jack-Zhang-1314@users.noreply.github.com> Date: Sat, 17 Sep 2022 23:17:56 +0800 Subject: [PATCH 09/14] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=20rust=20=E7=89=88?= =?UTF-8?q?=E6=9C=AC?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/0035.搜索插入位置.md | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/problems/0035.搜索插入位置.md b/problems/0035.搜索插入位置.md index 5ed3ac56..4b17bec6 100644 --- a/problems/0035.搜索插入位置.md +++ b/problems/0035.搜索插入位置.md @@ -270,6 +270,26 @@ func searchInsert(nums []int, target int) int { } ``` +### Rust + +```rust +impl Solution { + pub fn search_insert(nums: Vec, target: i32) -> i32 { + let mut left = 0; + let mut right = nums.len(); + while left < right { + let mid = (left + right) / 2; + match nums[mid].cmp(&target) { + Ordering::Less => left = mid + 1, + Ordering::Equal => return ((left + right) / 2) as i32, + Ordering::Greater => right = mid, + } + } + ((left + right) / 2) as i32 + } +} +``` + ### Python ```python class Solution: From df5a6c62d50d0473745ce3406ceb4e04864fded1 Mon Sep 17 00:00:00 2001 From: vanyongqi <46806467+vanyongqi@users.noreply.github.com> Date: Tue, 20 Sep 2022 18:17:56 +0800 Subject: [PATCH 10/14] =?UTF-8?q?Update=200704.=E4=BA=8C=E5=88=86=E6=9F=A5?= =?UTF-8?q?=E6=89=BE.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 增加了二分查找C语言的左闭右开区间的版本，已通过leeitcode的验证 --- problems/0704.二分查找.md | 25 ++++++++++++++++++++++++- 1 file changed, 24 insertions(+), 1 deletion(-) diff --git a/problems/0704.二分查找.md b/problems/0704.二分查找.md index 53f5331a..26d821bd 100644 --- a/problems/0704.二分查找.md +++ b/problems/0704.二分查找.md @@ -515,7 +515,7 @@ impl Solution { ``` **C:** -```c +```c(版本一) int search(int* nums, int numsSize, int target){ int left = 0; int right = numsSize-1; @@ -541,6 +541,29 @@ int search(int* nums, int numsSize, int target){ return -1; } ``` +``` +C (版本二) +int search(int* nums, int numsSize, int target){ + int length = numsSize; + int left = 0; + int right = length;//定义target在左闭右开的区间里，即：[left, right) + int middle = 0; + while(left < right){// left == right时，区间[left, right)属于空集，所以用 < 避免该情况 + int middle = left + (right - left) / 2; + if(nums[middle] < target){ + //target位于(middle , right) 中为保证集合区间的左闭右开性，可等价为[middle + 1,right) + left = middle + 1; + }else if(nums[middle] > target){ + //target位于[left, middle)中 + right = middle ; + }else{// nums[middle] == target ，找到目标值target + return middle; + } + } + //未找到目标值，返回-1 + return -1; +} +``` **PHP:** ```php From 5da89e2613958ebd2376966516f5aad366fe04dc Mon Sep 17 00:00:00 2001 From: vanyongqi <46806467+vanyongqi@users.noreply.github.com> Date: Wed, 21 Sep 2022 08:47:25 +0800 Subject: [PATCH 11/14] =?UTF-8?q?Update=200704.=E4=BA=8C=E5=88=86=E6=9F=A5?= =?UTF-8?q?=E6=89=BE.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 增加了C语言版本的左闭右开区间版本 --- problems/0704.二分查找.md | 11 ++++++----- 1 file changed, 6 insertions(+), 5 deletions(-) diff --git a/problems/0704.二分查找.md b/problems/0704.二分查找.md index 26d821bd..012e4066 100644 --- a/problems/0704.二分查找.md +++ b/problems/0704.二分查找.md @@ -515,7 +515,8 @@ impl Solution { ``` **C:** -```c(版本一) +``` +//C (版本一) 左闭右闭区间 [left, right] int search(int* nums, int numsSize, int target){ int left = 0; int right = numsSize-1; @@ -542,13 +543,13 @@ int search(int* nums, int numsSize, int target){ } ``` ``` -C (版本二) +C (版本二) 左闭右开区间 [left, right) int search(int* nums, int numsSize, int target){ int length = numsSize; int left = 0; - int right = length;//定义target在左闭右开的区间里，即：[left, right) + int right = length; //定义target在左闭右开的区间里，即：[left, right) int middle = 0; - while(left < right){// left == right时，区间[left, right)属于空集，所以用 < 避免该情况 + while(left < right){ // left == right时，区间[left, right)属于空集，所以用 < 避免该情况 int middle = left + (right - left) / 2; if(nums[middle] < target){ //target位于(middle , right) 中为保证集合区间的左闭右开性，可等价为[middle + 1,right) @@ -556,7 +557,7 @@ int search(int* nums, int numsSize, int target){ }else if(nums[middle] > target){ //target位于[left, middle)中 right = middle ; - }else{// nums[middle] == target ，找到目标值target + }else{ // nums[middle] == target ，找到目标值target return middle; } } From 19a51162372272638c2d180dd7b9c90ade37a346 Mon Sep 17 00:00:00 2001 From: Damonfruit <425212841@qq.com> Date: Wed, 21 Sep 2022 11:45:58 +0800 Subject: [PATCH 12/14] =?UTF-8?q?=E4=BF=AE=E6=94=B9=E4=BA=86=E5=B7=A6?= =?UTF-8?q?=E9=97=AD=E5=8F=88=E5=BC=80=E5=8C=BA=E9=97=B4=E7=9A=84python?= =?UTF-8?q?=E4=BB=A3=E7=A0=81?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/0704.二分查找.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/problems/0704.二分查找.md b/problems/0704.二分查找.md index 53f5331a..51f48267 100644 --- a/problems/0704.二分查找.md +++ b/problems/0704.二分查找.md @@ -220,7 +220,8 @@ class Solution: （版本二）左闭右开区间 -```class Solution: +```python +class Solution: def search(self, nums: List[int], target: int) -> int: if nums is None or len(nums)==0: return -1 From 84e8f9c20145be25474b0b8df7737fbb9de27533 Mon Sep 17 00:00:00 2001 From: vanyongqi <46806467+vanyongqi@users.noreply.github.com> Date: Wed, 21 Sep 2022 14:05:08 +0800 Subject: [PATCH 13/14] =?UTF-8?q?Update=200704.=E4=BA=8C=E5=88=86=E6=9F=A5?= =?UTF-8?q?=E6=89=BE.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/0704.二分查找.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/problems/0704.二分查找.md b/problems/0704.二分查找.md index 012e4066..472459de 100644 --- a/problems/0704.二分查找.md +++ b/problems/0704.二分查找.md @@ -515,8 +515,8 @@ impl Solution { ``` **C:** -``` -//C (版本一) 左闭右闭区间 [left, right] +```c +## (版本一) 左闭右闭区间 [left, right] int search(int* nums, int numsSize, int target){ int left = 0; int right = numsSize-1; @@ -542,8 +542,8 @@ int search(int* nums, int numsSize, int target){ return -1; } ``` -``` -C (版本二) 左闭右开区间 [left, right) +```C +##(版本二) 左闭右开区间 [left, right) int search(int* nums, int numsSize, int target){ int length = numsSize; int left = 0; From b9a26d4edfbc1b662b0a26ec7d193002cb915e45 Mon Sep 17 00:00:00 2001 From: vanyongqi <46806467+vanyongqi@users.noreply.github.com> Date: Wed, 21 Sep 2022 14:06:15 +0800 Subject: [PATCH 14/14] =?UTF-8?q?Update=200704.=E4=BA=8C=E5=88=86=E6=9F=A5?= =?UTF-8?q?=E6=89=BE.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/0704.二分查找.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/problems/0704.二分查找.md b/problems/0704.二分查找.md index 472459de..21324db7 100644 --- a/problems/0704.二分查找.md +++ b/problems/0704.二分查找.md @@ -516,7 +516,7 @@ impl Solution { **C:** ```c -## (版本一) 左闭右闭区间 [left, right] +// (版本一) 左闭右闭区间 [left, right] int search(int* nums, int numsSize, int target){ int left = 0; int right = numsSize-1; @@ -543,7 +543,7 @@ int search(int* nums, int numsSize, int target){ } ``` ```C -##(版本二) 左闭右开区间 [left, right) +// (版本二) 左闭右开区间 [left, right) int search(int* nums, int numsSize, int target){ int length = numsSize; int left = 0;