Commits

Branch selector

 master

User selector

All users

Datepicker

All time

Commit History

Commits on Jul 25, 2018

• Compare and collect during traversal

  GuanhuiGuan

  authored
  bbba46f

Commits on Jul 24, 2018

• Deque to store desc nodes, loop pop for left child, connect as right child, insert; Or use divide

  GuanhuiGuan

  authored
  0aceb83

• DFS; Check if depth==d first before checking null node, because insertion works for null node

  GuanhuiGuan

  authored
  fd6c690

• 2 walk and negate; Duplicate: one already negated; Missed: one remains positive

  GuanhuiGuan

  authored
  2961dba

Commits on Jul 22, 2018

• Use -1 height to indicate unbalanced tree

  GuanhuiGuan

  authored
  ae10386

• Merge into one tree instead of creating a new one

  GuanhuiGuan

  authored
  b693b20

• Find left boundary(top down), left leaves, right leaves, right boundary(bottom up)

  GuanhuiGuan

  authored
  5a7e0ec

• Subsequence; Find through iteration

  GuanhuiGuan

  authored
  02bcea1

• Sort and find valid prefixes OR Trie two walks

  GuanhuiGuan

  authored
  bee7632

Commits on Jul 20, 2018

• Record all subtree sums and check if half total sum exists; For total=0, check if there're at least two 0s

  GuanhuiGuan

  authored
  babbc04

Commits on Jul 19, 2018

• Treemap get low/high keys; Merge lower and higher, merge lower, merge higher or insert new

  GuanhuiGuan

  authored
  9c278cf

Commits on Jul 17, 2018

• Recursive greedy; Take leftmost for each char, then recurse on its suffix; Each sweep find the leftmost of the smallest letter encountered

  GuanhuiGuan

  authored
  90e9ac4

Commits on Jul 16, 2018

• Store the timestamp+10 in map

  GuanhuiGuan

  authored
  46e9b67

• Value map, Bucket(custom) map; Set head Bucket and tail Bucket; Buckets are doubly-linked

  GuanhuiGuan

  authored
  752d324

Commits on Jul 14, 2018

• Sliding window; Queue

  GuanhuiGuan

  authored
  154b75f

• Value map, count map, set map(count: LinkedHashSet); LinkedHashSet could be used to keep inert order with iterator; Use global minFreq to keep track of least freq

  GuanhuiGuan

  authored
  269d82d

• Split based on a's sign: a>=0: desc from both ends; a<0: asc from both ends

  GuanhuiGuan

  authored
  1d4c9af

Commits on Jul 13, 2018

• Greedy front sweep; Try to modify a[i-1] if possible to minimize effect on latter array, otherwise modify a[i]; Keep track of total modifications

  GuanhuiGuan

  authored
  75e52f7

• Start from every index, use slow/fast indices to find loop, break if wrong direction; Set failure path to 0s

  GuanhuiGuan

  authored
  01d5697

Commits on Jul 12, 2018

• Graph problem; BFS or DFS

  GuanhuiGuan

  authored
  6e9b1f3

• Treemap to store all starts; Search ceilingKey of each's end

  GuanhuiGuan

  authored
  43072f8

• Graph; BFS starting from leaves, move inwards and remove previous leaves, until number of leaves <= 2

  GuanhuiGuan

  authored
  62546c2

Commits on Jul 8, 2018

• BFS

  GuanhuiGuan

  authored
  18f8c6c

• BFS

  GuanhuiGuan

  authored
  57ab210

• Morris traversal; Fst <- prev, snd <- root

  GuanhuiGuan

  authored
  264d45b

• DP 3 loops; Recur: think about bursting the last one == nums[left]*nums[i]*nums[right], and define left and right in outer loops

  GuanhuiGuan

  authored
  6dcebf4

• DP; dp[i][j] == min num steps for s1[0->i-1] to s2[0->j-1]

  GuanhuiGuan

  authored
  c0033d3

Commits on Jul 7, 2018

• Global start and i indices in recursion; Sweep string once; Find '[', ',' or ']', or others; For ']', break current recursion

  GuanhuiGuan

  authored
  30a57d4

Commits on Jul 6, 2018

• Block comment mode; Sweep every character of every line

  GuanhuiGuan

  authored
  fa22f52

• Sweep every two rows, count number of vertical-aligned ones, res += count*(count-1)/2

  GuanhuiGuan

  authored
  1c15aeb

• Union two subtables(rID--aID, aID--rID), group by and order by

  GuanhuiGuan

  authored
  72c6e55

• SQL; Get a table to store qID, showSum and ansSum group by qID, then order by ansSum/showSum and take top

  GuanhuiGuan

  authored
  70c6539

Commits on Jul 5, 2018

• Merge conditions to 2; Count and sum arrays; res += (ValidCount-1) * numAtAge; -1 is to minus themselves

  GuanhuiGuan

  authored
  cf50f65

Commits on Jul 4, 2018

• DP; Sweep every pair; Check single situation and pair situation respectively

  GuanhuiGuan

  authored
  2e8dff0

• One matrix DP? For every position, search 4 directions from the edge of the grid

  GuanhuiGuan

  authored
  ffd6a7c

Pagination

PreviousNext