输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2]
输出:[2,3,1]
限制:
- 0 <= 链表长度 <= 10000
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public static int[] reversePrint(ListNode head) {
if (head == null) {
return new int[]{};
}
Queue<Integer> queue = new ArrayDeque<>();
Stack<Integer> stack = new Stack<>();
while (head != null) {
stack.push(head.val);
head = head.next;
}
while (!stack.isEmpty()) {
queue.add(stack.pop());
}
Object[] objects = queue.toArray();
int[] result = new int[objects.length];
for (int i = 0; i < objects.length; i++) {
result[i] = (int) objects[i];
}
return result;
}
输入某二叉树的前序遍历和中序遍历的结果,请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
例如,给出
前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
限制:
- 0 <= 节点个数 <= 5000
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public static TreeNode buildTree(int[] preorder, int[] inorder) {
return reConstructBinaryTree(preorder, 0, preorder.length - 1, inorder, 0, inorder.length);
}
private static TreeNode reConstructBinaryTree(int[] preorder, int pStart, int pEnd, int[] inorder, int iStart, int iEnd) {
if (pStart > pEnd || iStart > iEnd) {
return null;
}
TreeNode node = new TreeNode(preorder[pStart]);
int k = find(inorder, preorder[pStart], iStart, iEnd) - iStart;
node.left = reConstructBinaryTree(preorder, pStart + 1, pStart + k, inorder, iStart, iStart + k);
node.right = reConstructBinaryTree(preorder, pStart + k + 1, pEnd, inorder, iStart + k + 1, iEnd);
return node;
}
private static int find(int[] array, int target, int start, int end) {
for (int i = start; i <= end; i++) {
if (array[i] == target) {
return i;
}
}
return -1;
}
}
用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 appendTail 和 deleteHead ,分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素,deleteHead 操作返回 -1 )
示例 1:
输入:
[“CQueue”,“appendTail”,“deleteHead”,“deleteHead”]
[[],[3],[],[]]
输出:[null,null,3,-1]
示例 2:
输入:
[“CQueue”,“deleteHead”,“appendTail”,“appendTail”,“deleteHead”,“deleteHead”]
[[],[],[5],[2],[],[]]
输出:[null,-1,null,null,5,2]
提示:
- 1 <= values <= 10000
- 最多会对 appendTail、deleteHead 进行 10000 次调用
class CQueue {
Stack stack1 = new Stack();
Stack stack2 = new Stack();
public CQueue() {
}
public void appendTail(int value) {
stack1.push(value);
}
public int deleteHead() {
if (!stack2.isEmpty()) {
return (int) stack2.pop();
} else if (!stack1.isEmpty() && stack2.isEmpty()) {
while (!stack1.isEmpty()) {
stack2.push(stack1.pop());
}
return (int) stack2.pop();
} else {
return -1;
}
}
}
/**
* Your CQueue object will be instantiated and called as such:
* CQueue obj = new CQueue();
* obj.appendTail(value);
* int param_2 = obj.deleteHead();
*/
写一个函数,输入 n ,求斐波那契(Fibonacci)数列的第 n 项。斐波那契数列的定义如下:
F(0) = 0, F(1) = 1
F(N) = F(N - 1) + F(N - 2), 其中 N > 1.
斐波那契数列由 0 和 1 开始,之后的斐波那契数就是由之前的两数相加而得出。
答案需要取模 1e9+7(1000000007),如计算初始结果为:1000000008,请返回 1。
示例 1:
输入:n = 2
输出:1
示例 2:
输入:n = 5
输出:5
提示:
- 0 <= n <= 100
class Solution {
public int fib(int n) {
if (n < 2) {
return n == 0 ? 0 : 1;
} else {
Long a = 0L, b = 1L;
for (int i = 2; i < n + 1; i++) {
Long temp = (a + b)% 1000000007;
a = b;
b = temp;
}
return b.intValue();
}
}
}