On platforms like LeetCode, if one looks at the solutions provided by top coders after solving problems, one often encounters a peculiar piece of code (C++ only):
Read More »[C++] The meaning of ios_base::sync_with_stdio(false) and cin.tie(NULL) in programming competition
Design a food rating system that can do the following:
Given two strings s and t, return true if t is an anagram of s, and false otherwise.
You are given the array paths, where paths[i] = [cityAi, cityBi] means there exists a direct path going from cityAi to cityBi. Return the destination city, that is, the city without any path outgoing to another city.
Given the root of a binary tree, construct a string consisting of parenthesis and integers from a binary tree with the preorder traversal way, and return it.
You are given a string num, representing a large integer. Return the largest-valued odd integer (as a string) that is a non-empty substring of num, or an empty string "" if no odd integer exists.
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order.Read More »LeetCode: 1-Two Sum Solution