# LeetCode

## Force button 416. Dividing equal sum subsets knapsack problem

416. Divide equal sum subsets to give a nonempty array containing only positive integers . Can I split this array into two subsets , Make the sum o...
2020-10-23 20:49 views 4

## find method Force button 496 The next bigger element I

496 The next bigger element I Given two There are no duplicate elements Array of nums1 and nums2 , among nums1 yes nums2 Subset of . fi...
2020-08-25 09:53 views 4

## LeetCode 167. Sum of two numbers II - Input ordered array

Given one is in ascending order Ordered array of , Find two numbers so that their sum equals the target number . The function should return thes...
2020-08-12 11:01 views 3

## leetcode Brush the topic 155 Minimum stack Min Stack（ simple ） Python Java

Topic overview ： Design a support push,pop,top operation , The stack of the smallest element can be retrieved in a constant time .push(x) – Ele...
2020-08-01 08:23 views 4

## LeetCode Sword finger Offer 28. Symmetric binary trees

LeetCode Sword finger Offer 28. Symmetric binary trees _ Symmetric binary tree Complexity
2020-07-07 05:17 views 7

## LeetCode 67. Binary summation Add Binary（C language ）

Title Description ： Given two binary strings , Back to their and （ In binary form ）. The input is a non empty string and contains only numbers 1 ...
2020-07-03 03:21 views 4

## Buckle （LeetCode）Java Brush the topic simple + secondary （ Phase I ）

1. Sum of two numbers （ Simple questions ） Title Description ： Given an array of integers nums And a target value target, Please find the target...
2020-07-02 16:01 views 7

## LeetCode-67- Binary summation -C language

int get_len(char *s){ int i = 0; while(*s++ != \\0) i++; return i;}char* reverse(char *s, int len){ int i=0, j=len-1; while(i
2020-07-02 08:37 views 5
Technology
Daily Recommendation