package skyseraph.android.util; /** * @Title : Constant.java * @Package : tcl.nfc.tv.util * @ClassName : Constant * @Description : TODO * @author : skyseraph00@163.com * @date : 2013-5-20 上午9:31:10 * @version : V1.0 */ public class MyConstant { publi…

package skyseraph.android.util; /** * @Title : LogUtil.java * @Package : tcl.nfc.phone.util * @ClassName : LogUtil * @Description : 通用调试类 * @author : skyseraph00@163.com * @date : 2013-5-16 上午9:22:43 * @version : V1.2 */ public class LogUtil { public…

package skyseraph.android.util.nfc; import com.google.common.collect.BiMap; import com.google.common.collect.ImmutableBiMap; import skyseraph.android.util.LogUtil; import skyseraph.android.util.MyConstant; import android.annotation.SuppressLint; impo…

package skyseraph.easytagwrite; import skyseraph.android.util.CustomDialog; import skyseraph.android.util.LogUtil; import skyseraph.android.util.MyConstant; import skyseraph.android.util.nfc.BobNdefMessage; import android.app.Activity; import android…

package skyseraph.android.util; import skyseraph.easytagwrite.R; import android.app.Dialog; import android.content.Context; import android.content.DialogInterface; import android.graphics.drawable.Drawable; import android.view.LayoutInflater; import…

You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Note: Given n will be a positive integer. Example 1: Input: 2 Output: 2 Explanation:…

You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to…

Given a binary tree, return all root-to-leaf paths. Note: A leaf is a node with no children. Example: Input: 1 / \ 2 3 \ 5 Output: ["1->2->5", "1->3"] Explanation: All root-to-leaf paths are: 1->2->5, 1->3 思路为DFS, 只是a…

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 But the following [1,2,2,null,3,null,3] is not: 1 / \ 2 2 \ \ 3 3 Not…

欢迎访问我的GitHub https://github.com/zq2599/blog_demos 内容:所有原创文章分类汇总及配套源码,涉及Java.Docker.Kubernetes.DevOPS等: 关于<JUnit5学习>系列 <JUnit5学习>系列旨在通过实战提升SpringBoot环境下的单元测试技能,一共八篇文章,链接如下: 基本操作 Assumptions类 Assertions类 按条件执行 标签(Tag)和自定义注解 参数化测试(Parameterized T…