Fork me on GitHub
摘要: /** * Given two sorted integer arrays A and B, merge B into A as one sorted array. * Note: * You may assume that A has enough space to hold additional elements from B. * The number of elements initial 阅读全文
posted @ 2019-08-09 10:34 gentleKay 阅读(150) 评论(0) 推荐(0)
摘要: /** * Given a binary tree, check whether it is a mirror of itself * (ie, symmetric around its center). * 1 * / \ * 2 2 * / \ / \ * 3 4 4 3 * * 对于二叉树,检查它是否是自身的镜像(即,围绕其中心对称)。 * 例如,此二叉树是对称的: * 1 * / \ * 阅读全文
posted @ 2019-08-09 10:33 gentleKay 阅读(308) 评论(0) 推荐(0)
摘要: /** * Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. * For example: * Given the below binary tree 阅读全文
posted @ 2019-08-09 10:32 gentleKay 阅读(128) 评论(0) 推荐(0)