//https://leetcode.com/problems/number-of-good-pairs/
public class Solution {
public int NumIdenticalPairs(int[] nums) {
int count = 0;
for (int i = 0; i < nums.Length; i++) {
for (int j = 0; j < nums.Length; j++) {
if (i < j && nums[i] == nums[j]) {
count++;
}
}
}
return count;
}
}
-
MY PROJECTS
-
Recent Posts
- SQL. NULL and logical operators
- Java. Simple Gradle Application
- Leetcode.Solved.Missing-number
- Leetcode.Solved.Intersection-of-two-arrays
- DesignPatterns.AbstractFactory
- DesignPatterns.Factory
- Leetcode.Solved.ContainsDublicate
- Leetcode.Solved.Majority-element
- Leetcode.Solved.MergeSortedArray
- Leetcode.Solved.PlusOne
- Leetcode.Solved.SingleNumber
- Leetcode.Solved.Number-of-good-pairs
- Leetcode.Solved.Two-sum
- Leetcode.Solved.Repeated-substring-pattern
- Leetcode.Solved.Concatenation-of-array
- Leetcode.Solved. Search-insert-position
- WepPackDevServer
- Git. Rev-Parse. Getting latest commit
- Git.Log
- Git.Revert
Categories
- Aptana
- Azure
- C#
- DataSnap
- DBExpress
- Delphi
- Delphi и сети
- Delphi. Язык программирования
- ExtJS
- FastReport
- FireDAC
- FireMonkey
- GIT
- ICS
- IDE
- IIS
- Indy
- InnoSetup
- javascript
- jQuery
- JSON
- LiveBindings
- MSHTML
- MySQL
- PHP
- REST
- Ribbons
- SMS
- SQL инструкции
- SVN
- TRichView
- UniGui
- WebBroker
- WinAPI
- Windows
- Алгоритмы
- Без рубрики
- Деревья
- Ищу ответ
- Компонентостроение
- Мои компоненты
- Начальный уровень
- Обработка исключений
- Парсинг
- Потоки(Threads)
- Регулярные выражения
- Тестирование приложений