陈旭媛

一、题目1035. DNA matchingConstraintsTime Limit: 1 secs, Memory Limit: 32 MB DescriptionDNA (Deoxyribonucleic acid) is founded in every living creature as the storage medium for geneti

一、题目：ConstraintsTime Limit: 1 secs, Memory Limit: 32 MB DescriptionOn BBS, there is a familiar term called MJ (short for MaJia), which means another BBS ID of one person besides his/her ma

一、基本的解题思路：输入的数组的规律如下arry[][]={{1,2,8,9},{2,4,9,12},{4,7,10,13},{6,8,11,15}},从左到右，从上到下依次递增数组的二维分别为rows,colums,row=0,column=columns-1从数组的右上角的数开始比较起，当arry[row][column]arry[row][column]==num，找到需要查找的

一、思路：从字符串的后面向前遍历一次替换空格。二、代码/** * 04、替换掉字符串中的空格，将空格替换成%20 */public class Solution1 { //计算空格数 public int getBlankNum(String str) { int blankNum=0; for(int i=0;i;i+

一、思路利用栈或者递归来实现链表的倒序二、代码/** *倒序输出链表 */public class Solution2 { public void reverseList(ListNode list) { if(list==null) { return;