5382.?HTML 實體解析器 class Solution:def entityParser(self, text: str) -> str:text = text.replace('"', '"')text = text.replace(''', "'")text = text.replace('&', '

題目：Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in place with constant memory. leetcode70。 For example, Gi

Given a singly linked list?L:?L0→L1→…→Ln-1→Ln,reorder it to:?L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes' values. leetcode121？For example,Given?{1,2,3,4}, reorder it to?{1,4,2,3}. ? 看上去有點難，實際

題目如下： Given two integers?n?and?k, you need to construct a list which contains?ndifferent positive integers ranging from?1?to?n?and obeys the following requirement:?Suppose this list is [a1, a2, a3, ... , an], then the list [|a1?- a2|, |a2?- a3|

Given an array of integers, every element appears?twice?except for one. Find that single one. 這個方法重來沒見過，以后估計也不會再見了。。 1 public static int singleNumber(int[] A) { 2 int sum = 0; 3 for (int a : A) { 4 sum ^= a; 5 } 6 retur

題目： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:Given the below binary tree and?sum = 22, 5/ \4 8/ / \11 13 4/ \ / \7 2 5 1 return [[5,4,11,2],[5,8,4,5] ] 解題思路

Clone an undirected graph. Each node in the graph contains a?label?and a list of its?neighbors. [解題思路] 圖的遍歷有兩種方式，BFS和DFS 這里使用BFS來解本題，BFS需要使用queue來保存neighbors LEETCODE。但這里有個問題，在clone一個節點時我們需

這道題要求的一個min和一個max，只是這個min所在的位置要在max所在位置的左邊。 有一種做法是采用蠻力算法，也就是通過從左往右遍歷，把每一個元素都當做min，然后再在這個元素的右邊找一個最大值，這樣得到一個profit，最后求得所有情況

原題地址：https://oj.leetcode.com/problems/largest-rectangle-in-histogram/ 題意： Given?n?non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.

版權聲明：本文為博主原創文章，未經博主允許不得轉載。 https://blog.csdn.net/SunnyYoona/article/details/43562603 題目 Given an index k, return the kth row of the Pascal’s triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could yo