xiaoyongyong

摘要： 對于一個數組 arr[1...n]，F(xiàn)enwick Tree 可以支持兩種操作： update(i, delta)：將 arr[i] += delta query(i)：返回前綴和 arr[1] + arr[2] + ... + arr[i] 它的時間復雜度為： 構建：O(n) 查詢：O(log n 閱讀全文

摘要： 3447. Assign Elements to Groups with Constraints Solved Medium Topics Companies Hint You are given an integer array groups, where groups[i] represents 閱讀全文

摘要： 1878. Get Biggest Three Rhombus Sums in a Grid You are given an m x n integer matrix grid???. A rhombus sum is the sum of the elements that form the b 閱讀全文

摘要： 126. Word Ladder II A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 - 閱讀全文

摘要： 使用著色法來判定一個圖是否為二分圖，或者是否包含奇環(huán)（包含奇環(huán)的話就不是二分圖） 785. Is Graph Bipartite? There is an undirected graph with n nodes, where each node is numbered between 0 and 閱讀全文

摘要： 564. Find the Closest Palindrome Given a string n representing an integer, return the closest integer (not including itself), which is a palindrome. I 閱讀全文

摘要： 296. Best Meeting Point Given an m x n binary grid grid where each 1 marks the home of one friend, return the minimal total travel distance. The total 閱讀全文

摘要： 1526. Minimum Number of Increments on Subarrays to Form a Target Array You are given an integer array target. You have an integer array initial of the 閱讀全文

摘要： 3186. Maximum Total Damage With Spell Casting A magician has various spells. You are given an array power, where each element represents the damage of 閱讀全文

摘要： 給定一個數組，沒有重復元素，要將其排列為一小一大一小一大, 比如： [8,6,7,3,4,5] 結果是: [6,8,3,7,4,5] [1,2,3,4,5] 結果是： [1,3,2,5,4] one pass void sort(int[] arr) { for(int i = 0; i < arr 閱讀全文