qq_37637619的博客

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public...

子集

错误的算法：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { ...

后序遍历递归方法：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution...

中序递归&&非递归递归方法：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */c...

递归方法：/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution {...

整数反转通过不断地执行 remainder=x%10; x/=10; sum = sum*10+remainder; 来实现整数低位弹出，并不断向高位移动；需要注意的点：1，判断是否溢出(溢出前进行检查）int类型的范围 [-2,147,483,648，2,147,483,647]对正数，当前一次的sum满足sum > Integer.MAX_VALUE/10 （...

实现 String的 indexof()函数；方法一：普通模式匹配class Solution { public int strStr(String haystack, String needle) { int i,j,tmpI,m=haystack.length()-needle.length(); for(i =0;i<=m;i++...

class Solution { public int removeDuplicates(int[] nums) { if(nums.length==0)//对空数组要特殊处理 return 0; int i=1,j=1; int currentNum= nums[0]; while(j<nums...

我的解法：class Solution { public int removeElement(int[] nums, int val) { int deleteNums=0;//记录非选中值要向前移动的次数 for(int i =0;i<nums.length;i++) { if(nums[i]==...