摘要：
public class Solution { public IList<IList<int>> Generate(int numRows) { var list = new List<IList<int>>(); for (int i = 0; i < numRows; i++) { var ro 阅读全文
摘要：
public class Solution { public int[] PlusOne(int[] digits) { var last = digits[digits.Length - 1]; if (last + 1 < 10) { digits[digits.Length - 1]++; r 阅读全文
摘要：
https://leetcode.com/problems/valid-perfect-square/#/description 阅读全文
摘要：
/** * Definition for a binary tree node. * public class TreeNode { * public int val; * public TreeNode left; * public TreeNode right; * public TreeNod 阅读全文
摘要：
https://leetcode.com/problems/reverse-vowels-of-a-string/#/description 阅读全文
摘要：
public class Solution { public int RemoveElement(int[] nums, int val) { var len = nums.Length; var count = 0; for (int i = 0; i < nums.Length; i++) { 阅读全文
摘要：
https://leetcode.com/problems/power-of-four/#/description 阅读全文