# LeetCodePro

**Repository Path**: junbujianwpl/LeetCodePro

## Basic Information

- **Project Name**: LeetCodePro
- **Description**: LeetCode solutions in cpp.
- **Primary Language**: C++
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2017-09-21
- **Last Updated**: 2023-03-24

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# LeetcodePro
my leetcode solutions in cpp 

[![Build Status](https://travis-ci.org/junbujianwpl/LeetcodePro.svg?branch=master)](https://travis-ci.org/junbujianwpl/LeetcodePro)


## plans
- [ ] use cmake to build it
- [ ] finetune directory
- [ ] make it work
- [ ] make it a code base ability practice project


## Done
        * two sum
        * three sum
        * two sum index
        * del same ele in a sorted array. and can set the max of duplication.



## Thoughts
        * convert
        > del elements when count exceed max can convert to del all same only keep one just by adjusting the min compare step number.
        why? still confused.
        how to get the common law and extract the thinking style.


# cpp playground
c++11/14/17 or etc


# config

## windows
install mingwin from github, use posix version  


# 2种启动方式cmake/DebugCurrentFile
一种是写cmakefile，把多个cpp组成一个项目，一种是运行单个cpp文件，方便测试某个具体的特性  
单文件方式要写main函数，引用外部头文件需要用相对目录，稍微有些难管理，本质上其实是一样的