摘要：
链接：https://leetcode-cn.com/problems/plus-one/ 代码 class Solution { public: vector<int> plusOne(vector<int>& digits) { int t = 1; for (int i = digits.si 阅读全文
摘要：
链接：https://leetcode-cn.com/problems/valid-number/submissions/ 代码 class Solution { public: bool isNumber(string s) { int l = 0, r = s.size() - 1; while 阅读全文
摘要：
链接：https://leetcode-cn.com/problems/minimum-path-sum/ 代码 class Solution { public: int minPathSum(vector<vector<int>>& grid) { int n = grid.size(); if 阅读全文