leetcode day1

最新推荐文章于 2024-04-04 22:16:29 发布

原创最新推荐文章于 2024-04-04 22:16:29 发布 · 169 阅读

CC 4.0 BY-SA版权

本文深入解析了LeetCode上的三道经典算法题：TwoSum问题，比较两棵二叉树是否相同，以及寻找最大子数组和。通过详细的代码示例，展示了如何使用哈希表解决TwoSum问题，如何递归地比较二叉树节点以确定树的结构和值是否相等，以及如何采用动态规划思想找到数组中具有最大和的连续子数组。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1. Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

talk is cheap,show me the code

class Solution {

public int[] twoSum(int nums[],int target) {

HashMap<Integer,Integer> twoSum = new HashMap<>();

for (int i=0;i<nums.length;i++) {

twoSum.put(nums[i],i);

}

for (int i=0;i<nums.length-1;i++) {

int another = target-nums[i];

if (twoSum.containsKey(another) && i!=twoSum.get(another)) {

return new int[] {i,twoSum.get(another)};

}

throw new IllegalArgumentException("no two num solution");

}

100. Same Tree

Given two binary trees, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

Example 1:

Input:     1         1
          / \       / \
         2   3     2   3

        [1,2,3],   [1,2,3]Output: true

Example 2:

Input:     1         1
          /           \
         2             2

        [1,2],     [1,null,2]Output: false

Example 3:

Input:     1         1
          / \       / \
         2   1     1   2

        [1,2,1],   [1,1,2]Output: false

talk is cheap，let you see me code

/**

* Definition for a binary tree node.

* public class TreeNode {

* int val;

* TreeNode left;

* TreeNode right;

* TreeNode(int x) { val = x; }

* }

*/

class Solution {

public boolean isSameTree(TreeNode p, TreeNode q) {

if (p == null && q == null) {

return true;

}

return p !=null && q !=null && p.val == q.val && isSameTree(p.left,q.left) && isSameTree(p.right,q.right);

}

53. Maximum Subarray

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

Follow up:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

talk is cheap show me the code

class Solution {

public int maxSubArray(int[] nums) {

int sum = nums[0];

int maxSum = sum;

for (int i=1; i< nums.length;i++) {

if (sum >0) {

sum = sum + nums[i];

} else {

sum = nums[i];

}

if (sum > maxSum) {

maxSum = sum;

}

return maxSum;

}