112.路经总和
给定一个二叉树和一个目标和,判断该树中是否存在根节点到叶子节点的路径,这条路径上所有节点值相加等于目标和。
说明: 叶子节点是指没有子节点的节点。
示例:
给定如下二叉树,以及目标和 sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ \
7 2 1
返回 true, 因为存在目标和为 22 的根节点到叶子节点的路径 5->4->11->2。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
void traversal(struct TreeNode* root, int cur, bool * res, int target){
if(!root) return;
cur += root->val;
if(!root->right && !root->left){
if(cur == target) (*res) = true;
return;
}
traversal(root->left, cur, res, target);
traversal(root->right, cur, res, target);
}
bool hasPathSum(struct TreeNode* root, int sum){
int res = false;
traversal(root, 0, &res, sum);
return res;
}
143.重排链表
给定一个单链表 L:L0→L1→…→Ln-1→Ln ,
将其重新排列后变为: L0→Ln→L1→Ln-1→L2→Ln-2→…
你不能只是单纯的改变节点内部的值,而是需要实际的进行节点交换。
示例 1:
给定链表 1->2->3->4, 重新排列为 1->4->2->3.
示例 2:
给定链表 1->2->3->4->5, 重新排列为 1->5->2->4->3.
struct ListNode * reverse(struct ListNode * head)
{
struct ListNode pre;
pre.next = NULL;
while(head){
struct ListNode * next = head->next;
head->next = pre.next;
pre.next = head;
head = next;
}
return pre.next;
}
void reorderList(struct ListNode* head){
if(head == NULL || head->next == NULL || head->next->next == NULL) return;
struct ListNode *fast = head;
struct ListNode *slow = head;
while(fast->next && fast->next->next){
fast = fast->next->next;
slow = slow->next;
}
struct ListNode * newhead = slow->next;
slow->next = NULL;
newhead = reverse(newhead);
while(newhead){
struct ListNode * next = newhead->next;
newhead->next = head->next;
head->next = newhead;
head = newhead->next;
newhead = next;
}
}