代码改变世界

How to Delete a Git Branch Both Locally and Remotely

2023-05-23 16:21 by jetwill, 8 阅读, 0 推荐, 收藏, 编辑
摘要:# TL;DR version ``` https://www.freecodecamp.org/news/how-to-delete-a-git-branch-both-locally-and-remotely/ // delete branch locally git branch -d loc 阅读全文

Fix for PowerShell Script Not Digitally Signed

2023-01-16 18:06 by jetwill, 38 阅读, 0 推荐, 收藏, 编辑
摘要:When you run a .ps1 PowerShell script you might get the message saying “.ps1 is not digitally signed. The script will not execute on the system.” To f 阅读全文

curl equivalent of wget

2023-01-09 18:17 by jetwill, 12 阅读, 0 推荐, 收藏, 编辑
摘要:# https://www.thegeekstuff.com/2012/07/wget-curl/ # https://linuxpip.org/curl-failed-to-verify-the-legitimacy-of-the-server/ wget xxxx.yyy equivalent 阅读全文

BM2 链表内指定区间反转

2022-09-21 13:28 by jetwill, 28 阅读, 0 推荐, 收藏, 编辑
摘要:/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { 阅读全文

NowCoder BM1 反转链表

2022-08-31 13:18 by jetwill, 22 阅读, 0 推荐, 收藏, 编辑
摘要:描述 给定一个单链表的头结点pHead(该头节点是有值的,比如在下图,它的val是1),长度为n,反转该链表后,返回新链表的表头。 NowCoder BM1 反转链表 import java.util.*; /* public class ListNode { int val; ListNode n 阅读全文

QuickSort

2022-06-27 21:17 by jetwill, 100 阅读, 0 推荐, 收藏, 编辑
摘要:Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot. The 阅读全文

leetcode 226 Invert Binary Tree

2022-06-14 13:20 by jetwill, 18 阅读, 0 推荐, 收藏, 编辑
摘要:Given the root of a binary tree, invert the tree, and return its root. Example 1: Input: root = [4,2,7,1,3,6,9] Output: [4,7,2,9,6,3,1] Example 2: Inp 阅读全文

leetcode 110 Balanced Binary Tree

2022-06-14 13:01 by jetwill, 15 阅读, 0 推荐, 收藏, 编辑
摘要:Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the lef 阅读全文

leetcode 104 maximum-depth-of-binary-tree

2022-06-14 12:38 by jetwill, 16 阅读, 0 推荐, 收藏, 编辑
摘要:https://leetcode.cn/problems/maximum-depth-of-binary-tree/submissions/ https://www.bilibili.com/video/BV11Y4y1q7YA?p=27 Given the root of a binary tre 阅读全文

leetcode-0101 symmetric-tree

2022-05-31 21:14 by jetwill, 16 阅读, 0 推荐, 收藏, 编辑
摘要:https://leetcode.cn/problems/symmetric-tree/ Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its cente 阅读全文
上一页 1 2 3 4 5 6 ··· 20 下一页