Skip to content

Commit

Permalink
添加底部代码位置
Browse files Browse the repository at this point in the history
  • Loading branch information
@labuladong
labuladong committed Nov 11, 2020
1 parent 393c5c4 commit 8b8f413
Show file tree
Hide file tree
Showing 66 changed files with 247 additions and 84 deletions.
4 changes: 3 additions & 1 deletion 动态规划系列/动态规划之KMP字符匹配算法.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -428,5 +428,7 @@ KMP 算法也就是动态规划那点事，我们的公众号文章目录有一
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 动态规划系列/动态规划之博弈问题.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -212,5 +212,7 @@ int stoneGame(int[] piles) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 动态规划系列/动态规划之四键键盘.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -197,5 +197,7 @@ def dp(n, a_num, copy):
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
3 changes: 2 additions & 1 deletion 动态规划系列/动态规划之正则表达.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -292,6 +292,7 @@ bool dp(string& s, int i, string& p, int j) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 动态规划系列/动态规划设计：最长递增子序列.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -212,5 +212,7 @@ public int lengthOfLIS(int[] nums) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 动态规划系列/动态规划详解进阶.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -363,5 +363,7 @@ PS：为啥 `dp` 数组初始化为 `amount + 1` 呢，因为凑成 `amount` 金
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 动态规划系列/团灭股票问题.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -425,5 +425,7 @@ int maxProfit_k_any(int max_k, int[] prices) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
6 changes: 4 additions & 2 deletions 动态规划系列/子序列问题模板.md
View file
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
# 动态规划之子序列问题解题模板

**学好算法全靠套路，认准 labuladong 就够了**。


<p align='center'>
<a href="https://github.com/labuladong/fucking-algorithm" target="view_window"><img alt="GitHub" src="https://img.shields.io/github/stars/labuladong/fucking-algorithm?label=Stars&style=flat-square&logo=GitHub"></a>
Expand Down Expand Up @@ -171,5 +171,7 @@ int longestPalindromeSubseq(string s) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，labuladong 带你搞定 LeetCode**。
<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>
======其他语言代码======
6 changes: 3 additions & 3 deletions 动态规划系列/抢房子.md
View file
Original file line number Diff line number Diff line change
@@ -1,7 +1,5 @@
# 团灭 LeetCode 打家劫舍问题

**学好算法全靠套路，认准 labuladong 就够了**。

<p align='center'>
<a href="https://github.com/labuladong/fucking-algorithm" target="view_window"><img alt="GitHub" src="https://img.shields.io/github/stars/labuladong/fucking-algorithm?label=Stars&style=flat-square&logo=GitHub"></a>
<a href="https://www.zhihu.com/people/labuladong"><img src="https://img.shields.io/badge/%E7%9F%A5%E4%B9%[email protected]?style=flat-square&logo=Zhihu"></a>
Expand Down Expand Up @@ -257,5 +255,7 @@ int[] dp(TreeNode root) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
6 changes: 4 additions & 2 deletions 动态规划系列/最优子结构.md
View file
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
# 动态规划答疑篇

**学好算法全靠套路，认准 labuladong 就够了**。


<p align='center'>
<a href="https://github.com/labuladong/fucking-algorithm" target="view_window"><img alt="GitHub" src="https://img.shields.io/github/stars/labuladong/fucking-algorithm?label=Stars&style=flat-square&logo=GitHub"></a>
Expand Down Expand Up @@ -154,5 +154,7 @@ for (int i = 1; i < m; i++)
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 动态规划系列/最长公共子序列.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -144,5 +144,7 @@ else:
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======

This comment has been minimized.

Sign in to view

Copy link
@Edwenc

Edwenc Nov 11, 2020

Contributor

Edwenc 提供 C++ 代码：

class Solution {
public:
    int longestCommonSubsequence(string text1, string text2) {
        //  先计算两条字符串的长度
        int m = text1.size();
        int n = text2.size();

        //  构建dp矩阵  默认初始值0
        vector< vector<int> > dp ( m+1 , vector<int> ( n+1 , 0 ) );

        //  状态转移
        for ( int i=1 ; i<m+1 ; i++ ){
            for ( int j=1 ; j<n+1 ; j++ ){
                //  如果text1和text2相同
                //  就在它们的前一位基础上加一
                //  如果不同  只能在之前的两者中去最大
                dp[i][j] = (text1[i-1] == text2[j-1]) ? dp[i-1][j-1] + 1 : max( dp[i-1][j] , dp[i][j-1] );
            }
        }

        //  返回最终右下角的值
        return dp[m][n];
    }
};
4 changes: 3 additions & 1 deletion 动态规划系列/编辑距离.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -288,5 +288,7 @@ class Node {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 动态规划系列/贪心算法之区间调度问题.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -155,5 +155,7 @@ int findMinArrowShots(int[][] intvs) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 动态规划系列/高楼扔鸡蛋进阶.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -292,5 +292,7 @@ while (lo < hi) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
6 changes: 4 additions & 2 deletions 动态规划系列/高楼扔鸡蛋问题.md
View file
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
# 经典动态规划问题：高楼扔鸡蛋

**学好算法全靠套路，认准 labuladong 就够了**。


<p align='center'>
<a href="https://github.com/labuladong/fucking-algorithm" target="view_window"><img alt="GitHub" src="https://img.shields.io/github/stars/labuladong/fucking-algorithm?label=Stars&style=flat-square&logo=GitHub"></a>
Expand Down Expand Up @@ -258,5 +258,7 @@ def superEggDrop(self, K: int, N: int) -> int:
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 技术/linuxshell.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -154,5 +154,7 @@ $ sudo /home/fdl/bin/connect.sh
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 技术/linux进程.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -138,5 +138,7 @@ $ cmd1 | cmd2 | cmd3
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
6 changes: 4 additions & 2 deletions 技术/redis入侵.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -103,5 +103,7 @@ Redis 监听的默认端口是 6379，我们设置它接收网卡 127.0.0.1 的
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
</p>
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
6 changes: 4 additions & 2 deletions 技术/session和cookie.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -152,5 +152,7 @@ https://github.com/astaxie/build-web-application-with-golang
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
</p>
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
6 changes: 4 additions & 2 deletions 技术/在线练习平台.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -116,5 +116,7 @@ https://sqlzoo.net/
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
</p>
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
3 changes: 2 additions & 1 deletion 技术/密码技术.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -199,7 +199,8 @@ HTTPS 协议中的 SSL/TLS 安全层会组合使用以上几种加密方式，**
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
[test ad](https://labuladong.gitbook.io/algo)
4 changes: 3 additions & 1 deletion 数据结构系列/二叉堆详解实现优先级队列.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -236,5 +236,7 @@ public Key delMax() {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 数据结构系列/二叉搜索树操作集锦.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -307,5 +307,7 @@ void BST(TreeNode root, int target) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

This comment has been minimized.

Sign in to view

Copy link
@Guo749

Guo749 Nov 11, 2020 •
edited
Loading

郭郭提供二叉树前中后序统一遍历代码

【144. 二叉树的前序遍历】【java】
public List<Integer> preorderTraversal(TreeNode root) {
  List<Integer> res = new ArrayList<>();
  Deque<TreeNode> stack = new ArrayDeque<>();

  while(root != null || !stack.isEmpty()){
    while(root != null){
      res.add(root.val);
      stack.push(root);
      root = root.left;
    }

    TreeNode cur = stack.pop();
    root = cur.right;
  }

  return res;
}

【94. 二叉树的中序遍历】【java】
public List < Integer > inorderTraversal(TreeNode root) {
    List < Integer > res = new ArrayList < > ();
    Stack < TreeNode > stack = new Stack < > ();
    while (root != null || !stack.isEmpty()) {
        while (root != null) {
            stack.push(root);
            root = root.left;
        }
        root = stack.pop();
        res.add(root.val);
        root = root.right;
    }
    return res;
}

【145. 二叉树的后序遍历】【java】
public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        Deque<TreeNode> stack = new ArrayDeque<>();

        while(root != null || !stack.isEmpty()){
            while(root != null){
                res.add(root.val);
                stack.push(root);
                root = root.right; //对比代码， 前序遍历，唯一区别就是， 一个一直向左， 一个一直向右
            }

            TreeNode cur = stack.pop();
          	root = cur.left;
        }
        
        Collections.reverse(res);
        return res;
    }
======其他语言代码======
6 changes: 4 additions & 2 deletions 数据结构系列/单调栈.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -178,5 +178,7 @@ vector<int> nextGreaterElements(vector<int>& nums) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。
<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
</p>
<img src="../pictures/qrcode.jpg" width=200 >
</p>
======其他语言代码======
4 changes: 3 additions & 1 deletion 数据结构系列/单调队列.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -207,5 +207,7 @@ vector<int> maxSlidingWindow(vector<int>& nums, int k) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
6 changes: 4 additions & 2 deletions 数据结构系列/实现计算器.md
View file
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
# 拆解复杂问题：实现计算器

**学好算法全靠套路，认准 labuladong 就够了**。


<p align='center'>
<a href="https://github.com/labuladong/fucking-algorithm" target="view_window"><img alt="GitHub" src="https://img.shields.io/github/stars/labuladong/fucking-algorithm?label=Stars&style=flat-square&logo=GitHub"></a>
Expand Down Expand Up @@ -303,5 +303,7 @@ def calculate(s: str) -> int:
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 数据结构系列/设计Twitter.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -299,5 +299,7 @@ PS：本文前两张图片和 GIF 是我第一次尝试用平板的绘图软件
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 数据结构系列/递归反转链表的一部分.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -215,5 +215,7 @@ ListNode reverseBetween(ListNode head, int m, int n) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 数据结构系列/队列实现栈栈实现队列.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -227,5 +227,7 @@ public boolean empty() {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 算法思维系列/FloodFill算法详解及应用.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -236,5 +236,7 @@ int fill(int[][] image, int x, int y,
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 算法思维系列/UnionFind算法应用.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -247,5 +247,7 @@ boolean equationsPossible(String[] equations) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 算法思维系列/UnionFind算法详解.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -314,5 +314,7 @@ Union-Find 算法的复杂度可以这样分析：构造函数初始化数据结
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 算法思维系列/twoSum问题的核心思想.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -182,5 +182,7 @@ int[] twoSum(int[] nums, int target) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 算法思维系列/为什么推荐算法4.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -98,5 +98,7 @@
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
4 changes: 3 additions & 1 deletion 算法思维系列/二分查找详解.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -505,5 +505,7 @@ int right_bound(int[] nums, int target) {
**本小抄即将出版，微信扫码关注公众号，后台回复「小抄」限时免费获取，回复「进群」可进刷题群一起刷题，带你搞定 LeetCode**。

<p align='center'>
<img src="../pictures/table_qr2.jpg" width=500 >
<img src="../pictures/qrcode.jpg" width=200 >
</p>

======其他语言代码======
Loading

2 comments on commit 8b8f413

@Edwenc
Copy link
Contributor

@Edwenc Edwenc commented on 8b8f413 Nov 11, 2020

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

添加 “1143.最长公共子序列” 的C++版本

@sk95120
Copy link

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

本以为是奇淫技巧，非学院派的写法。毕竟int[][]都出来了。
翻了下《算法4》，结果发现，居然是根正苗红......

Please sign in to comment.