Jack的专栏

//求一个矩阵中从左上角到右下角的路线条数//使用dp的方法import java.util.*;public class Uniquepath{public static void main(String[] args){ Uniquepath uniquepath = new Uniquepath(); uniquepath.Uniquepath(2,2);}

字符串处理：问题描述：把一个字符串中的除了大写字母，小写字母，数字之外的字符过滤掉，输出新的字符串。要求实现该函数：void my_string(char *input,char *output)*/#include #include #include void my_string(char *input,char *output){ //char str_in[100]

打算从今天开始开辟一个LeetCode专栏，收集并讲解LeetCode网站的一些题目。今天的题目是LeetCode第37期的第一个题目，比较简单。Given m arrays, and each array is sorted in ascending order. Now you can pick up two integers from two different arrays (each

Given a positive integer a, find the smallest positive integer b whose multiplication of each digit equals to a.If there is no answer or the answer is not fit in 32-bit signed integer, then return 0