【LeetCode】JAVA 代码模板(总结中)

最新推荐文章于 2024-06-19 11:18:38 发布

易意逸

最新推荐文章于 2024-06-19 11:18:38 发布

阅读量1.7k

点赞数 3

分类专栏： LeetCode刷题系列

本文链接：https://blog.csdn.net/weixin_43170297/article/details/106645102

版权

本文汇总了LeetCode中的核心算法模板，包括二分查找、各种排序算法、BFS、DFS、回溯法、树的遍历、构建完全二叉树、并查集、前缀树、图遍历算法、最小生成树、拓扑排序以及动态规划和贪心算法等，是Java刷题必备参考资料。

摘要由CSDN通过智能技术生成

【LeetCode】代码模板，刷题必会(Python大佬总结的)

一: 二分查找

个人建议将 int mid = left + (right - left) / 2; 换成int mid = left + ((right - left)>>1);(在所有运算中,位运算是最高效的)
LeetCode官方模板一:

int binarySearch(int[] nums, int target){
   
  if(nums == null || nums.length == 0)
    return -1;

  int left = 0, right = nums.length - 1;
  while(left <= right){
   
    // Prevent (left + right) overflow
    int mid = left + (right - left) / 2;
    if(nums[mid] == target){
    return mid; }
    else if(nums[mid] < target) {
    left = mid + 1; }
    else {
    right = mid - 1; }
  }

  // End Condition: left > right
  return -1;
}

LeetCode官方模板二 :

int binarySearch(int[] nums, int target){
   
  if(nums == null || nums.length == 0)
    return -1;

  int left = 0, right = nums.length;
  while(left < right){
   
    // Prevent (left + right) overflow
    int mid = left + (right - left) / 2;
    if(nums[mid] == target){
    return mid; }
    else if(nums[mid] < target) {
    left = mid + 1; }
    else {
    right = mid; }
  }

  // Post-processing:
  // End Condition: left == right
  if(left != nums.length && nums[left] == target) return left;
  return -1;
}

LeetCode官方模板三

int binarySearch(int[] nums, int target) {
   
    if (nums == null || nums.length == 0)
        return -1;

    int left = 0, right = nums.length - 1;
    while (left + 1 < right){
   
        // Prevent (left + right) overflow
        int mid = left + (right - left) / 2;
        if (nums[mid] == target) {
   
            return mid;
        } else if