JZ12 数值的整数次方
链接: 题目链接.
public class Solution {
public double Power(double base, int exponent) {
double cur = 1.0;
if(exponent < 0){
exponent = -1 * exponent;
while(exponent > 0){
cur = cur * base;
exponent--;
}
cur = 1/cur;
}else if(exponent == 0){
return 1;
}else{
while(exponent > 0){
cur = cur * base;
exponent--;
}
}
return cur;
}
}
102. 二叉树的层序遍历
链接: 题目链接.
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> ret = new ArrayList<>();
if (root == null) {
return ret;
}
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
List<Integer> list = new ArrayList<>();
int size = queue.size();
while(size > 0){
TreeNode cur = queue.poll();
list.add(cur.val);
if(cur.left != null){
queue.add(cur.left);
}
if(cur.right != null){
queue.add(cur.right);
}
size--;
}
ret.add(list);
}
return ret;
}
}
JZ12 数值的整数次方
链接: 题目链接.
public class Solution {
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
if(root == null){
return list;
}
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
while(!queue.isEmpty()){
TreeNode cur = queue.poll();
list.add(cur.val);
if(cur.left != null){
queue.add(cur.left);
}
if(cur.right != null){
queue.add(cur.right);
}
}
return list;
}
}