LeetCode

題目

Given the root node of a binary search tree and two integers low and high, return the sum of values of all nodes with a value in the inclusive range [low, high].

題目

The power of the string is the maximum length of a non-empty substring that contains only one unique character.

Given a string s, return the power of s.

… Read More »LeetCode: 1306-Jump Game III

題目

Given head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary representation of a number.

Return the decimal value of the number in the linked list.

… Read More »LeetCode: 1217-Minimum Cost to Move Chips to The Same Position

… Read More »LeetCode: 54-Maximum Subarray

題目

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

Given two integers x and y, return the Hamming distance between them.

題目

Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes (i.e., only nodes themselves may be changed.)